Public-key Encryption with Registered Keyword Search

Qiang Tang, Liqun Chen

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

50 Citations (Scopus)

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.
Original languageUndefined
Title of host publicationSixth European Workshop on Public Key Services, Applications and Infrastructures
Place of PublicationLondon
PublisherSpringer
Pages163-178
Number of pages21
ISBN (Print)3-642-16440-4
DOIs
Publication statusPublished - Sep 2009

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
Volume6391

Keywords

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

Cite this

Tang, Q., & Chen, L. (2009). Public-key Encryption with Registered Keyword Search. In Sixth European Workshop on Public Key Services, Applications and Infrastructures (pp. 163-178). (Lecture Notes in Computer Science; Vol. 6391). London: Springer. https://doi.org/10.1007/978-3-642-16441-5_11
Tang, Qiang ; Chen, Liqun. / Public-key Encryption with Registered Keyword Search. Sixth European Workshop on Public Key Services, Applications and Infrastructures. London : Springer, 2009. pp. 163-178 (Lecture Notes in Computer Science).
@inproceedings{3d782c361c9549098aee9d83efcc1505,
title = "Public-key Encryption with Registered Keyword Search",
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.",
keywords = "METIS-263965, IR-67563, Privacy, SCS-Cybersecurity, PERKS, PEKS, EWI-15836, offline password guessing attack",
author = "Qiang Tang and Liqun Chen",
year = "2009",
month = "9",
doi = "10.1007/978-3-642-16441-5_11",
language = "Undefined",
isbn = "3-642-16440-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "163--178",
booktitle = "Sixth European Workshop on Public Key Services, Applications and Infrastructures",

}

Tang, Q & Chen, L 2009, Public-key Encryption with Registered Keyword Search. in Sixth European Workshop on Public Key Services, Applications and Infrastructures. Lecture Notes in Computer Science, vol. 6391, Springer, London, pp. 163-178. https://doi.org/10.1007/978-3-642-16441-5_11

Public-key Encryption with Registered Keyword Search. / Tang, Qiang; Chen, Liqun.

Sixth European Workshop on Public Key Services, Applications and Infrastructures. London : Springer, 2009. p. 163-178 (Lecture Notes in Computer Science; Vol. 6391).

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

TY - GEN

T1 - Public-key Encryption with Registered Keyword Search

AU - Tang, Qiang

AU - Chen, Liqun

PY - 2009/9

Y1 - 2009/9

N2 - 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.

AB - 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.

KW - METIS-263965

KW - IR-67563

KW - Privacy

KW - SCS-Cybersecurity

KW - PERKS

KW - PEKS

KW - EWI-15836

KW - offline password guessing attack

U2 - 10.1007/978-3-642-16441-5_11

DO - 10.1007/978-3-642-16441-5_11

M3 - Conference contribution

SN - 3-642-16440-4

T3 - Lecture Notes in Computer Science

SP - 163

EP - 178

BT - Sixth European Workshop on Public Key Services, Applications and Infrastructures

PB - Springer

CY - London

ER -

Tang Q, Chen L. Public-key Encryption with Registered Keyword Search. In Sixth European Workshop on Public Key Services, Applications and Infrastructures. London: Springer. 2009. p. 163-178. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-16441-5_11