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

  • Authors:
  • Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz;Tadayoshi Kohno;Tanja Lange;John Malone-Lee;Gregory Neven;Pascal Paillier;Haixia Shi

  • Affiliations:
  • École Normale Supérieure & CNRS, Departement d’’Informatique, 45 Rue d’Ulm, 75230, Paris Cedex 05, France;University of California San Diego, Department of Computer Science & Engineering, 9500 Gilman Drive, 92093, La Jolla, CA, USA;Università di Catania, Dipartimento di Matematica e Informatica, Viale Andrea Doria 6, 95125, Catania, CA, Italy;CWI Amsterdam, P.O. Box 94079, Viale Andrea Doria 6, 1090, Amsterdam, GB, The Netherlands;University of Washington, Department of Computer Science and Engineering, P.O. Box 352350, Viale Andrea Doria 6, 98195-2350, Seattle, WA, USA;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, Viale Andrea Doria 6, 5600, Eindhoven, MB, The Netherlands;EMB Consultancy LLP, P.O. Box 513, Viale Andrea Doria 6, 5600, Bristol, MB, UK;Katholieke Universiteit Leuven, Department of Electrical Engineering, P.O. Box 513, Kasteelpark Arenberg 10, 3001, Heverlee-Leuven, MB, Belgium;Security Labs, Gemalto, Cryptography & Innovation, P.O. Box 513, 6, Rue de la Verrerie, 92197, Meudon Cedex, MB, France;NVIDIA Corporation, P.O. Box 513, 2701 San Tomas Expressway, 95050, Santa Clara, CA, USA

  • Venue:
  • Journal of Cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.