Adaptive zero knowledge and computational equivocation (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Adaptive zero knowledge and computational equivocation (extended abstract)

Full text

Pdf (1.05 MB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 629 - 638

Year of Publication: 1996

ISBN:0-89791-785-5

Author

Donald Beaver

Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PA

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): 27, Citation Count: 1

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/237814.238014 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.

	Bab85	L Babai, Trading group theory for randomness, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.421-429, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22192]
	BM88	László Babai , Shlomo Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class, Journal of Computer and System Sciences, v.36 n.2, p.254-276, April 1988 [doi>10.1016/0022-0000(88)90028-1]
	Bea91	Donald Beaver, Foundations of Secure Interactive Computing, Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.377-391, August 11-15, 1991
	Bea92	D. Beaver. "How to Break a 'Secure' Oblivious Transfer Protocol." Advances in Cryptology - Eurocrypt '92 Proceedings, Springer-Verlag LNCS 658, 1993, 285-296.
	Bea96	D. Beaver. "Equivocable Oblivious Transfer.'' To appear, Advances in Cryptology- Eurocrypt '96 Proceedings, 1996.
	BH92	D. Beaver, S. Haber. "Cryptographic Protocols Provably Secure Against Dynamic Adversaries.'' Eurocrypt 1992.
	Ben86	Josh Cohen Benaloh, Cryptographic capsules: a disjunctive primitive for interactive protocols, Proceedings on Advances in cryptology---CRYPTO '86, p.213-222, January 1987, Santa Barbara, California, United States
	Ben87	J. BenMoh. Verifiable Secret Ballot Elections. PhD Thesis, Yale University, 1987.
	BGW88	Michael Ben-Or , Shafi Goldwasser , Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.1-10, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62213]
	BrCr89	Gilles Brassard , Claude Crepeau, Sorting out zero-knowledge, Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.181-191, November 1990, Houthalen, Belgium
	BHZ87	R. B. Boppana , J. Hastad , S. Zachos, Does co-NP have short interactive proofs?, Information Processing Letters, v.25 n.2, p.127-132, 6 May 1987 [doi>10.1016/0020-0190(87)90232-8]
	BCC88	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]
	BC86a	Gilles Brassard , Claude Crépeau, Zero-knowledge simulation of Boolean circuits, Proceedings on Advances in cryptology---CRYPTO '86, p.223-233, January 1987, Santa Barbara, California, United States
	BC86b	G. Br~ssard, C. Cr~peau. "Non-Transitive Transfer of Confidence: A Perfect Zero- Knowledge Interactive Protocol for SAT and Beyond." Proceedings of the 27~h FOCS, IEEE, 1986, 188-195.
	CFGN96	Ran Canetti , Uri Feige , Oded Goldreich , Moni Naor, Adaptively secure multi-party computation, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.639-648, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.238015]
	CCD88	David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62214]
	CDG87	David Chaum , Ivan Damgård , Jeroen van de Graaf, Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.87-119, August 16-20, 1987
	DP92	A. DeSantis, G. Persiano. "Zero-Knowledge Proofs of Knowledge Without Interaction." Proceedings of the 33ra FOC$, IEEE, 1992, 427-436.
	DH76	W. Diffie, M. Hellman. "New Directions in Cryptography." IEEE Transactions of In. formation Theory IT-22 (November 1976), 644-654.
	FFS88	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]
	For87	L. Fortnow, The complexity of perfect zero-knowledge, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.204-209, January 1987, New York, New York, United States [doi>10.1145/28395.28418]
	GL89	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]
	GMW86	O. Goldreich, S. Micali, A. Wigderson. "Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design." Proceedings of the 27th FOC$, IEEE, 1986, 174-187.
	GMW87	O. Goldreich , S. Micali , A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.218-229, January 1987, New York, New York, United States [doi>10.1145/28395.28420]
	GV87	Oded Goldreich , Ronen Vainish, How to Solve any Protocol Problem - An Efficiency Improvement, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.73-86, August 16-20, 1987
	GM84	S. Goldwasser, S. Micali. "Probabilistic Encryption." J. Comput. System Sci. 28 (1984), 270-299.
	GMR89	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]
	KL82	R. Karp, R. Lipton. "Turing Machines That Take Advice." Enseign. Maih. 28, 1982, 191-20t.
	Kil88	Joe Kilian, Founding crytpography on oblivious transfer, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.20-31, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62215]
	MR91	S. Micali, P. Rogaway. "Secure Computation.'' Proc. of Crypto 1991, page 9.8
	sic	, and incomplete preliminary version distributed at conference.
	NY90	M. Naor , M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.427-437, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100273]
	Ore87	Y. Oren. "On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs." Proceedings of the 28th FOUS, IEEE, 1987, 462-471.
	Rab81	M.O. Rabin. "How to Exchange Secrets by Oblivious Transfer." TR-81, Aiken Computational Laboratory, Harvard, 1981.
	Sha49	C. Shannon. "Communication Theory of Secrecy Systems." Bell Syst. Tech. J. 28, October 1949, 656-715.
	Sip83	Michael Sipser, A complexity theoretic approach to randomness, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.330-335, December 1983 [doi>10.1145/800061.808762]
	TW87	M. Tompa, H. Woll. "Random Self- Reducibility and Zero-Knowledge Proofs of Possession of Information." Proceedings of the 28~h FOCS, IEEE, 1987, 472-482.