Lower bounds on the efficiency of generic cryptographic constructions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 305-313

  Gennaro, Rosario ^a   Trevisan, Luca ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA STRUCTURES; RANDOM NUMBER GENERATION; STATISTICAL METHODS; THEOREM PROVING;

PSEUDO-RANDOM GENERATORS (PRG); UNIVERSAL ONE-WAY HASH FUNCTIONS;

COMPUTER SCIENCE;

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

References (21)

1. M. Blum S. Micali How to generate cryptographically strong sequences of pseudorandom bits SIAM Journal on Computing 13 4 850 864 1984
2. R. Cramer V. Shoup A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack Proceedings of CRYPTO '98 1462 13 25 Proceedings of CRYPTO '98 1998
3. W. Diffie M. Hellman New directions in cryptography IEEE Transactions on Information Theory IT-22 6 1978
4. O. Goldreich S. Goldwasser S. Micali How to construct random functions Journal of the ACM 33 4 792 807 1986
5. O. Goldreich L. Levin A hard-core predicate for all one-way functions Proceedings of the 21st ACM Symposium on Theory of Computing 25 32 Proceedings of the 21st ACM Symposium on Theory of Computing 1989
6. O. Goldreich S. Micali A. Wigderson Proofs that yield nothing but their validity Journal of the ACM 38 3 1991
7. J. Hastad R. Impagliazzo L. Levin M. Luby A pseudorandom generator from any one-way function SIAM Journal on Computing 28 4 1364 1396 1999
8. J. Håstad A. Schrift A. Shamir The discrete logarithm modulo a composite hides O(n) bits Journal of Computer and System Sciences 47 376 404 1993
9. R. Impagliazzo S. Rudich Limits on the provable consequences of one-way permutations Proceedings of the 21st ACM Symposium on Theory of Computing 44 61 Proceedings of the 21st ACM Symposium on Theory of Computing 1989
10. J. Kahn M. Saks C. Smyth A dual version of Reimer's inequality and a proof of rudich's conjecture Proceedings of the 15th IEEE Conference on Computational Complexity Proceedings of the 15th IEEE Conference on Computational Complexity 2000
11. J.H. Kim D.R. Simon P. Tetali Limits on the efficiency of one-way permutations-based hash functions Proceedings of the 40th IEEE Symposium on Foundations of Computer Science 535 542 Proceedings of the 40th IEEE Symposium on Foundations of Computer Science 1999
12. M. Naor Bit commitment using pseudorandomness Journal of Cryptology 4 2 151 158 1991
13. M. Naor M. Yung Universal hash functions and their cryptographic applications Proceedings of the 21st ACM Symposium on Theory of Computing Proceedings of the 21st ACM Symposium on Theory of Computing 1989
14. J. Rompel One-way functions are necessary and sufficient for digital signatures Proceedings of the 22nd ACM Symposium on Theory of Computing Proceedings of the 22nd ACM Symposium on Theory of Computing 1990
15. S. Rudich Limits on the provable consequences of one-way functions 1988 University of California Berkeley
16. S. Rudich The use of interaction in public cryptosystems Proceedings of CRYPTO'91 242 251 Proceedings of CRYPTO'91 1991
17. D. Simon Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? Proceedings of EUROCRYPT'98 Proceedings of EUROCRYPT'98 1998
18. A.C. Yao Theory and applications of trapdoor functions Proceedings of the 23th IEEE Symposium on Foundations of Computer Science 80 91 Proceedings of the 23th IEEE Symposium on Foundations of Computer Science 1982