On the impossibility of basing trapdoor functions on trapdoor predicates

• Published in: Annual Symposium on Foundations of Computer Science pp. 126 - 135
• Main Authors: Gertner, Y., Malkin, T., Reingold, O.
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 2001
• Subjects: Computer science; Polynomials; Public key; Public key cryptography

We prove that, somewhat surprisingly, there is no black-box reduction of (poly-to-one) trapdoor functions to trapdoor predicates (equivalently, to public-key encryption schemes). Our proof follows the methodology that was introduced by R. Impagliazzo and S. Rudich (1989), although we use a new, weak...