Resettable zero-knowledge (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Resettable zero-knowledge (extended abstract)

Full text

Pdf (1.21 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirty-second annual ACM symposium on Theory of computing table of contents

Portland, Oregon, United States

Pages: 235 - 244

Year of Publication: 2000

ISBN:1-58113-184-4

Authors

Ran Canetti	IBM Research, Yorktown Height, NY
Oded Goldreich	Dept. of Computer Science, Weizmann Institute of Science, Rehovot, ISRABL
Shafi Goldwasser	Laboratory for Computer Science, MIT, Cambridge, MA
Silvio Micali	Laboratory for Computer Science, MIT, Cambridge, MA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 32, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/335305.335334 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M. Bellaxe and O. Goldreich, Proofs of Computational Ability. Crypto '92, August 1992. Full version available on the Theo~ of C~ptogr~phy Lib~'a~y, http://philby .ucsd. sdu/01d, html, Record Arc-03.
	2	Gilles Brassard , David Chaum , Claude Crépeau, Minimum disclosure proofs of knowledge, Journal of Computer and System Sciences, v.37 n.2, p.156-189, October 1988 [doi>10.1016/0022-0000(88)90005-0]
	3	R. Canetti , O. Goldreich , S. Goldwasser , S. Micali, Resettable Zero-Knowledge, Weizmann Science Press of Israel, Jerusalem, Israel, 1999
	4	I. Damg&rd. Concurrent Zero-Knowledge in Easy in Practics. Theory of Cryptography Library, 99-14, 3une 1999. http: } }philby. ucsd. e du/crypt 01 ib/1999, html.
	5	I. Damg~-rd. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Eurocrypt 2000.
	6	Danny Dolev , Cynthia Dwork , Moni Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.542-552, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103474]
	7	Cynthia Dwork , Amit Sahai, Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints, Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, p.442-457, August 23-27, 1998
	8	Cynthia Dwork , Moni Naor , Amit Sahai, Concurrent zero-knowledge, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.409-418, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276853]
	9	U. Feige. Ph.D. thesis, Weizmann Institute of Science.
	10	U. Feige , A. Fiat , A. Shamir, Zero-knowledge proofs of identity, Journal of Cryptology, v.1 n.2, p.77-94, Aug. 1988 [doi>10.1007/BF02351717]
	11	U. Feige , A. Shamir, Witness indistinguishable and witness hiding protocols, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.416-426, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100272]
	12	Amos Fiat , Adi Shamir, How to prove yourself: practical solutions to identification and signature problems, Proceedings on Advances in cryptology---CRYPTO '86, p.186-194, January 1987, Santa Barbara, California, United States
	13	O. Goldreich. Foundation of C~jptography - F, ag- ~'nentz of a Book. February 1996. Revised version, January 1998. Both versions axe available from http://theory, lcs. mi~. sdu/~oded/frag, h~ml.
	14	Oded Goldreich , Shafi Goldwasser , Silvio Micali, How to construct random functions, Journal of the ACM (JACM), v.33 n.4, p.792-807, Oct. 1986 [doi>10.1145/6490.6503]
	15	O. Goldreich, S. Goldwasser, and S. Micali. Interleaved Zero-Knowledge in the Public-Key Model. ECCC, TR99- 024, 1999. Also available from the Theor~j of Cr~yptography Library.
	16	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.
	17	Oded Goldreich , Hugo Krawczyk, On the Composition of Zero-Knowledge Proof Systems, SIAM Journal on Computing, v.25 n.1, p.169-192, Feb. 1996 [doi>10.1137/S0097539791220688]
	18	O. Goldreich , L. A. Levin, A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.25-32, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73010]
	19	Oded Goldreich , Silvio Micali , Avi Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM (JACM), v.38 n.3, p.690-728, July 1991 [doi>10.1145/116825.116852]
	20	O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.
	21	S. Goldwasser and S. Micali. Patent applications on Inand Internet Zero-Knotvledge and Lo~v-Knotoledge Proofs ~.d P~oto~oZ, (6/ll/sg).
	22	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	23	Johan HÅstad , Russell Impagliazzo , Leonid A. Levin , Michael Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, v.28 n.4, p.1364-1396, Aug. 1999 [doi>10.1137/S0097539793244708]
	24	Joe Kilian , Erez Petrank , Charles Rackoff, Lower Bounds for Zero Knowledge on the Internet, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.484, November 08-11, 1998
	25	M. Naor. Bit Commitment using Pseudorandom Generators. Jolt. of Cryptology, Vol. 4, pages 151-158, 1991.
	26	It. Richardson and 3. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In B~.o(Tr~p~99, Springer LNCS 1592, pages 415-413.
	27	M. Tompa and H. Woll. Random Self-Reducibility and Zero- Knowledge Interactive Proofs of Possession of Information. In 28th FOC$, pages 472-482, 1987.
	28	A.C. Yao. Theory and Application of Trapdoor Functions. In 23~d FO C$, pages 80-91, 1982.

CITED BY 9

	Ran Canetti , Joe Kilian , Erez Petrank , Alon Rosen, Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.570-579, July 2001, Hersonissos, Greece
	Cynthia Dwork , Larry Stockmeyer, 2-round zero knowledge and proof auditors, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Joe Kilian , Erez Petrank, Concurrent and resettable zero-knowledge in poly-loalgorithm rounds, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.560-569, July 2001, Hersonissos, Greece
	Cynthia Dwork , Moni Naor , Amit Sahai, Concurrent zero-knowledge, Journal of the ACM (JACM), v.51 n.6, p.851-898, November 2004
	Rafael Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
	Oded Goldreich, Concurrent zero-knowledge with timing, revisited, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Yunlei Zhao , Xiaotie Deng , C. H. Lee , Hong Zhu, (2 +f(n))-SAT and its properties, Discrete Applied Mathematics, v.136 n.1, p.3-11, 30 January 2004
	Boaz Barak , Yehuda Lindell , Salil Vadhan, Lower bounds for non-black-box zero knowledge, Journal of Computer and System Sciences, v.72 n.2, p.321-391, March 2006
	Boaz Barak , Yehuda Lindell, Strict polynomial-time in simulation and extraction, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada