Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
3-2011
Abstract
In STOC’08, Peikert and Waters introduced a new powerful primitive called lossy trapdoor functions (LTDFs) and a richer abstraction called all-but-one trapdoor functions (ABO-TDFs). They also presented a black-box construction of CCA-secure PKE from an LTDF and an ABO-TDF. An important component of their construction is the use of a strongly unforgeable one-time signature scheme for CCA-security.In this paper, we introduce the notion of chameleon ABO-TDFs, which is a special kind of ABO-TDFs. We give a generic as well as a concrete construction of chameleon ABO-TDFs. Based on an LTDF and a chameleon ABO-TDF, we presented a black-box construction, free of one-time signature, of variant of the CCA secure PKE proposed by Peikert and Waters.
Keywords
Chosen Ciphertext Security, Lossy Trapdoor Functions, Chameleon All-But-One Trapdoor Functions
Discipline
Information Security
Research Areas
Cybersecurity
Publication
Public Key Cryptography - PKC 2011: 14th International Conference on Practice and Theory in Public Key Cryptography, Taormina, Italy, March 6-9, 201 Proceedings
Volume
6571
First Page
228
Last Page
245
ISBN
9783642193798
Identifier
10.1007/978-3-642-19379-8_14
Publisher
Springer Verlag
City or Country
Heidelberg
Citation
LAI, Junzuo; DENG, Robert H.; and LIU, Shengli.
Chameleon all-but-one TDFs and their application to chosen-ciphertext security. (2011). Public Key Cryptography - PKC 2011: 14th International Conference on Practice and Theory in Public Key Cryptography, Taormina, Italy, March 6-9, 201 Proceedings. 6571, 228-245.
Available at: https://ink.library.smu.edu.sg/sis_research/1415
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://dx.doi.org/10.1007/978-3-642-19379-8_14
Comments
Lecture Notes in Computer Science, 2011, Volume 6571/2011, 228-245