• DocumentCode
    1710441
  • Title

    On the impossibility of basing trapdoor functions on trapdoor predicates

  • Author

    Gertner, Yael ; Malkin, Tal ; Reingold, Omer

  • Author_Institution
    Pennsylvania Univ., Philadelphia, PA, USA
  • fYear
    2001
  • Firstpage
    126
  • Lastpage
    135
  • Abstract
    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.
  • Keywords
    computational complexity; cryptography; theorem proving; black-box reduction; poly-to-one trapdoor functions; proof; public-key encryption schemes; trapdoor predicates; weaker separation model; Computer science; Polynomials; Public key; Public key cryptography;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
  • Print_ISBN
    0-7695-1116-3
  • Type

    conf

  • DOI
    10.1109/SFCS.2001.959887
  • Filename
    959887
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1710441