International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: 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
Download:
URL: http://eprint.iacr.org/2005/254
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12588,
  title={Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / Foundations, Random-Oracle Model, Anonymity, Identity-Based Encryption},
  url={http://eprint.iacr.org/2005/254},
  note={A preliminary version appears in Crypto 2005. This is the full version. Michel.Abdalla@ens.fr 13003 received 8 Aug 2005},
  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},
  year=2005
}