Bounds on the efficiency of "black-box" commitment schemes

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 128-139

  Horvitz, Omer ^a   Katz, Jonathan ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; SECURITY OF DATA; STATISTICAL METHODS;

CRYPTOGRAPHIC PRIMITIVES; PERMUTATIONS; SECURITY NOTION;

CRYPTOGRAPHY;

EID: 26444463784     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_11     Document Type: Conference Paper

References (20)

1. M. Blum. Coin Flipping by Phone. In 24th IEEE Computer Conference (CompCon), pp. 133-137, 1983.
2. (See also SIGACT News, vol. 15(1), 1983.)
3. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. In SIAM J. Computing, vol. 13(4), pp. 850-864, 1984.
4. J. Carter and M. Wegman. Universal Classes of Hash Functions. In Journal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
5. R. Gennaro, Y. Gertner, J. Katz, and L. Trevisan. Bounds on the Efficiency of Generic Cryptographic Constructions. SIAM J. Computing, to appear.
6. O. Goldreich. Foundations of Cryptography, vol. 1: Basic Tools. Cambridge University Press, 2001.
7. O. Goldreich, S. Goldwasser, and S. Micali. On the Cryptographic Applications of Random Functions. In Advances in Cryptology - CRYPTO 84, LNCS vol. 263, Springer-Verlag, pp. 276-288, 1985.
8. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. In J. ACM, vol. 33(4), pp. 792-807, 1986.
9. O. Goldreich and L. Levin. Hard-Core Predicates for any One-Way Function. In 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 25-32, 1989.
10. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A Pseudorandom Generator From any One-Way Function. In SIAM J. Computing, vol. 28(4), pp. 1364-1396, 1999.
11. R. Impagliazzo and S. Luby. One-Way Functions are Essential for Complexity-Based Cryptography. In 30th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 230-235, 1989.
12. R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-Way Permutations. In 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 44-61, 1989.
13. J.H. Kim, D.R. Simon, and P. Tetali. Limits on the Efficiency of One-Way Permutation-Based Hash Functions. In 40th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 535-542, 1999.
14. M. Naor. Bit Commitment Using Pseudorandomness. In J. Cryptology, vol. 4(2), pp. 151-158, 1991.
15. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 33-43, 1989.
16. S. Rudich. Limits on the Provable Consequences of One-Way Functions. Ph.D. thesis, University of California at Berkeley, 1988.
17. J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. In 22nd ACM Symposium on Theory of Computing (STOC), ACM, pp. 387-394, 1990.
18. O. Reingold, L. Trevisan, and S. Vadhan. Notions of Reducibility Between Cryptographic Primitives. In 1st Theory of Cryptography Conference, LNCS vol. 2951, Springer-Verlag, pp. 1-20, 2004.
19. A.C.-C. Yao. Theory and Application of Trapdoor Functions. In 23rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 80-91, 1982.
20. A.C.-C. Yao. How to Generate and Exchange secrets. In 27th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 162-167, 1986.