Public-key Encryption with Registered Keyword Search

Qiang Tang, Liqun Chen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    59 Citations (Scopus)


    Public-key Encryption with Keyword Search (PEKS) enables a server to test whether a tag from a sender and a trapdoor from a receiver contain the same keyword. In this paper, we highlight some potential security concern, i.e. a curious server is able to answer whether any selected keyword is corresponding to a given trapdoor or not (called an offline keyword guessing attack). The existing semantic security definition for PEKS does not capture this vulnerability. We propose a new concept, namely Public-key Encryption with Registered Keyword Search (PERKS), which requires a sender to register a keyword with a receiver before the sender can generate a tag. Clearly the keyword preregistration is not a pleasing feature. The payback is that the semantic security definition for PERKS proposed in this paper is immune to the offline keyword guessing attack. We also propose a construction of PERKS and prove its security. The construction supports testing multiple tags in batch mode, which can significantly reduce the computational complexity in some situations.
    Original languageUndefined
    Title of host publicationSixth European Workshop on Public Key Services, Applications and Infrastructures
    Place of PublicationLondon
    Number of pages21
    ISBN (Print)3-642-16440-4
    Publication statusPublished - Sep 2009

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag


    • METIS-263965
    • IR-67563
    • Privacy
    • SCS-Cybersecurity
    • PERKS
    • PEKS
    • EWI-15836
    • offline password guessing attack

    Cite this