Public Key Cryptography – PKC 2011

Volume 6571 of the series Lecture Notes in Computer Science pp 228-245

Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security

  • Junzuo LaiAffiliated withSchool of Information Systems, Singapore Management University
  • , Robert H. DengAffiliated withSchool of Information Systems, Singapore Management University
  • , Shengli LiuAffiliated withDepartment of Computer Science and Engineering, Shanghai Jiao Tong University


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.


Chosen Ciphertext Security Lossy Trapdoor Functions Chameleon All-But-One Trapdoor Functions