Reducing complexity assumptions for statistically-hiding commitment

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 58-77

  Haitner, Iftach ^a   Horvitz, Omer ^b   Katz, Jonathan ^b   Koo, Chiu Yuen ^b   Morselli, Ruggero ^b   Shaltiel, Ronen ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b University of Maryland ^*  (United States)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROGRAM COMPILERS; STATISTICAL METHODS;

COMPLEXITY ASSUMPTIONS; ONE-WAY FUNCTIONS; OUTPUT DISTRIBUTION; STATISTICALLY-HIDING COMMITMENT;

CRYPTOGRAPHY;

EID: 24944462872     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_4     Document Type: Conference Paper

References (32)

1. M. Bellare and S. Micali. How to sign given any trapdoor permutation. J. ACM, 39(1):214-233, 1992.
2. M. Blum. Coin nipping by phone. In IEEE COMPCOM, 1982.
3. M. Blum and S. Micali. How to generate cryptographically-strong sequences of pseudorandom bits. SIAM J. Computing, 13(4):850-864, 1984.
4. M. Blum, A. De Santis, S. Micali, and G. Persiano. Non-interactive zero-knowledge. SIAM J. Computing, 20(6):1084-1118, 1991.
5. J.F. Boyar, S.A. Kurtz, and M.W. Krentel. Discrete logarithm implementation of perfect zero-knowledge blobs. Journal of Cryptology, 2(2):63-76, 1990.
6. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. J. Computer and System Sciences, 37(2): 156-189, 1988.
7. J.L. Carter and M.N. Wegman. Universal classes of hash functions. J. Computer and System Sciences, 18(2):143-154, 1979.
8. I. Damgård, T. Pedersen, and B. Pfitzmann. On the existence of statistically-hiding bit commitment and fail-stop signatures. In Crypto, 1993.
9. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero-knowledge proofs under general assumptions. SIAM J. Computing, 29(1):1-28, 1999.
10. O. Goldreich. Foundations of Cryptography, vol. 1: Basic Tools. Cambridge University Press, 2001.
11. O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, 2004.
12. O. Goldreich, S. Goldwasser, and S. Micali. On the cryptographic applications of random functions. In Crypto '84.
13. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4):792-807, 1986.
14. O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman. Security preserving amplification of hardness. In FOCS, 1990.
15. O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology, 9(3):167-190, 1996.
16. O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM J. Computing, 22(6):1163-1175, 1993.
17. O. Goldreich and L.A. Levin. Hard-core predicates for any one-way function. In STOC, 1989.
18. S. Goldwasser, S. Micali, and R.L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Computing, 17(2):281-308, 1988.
19. S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In Crypto, 1996.
20. J. Håstad, R. Impagliazzo, L.A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
21. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. In FOCS, 1989.
22. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In STOC, 1989.
23. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology, 16(3): 143-184, 2003.
24. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
25. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. J. Crypto., 11(2):87-108, 1998.
26. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic application. In STOC, 1989.
27. R. Ostrovsky, R. Venkatesan, and M. Yung. Secure commitment against a powerful adversary. In STACS, 1992.
28. R. Ostrovsky, R. Venkatesan, and M. Yung. Fair games against an all-powerful adversary. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 13, 1993.
29. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In STOC, 1990.
30. A. Russel. Necessary and sufficient conditions for collision-free hashing. J. Cryptology, 8(2):87-100, 1995.
31. A. De Santis and M. Yung. On the design of provably-secure cryptographic hash functions. In Eurocrypt, 1990.
32. J.P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223-250, 1995.