Statistical zero-knowledge arguments for NP from any one-way function

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 3-14

  Nguyen, Minh Huyen ^a   Ong, Shien Jin ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE ACQUISITION; PROBABILITY; STATISTICAL METHODS; VERIFICATION;

BINDING COMMITMENTS; COMPUTATIONALLY UNBOUNDED VERIFIER; ONE-WAY FUNCTIONS; ZERO-KNOWLEDGE ARGUMENTS;

COMPUTATIONAL COMPLEXITY;

EID: 38149096534     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.71     Document Type: Conference Paper

References (40)

1. W. Aiello and J. Håstad. Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds. J. Comput. Syst. Sci., 42(3):327-345, 1991.
2. B. Barak, Y. Lindell, and S. Vadhan. Lower Bounds for Non-Black-Box Zero Knowledge. Technical Report TR04-083, ECCC, 2004. Extended abstract in FOCS '04.
3. M. Bellare. A note on negligible functions. J. Cryptology, 15(4):271-284, 2002.
4. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM J. Comput., 17(2):210-229, 1988. Special issue on cryptography.
5. R. B. Boppana, J. Håstad, and S. Zachos. Does co-NP Have Short Interactive Proofs? Info. Proc. Lett., 25(2):127-132, 1987.
6. J. Boyar, S. A. Kurtz, and M. W. Krentel. A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. J. Cryptology, 2(2):63-76, 1990.
7. G. Brassard, D. Chaum, and C. Crépeau. Minimum Disclosure Proofs of Knowledge. J. Comput. Syst. Sci., 37(2):156-189, 1988.
8. G. Brassard, C. Crépeau, and M. Yung. Constant-round perfect zero-knowledge computationally convincing protocols. Theor. Comput. Sci., 84(1):23-52, 1991.
9. I. Damgård. Collision Free Hash Functions and Public Key Signature Schemes. In Proc. EURO-CRYPT, pages 203-216, 1987.
10. I. B. Damgård, T. P. Pedersen, and B. Pfitzmann. Statistical secrecy and multibit commitments. IEEE Trans. Info. Theory, 44(3):1143-1151, 1998.
11. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Trans. Info. Theory, 22(6):644-654, 1976.
12. I. Dinur. The PCP Theorem via Gap Amplification. In Proc. 38th STOC, 2006.
13. L. Fortnow. The Complexity of Perfect Zero-Knowledge. Advances in Computing Research: Randomness and Computation, 5:327-343, 1989.
14. O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. J. Cryptology, 6(1):21-53, 1993.
15. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
16. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. J. ACM, 33(4):792-807, 1986.
17. O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology, 9(3):167-190, 1996.
18. O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing But Their Validity or AU Languages in NP Have Zero-Knowledge Proof Systems. J. ACM, 38(1):691-729, 1991.
19. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., 18(1):186-208, 1989.
20. S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., 17(2):281-308, 1988.
21. I. Haitner, O. Horvitz, J. Katz, C.-Y. Koo, R. Morselli, and R. Shaltiel. Reducing Complexity Assumptions for Statistically-Hiding Commitment. In Proc. EUROCRYPT, pages 58-77, 2005.
22. 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.
23. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random Generation from one-way functions. In Proc. 21st STOC, pages 12-24, 1989.
24. R. Impagliazzo and M. Luby. One-way Functions are Essential for Complexity Based Cryptography. In Proc. 30th FOCS, pages 230-235, 1989.
25. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Proc. 21st STOC, pages 44-61, 1989.
26. J. Kahn, M. Saks, and C. Smyth. A dual version of Reimer's inequality and a proof of Rudich's conjecture. In 15th Annual IEEE Conference on Computational Complexity, pages 98-103, 2000.
27. M. Naor. Bit Commitment Using Pseudorandomness. J. Cryptology, 4(2):151-158, 1991.
28. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptology, 11(2):87-108, 1998. Preliminary version in CRYPTO '92.
29. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. In Proc. 21st STOC, pages 33-43, 1989.
30. M. Nguyen, S. J. Ong, and S. Vadhan. Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. Technical Report TR06-075, ECCC, 2006.
31. M. Nguyen and S. Vadhan. Zero Knowledge with Efficient Provers. In Proc. 38th STOC, 2006.
32. R. Ostrovsky. One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. In Proceedings of the 6th Annual Structure in Complexity Theory Conference, pages 133-138, 1991.
33. R. Ostrovsky, R. Venkatesan, and M. Yung. Fair Games Against an All-Powerful Adversary. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 155-169, 1993.
34. R. Ostrovsky and A. Wigderson. One-Way Functions are Essential for Non-Trivial Zero-Knowledge. In Proceedings of the 2nd Israel Symposium on Theory of Computing Systems, pages 3-17, 1993.
35. O. Reingold. Undirected ST-connectivity in log-space. In Proc. 37th STOC, pages 376-385, 2005.
36. J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. In Proc. 22nd STOC, pages 387-394, 1990.
37. S. Rudich. Limits on the Provable Consequences of One-Way Functions. PhD thesis, U.C. Berkeley, 1988.
38. C. Shannon. Communication Theory of Secrecy Systems. Bell System Technical Journal, 28(4):656-715, 1949.
39. D. Simon. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In Proc. EUROCRYPT, pages 334-345, 1998.
40. S. Vadhan. A Study of Statistical Zero-Knowledge Proofs. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, August 1999.