Skip to main content

Different Search Strategies on Encrypted Data Compared

  • Chapter
Security, Privacy, and Trust in Modern Data Management

Part of the book series: Data-Centric Systems and Applications ((DCSA))

Abstract

When private information is stored in databases that are under the control of others, the only possible way to protect it is to encrypt it before storing it. In order to efficiently retrieve the data, a search mechanism that still works over the encrypted data is needed. In this chapter an overview of several search strategies is given. Some add meta-data to the database and do the searching only in the metadata, others search in the data itself or use secret sharing to solve the problem. Each strategy has its own advantages and disadvantages.

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Hacıgümüş, Balakrishna R. Iyer, Chen Li, and Sharad Mehrotra. Executing SQL over encrypted data in the database service provider model. In SIGMOD Conference, 2002.

    Google Scholar 

  2. H. Hacıgümüş, B. Iyer, and S. Mehrotra. Efficient execution of aggregation queries over encrypted relational databases. In Proc. of the 9th International Conference on Database Systems for Advanced Applications, Jeju Island, Korea, March 2004.

    Google Scholar 

  3. H. Hacıgümüş, B. Iyer, C. Li, and S. Mehrotra. SSQL: Secure SQL in an insecure environment. VLDB Journal, 2006.

    Google Scholar 

  4. Hakan Hacıgümüş, Bala Iyer, and Sharad Mehrotra. Efficient execution of aggregation queries over encrypted relational databases. In Kyu-Young Whang Doheon Lee YoonJoon Lee, Jianzhong Li, editor, Database Systems for Advanced Applications: 9th International Conference, DASFAA 2004, volume LNCS 2973, pages 125–136, Jeju Island, Korea, March 2003. Springer Verlag.

    Google Scholar 

  5. Josep Domingo-Ferrer and Jordi Herrera-Joancomartí. A privacy homomorphism allowing field operations on encrypted data. Jornades de Metemàtica Discreta i Algorísmica, 1998.

    Google Scholar 

  6. E. Damiani, S. De Capitani di Vimercati, S. Jajodia, S. Paraboschi, and P. Samarati. Balancing confidentiality and efficiency in untrusted relational dbmss. In Proc. of the 10th ACM Conference on Computer and Communications Security, pages 93–102, Washington, DC, USA, October 2003. ACM Press New York, NY, USA. http://seclab.dti.unimi.it/Papers/ccs03.pdf.

    Chapter  Google Scholar 

  7. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy, pages 44–55, 2000. http://citeseer.nj.nec.com/song00practical.html.

    Google Scholar 

  8. R. Brinkman, L. Feng, J. M. Doumen, P. H. Hartel, and W. Jonker. Efficient tree search in encrypted data. Information Systems Security Journal, 13(3):14–21, July 2004. http://www.ub.utwente.nl/webdocs/ctit/1/000000f3.pdf.

    Google Scholar 

  9. B. Waters, D. Balfanz, G. Durfee, and D. K. Smetters. Building an encrypted and searchable audit log. In Network and Distributed Security Symposium (NDSS)’ 04, San Diego, California, 2004.

    Google Scholar 

  10. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Proceedings of Eurocrypt, pages 506–522, 2004. http://crypto.stanford.edu/~dabo/abstracts/encsearch.html.

    Google Scholar 

  11. R. Brinkman, J. M. Doumen, P. H. Hartel, and W. Jonker. Using secret sharing for searching in encrypted data. In W. Jonker and M. Petković, editors, Secure Data Management VLDB 2004 workshop, volume LNCS 3178, pages 18–27, Toronto, Canada, August 2004. Springer-Verlag, Berlin. http://www.ub.utwente.nl/webdocs/ctit/1/00000106.pdf.

    Google Scholar 

  12. R. Brinkman, B. Schoenmakers, J. M. Doumen, and W. Jonker. Experiments with queries over encrypted data using secret sharing. In W. Jonker and M. Petković, editors, Secure Data Management VLDB 2005 workshop, volume LNCS 3674, pages 33–46, Trondheim, Norway, Sep 2005. Springer-Verlag, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brinkman, R. (2007). Different Search Strategies on Encrypted Data Compared. In: Petković, M., Jonker, W. (eds) Security, Privacy, and Trust in Modern Data Management. Data-Centric Systems and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69861-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69861-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69860-9

  • Online ISBN: 978-3-540-69861-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics