Local zero knowledge

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 306-315

  Micali, Silvio ^a   Pass, Rafael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cryptography; Zero Knowledge

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTER SCIENCE; CRYPTOGRAPHY; INFORMATION THEORY; STANDARDS;

CLASSICAL NOTION; SECRECY; ZERO KNOWLEDGE;

COMPUTATIONAL COMPLEXITY;

EID: 33748094243     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132561     Document Type: Conference Paper

References (35)

1. B. Barak. How to go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. B. Barak and O. Goldreich. Universal Arguments and their Applications. 17th CCC, pages 194-203, 2002.
3. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In 34th STOC, pages 484-493, 2002.
4. M. Blum. How to prove a Theorem So No One Else Can Claim It. Proc. of the International Congress of Mathematicians, Berkeley, California, USA, pages 1444-1451, 1986.
5. M. Blum, P. Feldman and S. Micali. Non-Interactive Zero-Knowledge and Its Applications. In 20th STOC, pages 103-112, 1988
6. M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Computing, 20(6):1084-1118, 1991.
7. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 34th STOC, pages 494-503, 2002.
8. D. Chaum and H. van Antwerpen. Undeniable Signatures. In Crypto89, Springer LNCS 435, pages. 212-216, 1989.
9. R. Cramer, I. Damgård and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Crypto94, Springer LNCS 839, pages. 174-187, 1994.
10. Y. Dodis and S. Micali, Parallel Reducibility for Information- Theoretically Secure Computation, In Crypto00, Springer LNCS 1880 74-92, 2000.
11. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
12. M. Fischer, S. Micali, and C. Rackoff. A Secure Protocol for the Oblivious Transfer. Journal of Cryptology, 9(3): 191-195, 1996.
13. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416-426, 1990.
14. U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In Crypto89, Springer LNCS 435, pages. 526-544, 1989.
15. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Crypto86, Springer LNCS 263, pages 181-187, 1987
16. O. Goldreich. Foundations of Cryptography - Basic Tools. Cambridge University Press, 2001.
17. O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Jour. of Cryptology, Vol. 9, No. 2, pages 167-189, 1996.
18. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38(1), pp. 691-729, 1991.
19. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In STOC 85, pages 291-304, 1985.
20. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Jour. on Computing, Vol. 18(1), pp. 186-208, 1989.
21. S. Goldwasser, S. Micali and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks. SIAM Jour. on Computing, Vol. 17, No. 2, pp. 281-308, 1988.
22. S. Halevi and S. Micali. Conservative Proofs of Knowledge. MIT/LCS/TM-578, May 1998.
23. J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby. Construction of Pseudorandom Generator from any One-Way Function. SIAM Jour. on Computing, Vol. 28 (4), pages 1364-1396, 1999.
24. J. Kilian. A Note on Efficient Zero-Knowledge Proofs and Arguments. In 24th STOC, pages 723-732, 1992.
25. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In Crypto01, Springer LNCS 2139, pages 171-189, 2001.
26. S. Micali. CS Proofs. SIAM Jour. on Computing, Vol. 30 (4), pages 1253-1298, 2000.
27. D. Micciancio, S. Vadhan. Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In Crypto03. Springer LNCS 2729, pages. 282-298, 2003.
28. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992. Preliminary version in Crypto91, Springer (LNCS 576), pages 392-404, 1991.
29. M. Naor. Bit Commitment using Pseudorandomness. Jour. of Cryptology, Vol. 4, pages 151-158, 1991.
30. R. Pass. Simulation in Quasi-polynomial Time and its Application to Protocol Composition. In EuroCrypt03, Springer LNCS 2656, pages 160-176, 2003.
31. R. Pass and A. Rosen. New and Improved Constructions of Non-Malleable Cryptographic Protocols. In 37th STOC, 2004, pages 533-542, 2005.
32. M. Prabhakaran, A. Rosen and A. Sahai. Concurrent Zero-Knowledge with Logarithmic Round Complexity. In 43rd FOCS, pages 366-375, 2002.
33. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt99, Springer LNCS 1592, pages 415-431, 1999.
34. A. Sahai and S. Vadhan. A complete problem for statistical zero knowledge. J. ACM, 50(2):196-249, 2003.
35. M. Tompa, H. Woll. Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. In 28th FOCS, pages 472-482, 1987.