Resettable zero-knowledge (extended abstract)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 235-244

  Canetti, Ran ^a   Goldreich, Oded ^b   Goldwasser, Shafi ^c   Micali, Silvio ^c  

^a IBM RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

concurrent zero knowledge; identification schemes; public key cryptography; smart cards; witness indistinguisable proofs; zero knowledge

Indexed keywords

ASYNCHRONOUS NETWORKS; COMPLEXITY ASSUMPTIONS; CRYPTOGRAPHIC PROTOCOLS; DISCRETE LOGARITHM PROBLEMS; IDENTIFICATION SCHEME; WITNESS-INDISTINGUISABLE PROOFS; ZERO KNOWLEDGE; ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE;

COMPLEX NETWORKS; COMPUTATION THEORY; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SMART CARDS; COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; CRYPTOGRAPHY; DATA PRIVACY; PROBLEM SOLVING; RANDOM PROCESSES; SECURITY OF DATA; THEOREM PROVING;

NETWORK SECURITY; POLES AND ZEROS;

CRYPTOGRAPHIC PROTOCOLS; RESETTABLE ZERO-KNOWLEDGE (RZK);

EID: 0033723965     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335334     Document Type: Conference Paper

References (31)

1. M. Bellare and O. Goldreich, Proofs of Computational Ability. Crypto '92, August 1992. Full version available on the Theory of Cryptography Library, http://philby.ucsd.edu/old.html, Record Arc-03.
2. G. Brassard, D. Chaum and C. Crépeau. Minimum Disclosure Proofs of Knowledge. JCSS, Vol. 37, No. 2, pages 156-189, 1988.
3. R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali. Resettable Zero-Knowledge. ECCC, TR99-042, 1999.
4. Also available from the Theory of Cryptography Library.
5. I. Damgärd. Concurrent Zero-Knowledge in Easy in Practice. Theory of Cryptography Library, 99-14, June 1999. http://philby.ucsd.edu/cryptolib/1999. html.
6. I. Damgärd. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt 2000.
7. D. Dolev, C. Dwork, and M. Naor. Non-Malleable Cryptography. In 23rd STOC, pages 542-562, 1991.
8. C. Dwork, and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Crypto98, Springer LNCS 1462.
9. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
10. U. Feige. Ph.D. thesis, Weizmann Institute of Science.
11. U. Feige, A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, Vol. 1, 1988, pages 77-94.
12. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416-426, 1990.
13. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solution to Identification and Signature Problems. In CRYPTO86, Springer-Verlag LNCS 263, pages 186-189, 1987.
14. O. Goldreich. Foudation of Cryptography - Fragments of a Book. February 1995. Revised version, January 1998. Both versions are available from http://theory.lcs.mit.edu/~oded/frag.html.
15. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. JACM, Vol. 33, No. 4, pages 792-807, 1986.
16. O. Goldreich, S. Goldwasser, and S. Micali. Interleaved Zero-Knowledge in the Public-Key Model. ECCC, TR99-024,
17. Also available from the Theory of Cryptography Library.
18. 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. (Pubitemid 126814357)
19. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. Computing, Vol. 25, No. 1, pages 169-192, 1996. (Pubitemid 126599616)
20. O. Goldreich and L.A. Levin. Hard-core Predicates for any One-Way Function. In 21st STOC, pages 25-32, 1989.
21. 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, No. 1, pp. 691-729, 1991.
22. O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.
23. S. Goldwasser and S. Micali. Patent applications on Internet Zero-knowledge Protocols and Application (3/3/ 99)
24. and Internet Zero-Knowledge and Low-Knowledge Proofs and Protocols (6/11/ 99).
25. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., Vol. 18, No. 1, pp. 186-208, 1989.
26. J. Håstad, 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.
27. J. Kilian, E. Petrank, and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
28. M. Naor. Bit Commitment using Pseudorandom Generators. Jour. of Cryptology, Vol. 4, pages 151-158, 1991.
29. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt99, Springer LNCS 1592, pages 415-413.
30. M. Tompa and H. Woll. Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information. In 28th FOCS, pages 472-482, 1987.
31. A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd FOCS, pages 80-91, 1982.