How convincing is your protocol?

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

How convincing is your protocol?

Full text

Pdf (640 KB)

Source

ACM SIGACT News archive
Volume 22 , Issue 1 (Winter 1991) table of contents

Pages: 5 - 12

Year of Publication: 1991

ISSN:0163-5700

Author

Gilles Brassard

Université de Montréal, Département IRO, Université de Montréal, C .P. 6128, succursale "A", Montréal (Québec), Canada H3C 3J7

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/122413.122414 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	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]
	2	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]
	3	Josh Cohen Benaloh , Jerry Leichter, Generalized Secret Sharing and Monotone Functions, Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology, p.27-35, August 21-25, 1988
	4	Joan F. Boyar , Stuart A. Kurtz, A discrete logarithm implementation of perfect zero-knowledge blobs, Journal of Cryptology, v.2 n.2, p.63-76, 1990
	5	Gilles Brasard, Cryptology — column 3 hot news on interactive protocols, ACM SIGACT News, v.21 n.1, p.7, Jan. 1990 [doi>10.1145/379139.379162]
	6	Gilles Brassard, How convincing is your protocol?, ACM SIGACT News, v.22 n.1, p.5-12, Winter 1991 [doi>10.1145/122413.122414]
	7	[Bra91b] Brassard, G., "Cryptology column: Bit commitment schemes" Sigact News, Vol. 22, 1991, to be written.
	8	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]
	9	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
	10	[BC86b] Brassard, G. and C. Crépeau, "Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond", Proceedings of 27th Annual IEEE Symposium on the Foundations of Computer Science, October 1986, pp. 188-195.
	11	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
	12	Gilles Brassard , Claude Crépeau , Jean-Marc Robert, All-or-nothing disclosure of secrets, Proceedings on Advances in cryptology---CRYPTO '86, p.234-238, January 1987, Santa Barbara, California, United States
	13	[BCR86b] Brassard, G., C. Crépeau, and J.-M. Robert, "Information-theoretic reductions among disclosure problems", Proceedings of 27th Annual IEEE Symposium on the Foundations of Computer Science, October 1986, pp. 168-173.
	14	Gilles Brassard , Moti Yung, One-Way Group Actions, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.94-107, August 11-15, 1990
	15	David Chaum, Security without identification: transaction systems to make big brother obsolete, Communications of the ACM, v.28 n.10, p.1030-1044, Oct. 1985 [doi>10.1145/4372.4373]
	16	[Cha85b] Chaum, D., Cryptography Course, Amsterdam, October 1985, Transparencies 20-22 in David Chaum's presentation on credential mechanisms, which appeared in the Course Notes distributed to the participants. This work was previously presented at Eurocrypt '85, April 1985, but did not appeal in the Proceedings.
	17	David Chaum, Demonstrating that a public predicate can be satisfied without revealing any information about how, Proceedings on Advances in cryptology---CRYPTO '86, p.195-199, January 1987, Santa Barbara, California, United States
	18	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
	19	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]
	20	[GMW86] Goldreich, O., S. Micali, and A. Wigderson, "Proofs that yield nothing but their validity and a methodology of cryptographic protocol design", Proceedings of 27th Annual IEEE Symposium on the Foundations of Computer Science, October 1986, pp. 174-187.
	21	S Goldwasser , S Micali , C Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.291-304, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22178]
	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	Russell Impagliazzo , Moti Yung, Direct Minimum-Knowledge Computations, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.40-51, August 16-20, 1987
	24	[Rab77] Rabin, M. O., "Digitalized signatures", in Foundations of Secure Computation (Workshop held in October 1977), Academic Press, New York, NY, 1978, pp. 21-39.
	25	[Sha90] Shamir, A., "IP = PSPACE", Proceedings of 31st Annual IEEE Symposium on the Foundations of Computer Science, October 1990, pp. 11-15.

CITED BY 2

	Joan Boyar , Gilles Brassard , René Peralta, Subquadratic zero-knowledge, Journal of the ACM (JACM), v.42 n.6, p.1169-1193, Nov. 1995
	Gilles Brassard, How convincing is your protocol?, ACM SIGACT News, v.22 n.1, p.5-12, Winter 1991