On the impossibility of basing trapdoor functions on trapdoor predicates

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

Full description

Saved in:
Bibliographic Details
Published inAnnual Symposium on Foundations of Computer Science pp. 126 - 135
Main Authors Gertner, Y., Malkin, T., Reingold, O.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 2001
Subjects
Computer science
Polynomials
Public key
Public key cryptography
Online AccessGet full text

Cover

More Information
Summary: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, weaker model of separation.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISBN:0769513905
9780769513904
ISSN:1552-5244
0272-5428
2168-9253
DOI:10.1109/SFCS.2001.959887