Inaccessible entropy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 611-620

  Haitner, Iftach ^a   Vadhan, Salil ^b   Reingold, Omer ^c   Wee, Hoeteck ^d  

^a MICROSOFT RESEARCH   (United Kingdom)

^b HARVARD UNIVERSITY   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Commitment schemes; Computational complexity; Cryptography; Interactive hashing; One way functions; Zero knowledge

Indexed keywords

COMMITMENT SCHEMES; EFFICIENT CONSTRUCTION; INTERACTIVE HASHING; ONE-WAY FUNCTIONS; PARALLEL COMPOSITION; POLYNOMIAL-TIME; STATISTICALLY-HIDING COMMITMENT; ZERO KNOWLEDGE; ZERO KNOWLEDGE PROOF;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CRYPTOGRAPHY;

ENTROPY;

EID: 70350668805     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536497     Document Type: Conference Paper

References (29)

1. AIELLO, W., AND HÅSTAD, J. Statistical zero-knowledge languages can be recognized in two rounds. JCSS 42, 3 (1991), 327-345.
2. BARAK, B., SHALTIEL, R., AND WIGDERSON, A.Computational analogues of entropy. In RANDOM-APPROX (2003).
3. BLUM, M., AND MICALI, S. How to generate cryptographically strong sequences of pseudo random bits. pp. 112-117.
4. DING, Y. Z., HARNIK, D., ROSEN, A., AND SHALTIEL, R. Constant-round oblivious transfer in the bounded storage odel. In Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004 (2004), pp. 446-472.
5. FEIGE, U., AND SHAMIR, A. Witness indistinguishable and witness hiding protocols. In Proceedings of the 22nd Annual CM Symposium on Theory of Computing (STOC) (1990), ACM Press, pp. 416-426.
6. GOLDREICH, O. Concurrent zero-knowledge with timing, evisited. In STOC (2002), pp. 332-340.
7. GOLDREICH, O., AND KAHAN, A. How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology 9, 3 (1996), 167-190.
8. GOLDREICH, O., AND KRAWCZYK, H. On the composition f zero-knowledge proof systems. SIAM J. Comput. 25, 1 (1996), 169-192. Preliminary version in ICALP'90.
9. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38, 1 (1991), 691-729. Preliminary version in FOCS'86.
10. GOLDREICH, O., AND VADHAN, S. P. Comparing entropies in statistical zero knowledge with applications to the structure of szk. In IEEE Conference on Computational Complexity (1999), pp. 54-.
11. GOLDWASSER, S., AND MICALI, S. Probabilistic encryption. Journal of Computer and System Sciences 28, 2 (1984), 270-299.
12. HAITNER, I., HOCH, J. J., REINGOLD, O., AND SEGEV, G. Finding collisions in interactive protocols - A tight lower bound on the round complexity of statistically-hiding commitments. In Proceedings of the 47th Annual Symposium on Foundations of Computer Science (FOCS) (2007).
13. HAITNER, I., HORVITZ, O., KATZ, J., KOO, C., MORSELLI, R., AND SHALTIEL, R. Reducing complexity assumptions for statistically-hiding commitment. In Advances in Cryptology - EUROCRYPT 2005(2005).
14. HAITNER, I., NGUYEN, M., ONG, S. J., REINGOLD, O., AND VADHAN, S. Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM Journal on Computing (2009). To appear. Preliminary versions in FOCS '06 and STOC '07.
15. HAITNER, I., AND REINGOLD, O. A new interactive hashing theorem. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity (2007). Full version on authors' homepage.
16. HÅSTAD, J., IMPAGLIAZZO, R., LEVIN, L. A., AND LUBY, M. A pseudorandom generator from any one-way function. SIAM Journal on Computing 28, 4 (1999), 1364-1396. Preliminary versions in STOC'89 and STOC'90.
17. KATZ, J. Which languages have 4-round zero-knowledge proofs? In Theory of Cryptography, 5th Theory of Cryptography Conference, TCC 2008 (2008), pp. 73-88.
18. NAOR, M. Bit commitment using pseudorandomness. Journal of Cryptology 4, 2 (1991), 151-158. Preliminary version in CRYPTO'89.
19. NAOR, M., OSTROVSKY, R., VENKATESAN, R., ANDYUNG, M. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology 11, 2(1998), 87-108. Preliminary version in CRYPTO'92.
20. NAOR, M., AND YUNG, M. Universal one-way hash functions and their cryptographic applications. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC) (1989), ACM Press, pp. 33-43.
21. NGUYEN, M., AND VADHAN, S. Zero knowledge with efficient provers. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC) (2006), ACM Press, pp. 287-295.
22. NISAN, N., AND ZUCKERMAN, D. Randomness is linear in space. Journal of Computer and System Sciences 52, 1 1996), 43-52.
23. ONG, S. J., AND VADHAN, S. An equivalence between zero knowledge and commitments. In Theory of Cryptography, 5th Theory of Cryptography Conference, TCC 2008 (2008), p. 482-500.
24. OSTROVSKY, R., AND WIGDERSON, A. One-way functions are essential for non-trivial zero-knowledge. In Proceedings of the 2nd Israel Symposium on Theory of Computing Systems(1993), IEEE Computer Society, pp. 3-17.
25. PETRANK, E., AND TARDOS, G. On the knowledge complexity of np. In FOCS (1996), pp. 494-503.
26. RENNER, R., AND WOLF, S. Smooth Renyi entropy and applications. In IEEE International Symposium on Information Theory - ISIT 2004 (June 2004), IEEE, p. 233.
27. ROMPEL, J. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC) (1990), pp. 387-394.
28. SHANNON, C. Communication theory of secrecy systems. Bell System Technical Journal 28, 4 (1949), 656-715.
29. YAO, A. C. Theory and applications of trapdoor functions. In FOCS (1982) pp. 80-91.