Referenced Items are not available for this document.
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.
Published in:
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
Date of Conference: 8-11 Oct. 2001
- Page(s):
- 126 - 135
- Print ISBN:
- 0-7695-1116-3
- INSPEC Accession Number:
- 7121387
- Digital Object Identifier :
- 10.1109/SFCS.2001.959887
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
