Journal of Cryptology

, Volume 21, Issue 3, pp 350–391

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Authors

    • Departement d’InformatiqueÉcole Normale Supérieure & CNRS
  • Mihir Bellare
    • Department of Computer Science & EngineeringUniversity of California San Diego
  • Dario Catalano
    • Dipartimento di Matematica e InformaticaUniversità di Catania
  • Eike Kiltz
    • CWI Amsterdam
  • Tadayoshi Kohno
    • Department of Computer Science and EngineeringUniversity of Washington
  • Tanja Lange
    • Department of Mathematics and Computer ScienceEindhoven University of Technology
  • John Malone-Lee
    • EMB Consultancy LLP
  • Gregory Neven
    • Department of Electrical EngineeringKatholieke Universiteit Leuven
  • Pascal Paillier
    • Cryptography & InnovationSecurity Labs, Gemalto
  • Haixia Shi
    • NVIDIA Corporation
Article

DOI: 10.1007/s00145-007-9006-6

Cite this article as:
Abdalla, M., Bellare, M., Catalano, D. et al. J Cryptol (2008) 21: 350. doi:10.1007/s00145-007-9006-6

Abstract

We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of Boneh et al. (Advances in Cryptology—EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, pp. 506–522, 2004) is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous identity-based encryption (IBE) scheme to a secure PEKS scheme that, unlike the previous one, guarantees consistency. Finally, we suggest three extensions of the basic notions considered here, namely anonymous hierarchical identity-based encryption, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.

Keywords

FoundationsRandom-oracle modelAnonymityIdentity-based encryptionSearchable encryption

Copyright information

© International Association for Cryptologic Research 2007