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:
  • Departement d'Informatique, École normale supérieure;Department of Computer Science & Engineering, University of California San Diego;Departement d'Informatique, École normale supérieure;Department of Computer Science & Engineering, University of California San Diego;Department of Computer Science & Engineering, University of California San Diego;Department of Mathematics, Technical University of Denmark;Department of Computer Science, University of Bristol;Department of Electrical Engineering, Katholieke Universiteit Leuven;Applied Research and Security Center, Gemplus Card International;Department of Computer Science & Engineering, University of California San Diego

  • Venue:
  • CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
  • Year:
  • 2005

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 [7] is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous 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 HIBE, public-key encryption with temporary keyword search, and identity-based encryption with keyword search.