Lower bounds on the efficiency of encryption and digital signature schemes

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 417-425

  Gennaro, Rosario ^a   Gertner, Yael ^b   Katz, Jonathan ^c  

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

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Institute of Advanced Computer Science   (United States)

Author keywords

Black Box; Digital Signatures; Encryption; Lower Bounds

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBABILITY;

LOWER BOUNDS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0037770046     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780604     Document Type: Conference Paper

References (25)

1. M. Bellare and P. Rogaway. Collision-resistant hashing: toward making UOWHFs practical. Crypto '97.
2. M. Blum and S. Goldwasser. An efficient probabilistic encryption scheme which hides all partial information. Crypto '84.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comp., 13(4): 850-864 (1984).
4. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6): 644-654 (1976).
5. C. Dwork. The non-malleability lectures. Available from the author.
6. M. Fischlin. On the impossibility of constructing non-interactive statistically-secret protocols from any trapdoor one-way function. CT-RSA 2002.
7. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4): 469-472 (1985).
8. R. Gennaro and L. Trevisan. Lower bounds on the efficiency of generic cryptographic constructions. FOCS 2000.
9. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan. The relationship between public-key encryption and oblivious transfer. FOCS 2000.
10. Y. Gertner, T. Malkin, and O. Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. FOCS 2001.
11. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. STOC '89.
12. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comp. System Sciences, 28(2): 270-299 (1984).
13. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen message attacks. SIAM J. Comp., 17(2): 281-308 (1988).
14. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. FOCS '89.
15. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. STOC '89.
16. J. Kahn, M. Saks, and C. Smyth. A dual version of Reimer's inequality and a proof of Rudich's conjecture. Computational Complexity 2000.
17. J. H. Kim, D. Simon, and P. Tetali. Limits on the efficiency of one-way permutation-based hash functions. FOCS '99.
18. L. Lamport. Constructing digital signatures from a one-way function. Technical Report CSL-98, SRI International, 1979.
19. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. STOC '89.
20. J. Rompel. One-way functions are necessary and sufficient for digital signatures. STOC '90.
21. S. Rudich. Limits on the provable consequences of one-way functions. PhD thesis, University of California at Berkeley, 1988.
22. S. Rudich. The use of interaction in public cryptosystems. Crypto '91.
23. V. Shoup. A composition theorem for universal one-way hash functions. Eurocrypt 2000.
24. D. Simon. Finding collisions on a one-way street: can secure hash functions be based on general assumptions? Eurocrypt '98.
25. A. C. Yao. Theory and applications of trapdoor functions. FOCS '82.