Skip to main content

SSSDB: Database with Private Information Search

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9511))

Included in the following conference series:

Abstract

This paper presents searchable secret shares (SSS), a novel method to search and collect statistics about private information quickly without retrieving secretly shared data, which is stored in public clouds separately. The new capabilities of SSS serve as a base for a newly defined SSS database SSSDB with reduced communication overhead and better security compared with private information retrieval (PIR) based databases. Clouds know neither the database stored in their disks nor the searched patterns and the results. Unlike PIR based databases, SSSDB does not need to maintain an access data structure for mapping keys to indexes performing inserts and deletes in the user memory, and therefore avoids possible information leakage. SSSDB is information-theoretically secure and can be implemented using a small integer field which implies high memory and computation efficiencies.

X. Li—Supported by the National Natural Science Foundation of China (No. 61472146, 61402184), Science and Technology Planning Project of Guangdong Province (2013B010401020), the Project-sponsored by SRF for ROCS, SEM.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Security First Corp. https://www.securityfirstcorp.com/, https://www.linkedin.com/company/navajo-systems

  2. Agrawal, D., El Abbadi, A., Emekci, F., Metwally, A., Wang, S.: Secure data management service on cloud computing infrastructures. In: Agrawal, D., Candan, K.S., Li, W.-S. (eds.) Information and Software as Services. LNBIP, vol. 74, pp. 57–80. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965–981 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dolev, S., Gilboa, N., Li, X.: Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. Cryptology ePrint Archive, Report /611 (2014). http://eprint.iacr.org/

  5. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed) STOC 2009, Bethesda, MD, USA, May 31–June 2, 2009, pp. 169–178. ACM (2009)

    Google Scholar 

  6. Gentry, C.: Toward basing fully homomorphic encryption on worst-case hardness. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 116–137. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Gentry, C., Halevi, S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: FOCS 2011, pp. 107–109. IEEE Computer Society (2011)

    Google Scholar 

  8. Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Hadavi, M.A., Jalili, R.: Secure data outsourcing based on threshold secret sharing; towards a more practical solution. In: Proceedings VLDB, Ph.D, Workshop, pp. 54–59 (2010)

    Google Scholar 

  10. Liu, Y., Wu, H.-L., Chang, C.-C.: A fast and secure scheme for data outsourcing in the cloud. KSII Trans. Internet Inf. Syst. (TIIS) 8(8), 2708–2721 (2014)

    Google Scholar 

  11. Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP 2011, pp. 85–100. ACM, New York (2011)

    Google Scholar 

  12. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  13. Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM (2011). arxiv:1106.3652

  14. Tian, X.X., Sha, C.F., Wang, X.L., Zhou, A.Y.: Privacy preserving query processing on secret share based data storage. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 108–122. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ximing Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Avni, H., Dolev, S., Gilboa, N., Li, X. (2016). SSSDB: Database with Private Information Search. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2015. Lecture Notes in Computer Science(), vol 9511. Springer, Cham. https://doi.org/10.1007/978-3-319-29919-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29919-8_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29918-1

  • Online ISBN: 978-3-319-29919-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics