Cryptology ePrint Archive: Report 2005/254
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
Michel Abdalla and Mihir Bellare and Dario Catalano and Eike Kiltz and Tadayoshi Kohno and Tanja Lange and John Malone-Lee and Gregory Neven and Pascal Paillier and Haixia Shi
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. in Eurocrypt 2004 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.
Category / Keywords: cryptographic protocols / Foundations, Random-Oracle Model, Anonymity, Identity-Based Encryption
Publication Info: A preliminary version appears in Crypto 2005. This is the full version.
Date: received 8 Aug 2005
Contact author: Michel Abdalla at ens fr
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20050808:213129 (All versions of this report)
Short URL: ia.cr/2005/254
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]