Public-key Encryption with Registered Keyword Search

Share/Save/Bookmark

Tang, Q. and Chen, Liqun (2009) Public-key Encryption with Registered Keyword Search. In: Sixth European Workshop on Public Key Services, Applications and Infrastructures, 10-11 September, 2009, Pisa, Italy. (In Press)

[img] PDF
Restricted to UT campus only
: Request a copy
176kB
Abstract: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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67563
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page