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, Haixia Shi

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    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.
    Original languageEnglish
    Title of host publicationAdvances in Cryptology - CRYPTO 2005 : 25th Annual International Cryptology Conference
    Publication date2005
    ISBN (Print)3-540-28114-2
    Publication statusPublished - 2005
    EventAdvances in Cryptology - Crypto 2005 - Santa Barbara
    Duration: 1 Jan 2005 → …


    ConferenceAdvances in Cryptology - Crypto 2005
    CitySanta Barbara
    Period01/01/2005 → …


    Dive into the research topics of 'Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions'. Together they form a unique fingerprint.

    Cite this