On the impossibility of basing trapdoor functions on trapdoor predicates

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 126-135

  Gertner, Yael ^a   Malkin, Tal ^b   Reingold, Omer ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; QUERY LANGUAGES; RANDOM PROCESSES; SET THEORY;

TRAPDOOR FUNCTIONS;

CRYPTOGRAPHY;

EID: 0035172306     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959887     Document Type: Article

References (23)

1. Generating hard instances of lattice problems
2. A public-key cryptosystem with worst-case/average-case equivalence
3. Many-to-one trapdoor functions and their relations to public-key cryptosystems
4. Relativized cryptography
5. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
6. Improved non-commiting encryption schemes based on a general complexity assumption
7. Lower bounds on the efficiency of generic cryptographic constructions
8. The relationship between public key encryption and oblivious transfer
9. On the limits of non-approximability of lattice problems
10. On the possibility of basing cryptography on the assumption that p ≠ np
11. Public-key cryptosystems from lattice reduction problems
12. A hard predicate for all one-way functions
13. Proofs that yield nothing but their validity or all languages in np have zero-knowledge proofs
14. New directions in cryptography: Twenty some years later
15. Probabilistic encryption
16. Limits on the provable consequences of one-way permutations
17. Limits on the efficiency of one-way permuation-based hash functions
18. The use of interaction in public cryptosysytems
19. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions
20. Theory and applications of trapdoor functions