Paper 2005/254
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. A preliminary version appears in Crypto 2005. This is the full version.
- Keywords
- FoundationsRandom-Oracle ModelAnonymityIdentity-Based Encryption
- Contact author(s)
- Michel Abdalla @ ens fr
- History
- 2005-08-08: received
- Short URL
- https://ia.cr/2005/254
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/254,
author = {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},
title = {Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous {IBE}, and Extensions},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/254},
year = {2005},
url = {https://eprint.iacr.org/2005/254}
}
