Skip to main content

Private Indexes for Mixed Encrypted Databases

  • Chapter
  • First Online:
Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIII

Part of the book series: Lecture Notes in Computer Science ((TLDKS,volume 9480))

  • 539 Accesses

Abstract

Data privacy and query performance are two closely linked and inconsistent challenges for outsourced databases. Using mixed encryption methods on data attributes can partially reach a trade-off between the two challenges. However, encryption cannot always hide the correlations between attribute values. When the data tuples are accessed selectively, inferences based on comparing encrypted values could be launched, and some sensitive values may be disclosed. In this paper, we explore the intra-attribute based and inter-attribute based inferences in mixed encrypted databases. We develop a method to construct private indexes on encrypted values to defend against those inferences while supporting efficient selective access to encrypted data. We have conducted some experiments to validate our proposed method.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order-preserving encryption for numeric data. In: Proceedings of SIGMOD 2004, pp. 563–574 (2004)

    Google Scholar 

  2. Boldyreva, A., Chenette, N., Lee, Y., O’Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224–241. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Boldyreva, A., Chenette, N., O’Neill, A.: Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 578–595. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Damiani, E., Vimercati, S., Jajodia, S., Paraboschi, S., Samarati, P.: Balancing confidentiality and efficiency in untrusted relational DBMSs. In: Proceedings of ACM CCS 2003, pp. 93–102 (2003)

    Google Scholar 

  5. Damiani, E., Vimercati, S., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: Key management for multi-user encrypted databases. In: Proceedings of Storage SS 2005, pp. 74–83 (2005)

    Google Scholar 

  6. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC 2009, pp. 169–178 (2009)

    Google Scholar 

  7. Hacigumus, H., Iyer, B., Li, C., Mehrotra, S.: Executing SQL over encrypted data in the database-service-provider model. In: Proceedings of ACM SIGMOD 2002, pp. 216–227 (2002)

    Google Scholar 

  8. Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Proceedings of VLDB 2004, pp. 223–235 (2004)

    Google Scholar 

  9. Miklau, G., Suciu, D.: Controlling access to published data using cryptography. In: Proceedings of VLDB 2003, pp. 898–909 (2003)

    Google Scholar 

  10. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Popa, R., Redfield, C., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of SOSP 2001, pp. 85–100 (2011)

    Google Scholar 

  12. Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE S&P 2000, pp. 44–55 (2000)

    Google Scholar 

  13. To, Q., Nguyen, B., Pucheral, P.: Privacy-preserving query execution using a decentralized architecture and tamper resistant hardware. In: Proceedings of EDBT 2014, pp. 487–198 (2014)

    Google Scholar 

  14. Tu, S., Kaashoek, M.F., Madden, S., Zeldovich, N.: Processing analytical queries over encrypted data. In: Proceedings of VLDB 2013 (2013)

    Google Scholar 

  15. Vimercati, S., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: Private data indexes for selective access to outsourced data. In: Prodeedings of WPES 2011, pp. 69–80 (2011)

    Google Scholar 

  16. Yang, G., Tan, C.H., Huang, Q., Wong, D.S.: Probabilistic public key encryption with equality test. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 119–131. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Yu, S., Wang, C., Ren, K., Lou, W.: Achieving secure, scalable, and fine-grained data access control in cloud computing. In: Proceedings of INFOCOM 2010, pp. 534–542 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Tang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tang, Y., Zhang, X., Zhang, J. (2016). Private Indexes for Mixed Encrypted Databases. In: Hameurlain, A., Küng, J., Wagner, R., Dang, T., Thoai, N. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIII. Lecture Notes in Computer Science(), vol 9480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49175-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49175-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49174-4

  • Online ISBN: 978-3-662-49175-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics