Skip to main content
Springer Nature Link
Log in

Asymmetric Setting for Searchable Encryption

  • Living reference work entry
  • First Online:
Encyclopedia of Cryptography, Security and Privacy

  • 119 Accesses

Synonyms

Public-key searchable encryption models

Definitions

Searchable encryption schemes refer to encryption schemes that allow the possibility of executing keyword search over encrypted data, without decrypting the data.

Asymmetric setting for searchable encryption refers to the operational model or family of models under which public-key encryption schemes of this class are defined.

Background

Searchable encryption schemes have been introduced in order to protect data that is stored over untrusted servers. One key issue in these contexts is the possibility of searching encrypted data without the need of decrypting it. Original encrypted data is associated with additional encrypted information that is used to evaluate predicates without releasing any information on the original data.

Searchable encryption schemes exist both in the symmetric and the asymmetric settings.

Theory

Asymmetric searchable encryption schemes have been introduced by Boneh et al. (2004).

Like asymmetric...

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Boneh D, Waters B (2007) Conjunctive, subset, and range queries on encrypted data. In: Vadhan SP (ed) Theory of cryptography. Springer, Berlin/Heidelberg, pp 535–554

    Chapter  Google Scholar 

  • Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: Cachin C, Camenisch J (eds) EUROCRYPT 2004. LNCS, vol 3027, pp 506–522. Springer. https://doi.org/10.1007/978-3-540-24676-3_30

    Chapter  Google Scholar 

  • Park DJ, Kim K, Lee PJ (2005) Public key encryption with conjunctive field keyword search. In: Lim CH, Yung M (eds) Information security applications (WISA 2004). Springer, Berlin/Heidelberg, pp 73–86

    Chapter  Google Scholar 

  • Shi E, Bethencourt J, Chan HT, Song DX, Perrig A (2007) Multi-dimensional range query over encrypted data. In: 2007 IEEE symposium on security and privacy (S&P 2007), 20–23 May 2007, Oakland. IEEE Computer Society, pp 350–364. https://doi.org/10.1109/SP.2007.29

Download references

Author information

Authors and Affiliations

  1. Department of Political and Social Studies, University of Salerno, Fisciano (SA), Italy

    Clemente Galdi

Authors
  1. Clemente Galdi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Clemente Galdi .

Editor information

Editors and Affiliations

  1. Center for Secure Information Systems, George Mason University, Fairfax, VA, VA, USA

    Sushil Jajodia

  2. University of Milan, Milan, Italy

    Pierangela Samarati

  3. Google Inc, New York, NY, USA

    Moti Yung

Section Editor information

  1. Dipartimento di Scienze Aziendali - Management & Innovation Systems, Università degli Studi di Salerno, Fisciano (Salerno), Italy

    Carlo Blundo

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Science+Business Media LLC

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Galdi, C. (2021). Asymmetric Setting for Searchable Encryption. In: Jajodia, S., Samarati, P., Yung, M. (eds) Encyclopedia of Cryptography, Security and Privacy. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27739-9_1482-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27739-9_1482-1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27739-9

  • Online ISBN: 978-3-642-27739-9

  • eBook Packages: Living Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics