Searchable encryption revisited : consistency properties, relation to anonymous IBE, and extensions

M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, Tadayoshi Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-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 (Proceedings 25th Annual International Cryptology Conference, Santa Barbara CA, USA, August 14-18, 2005)
    EditorsV. Shoup
    Place of PublicationBerlin
    ISBN (Print)978-3-540-28114-6
    Publication statusPublished - 2005

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    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