Comparing information without leaking it

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Comparing information without leaking it

Full text

Pdf (344 KB)

Source

Communications of the ACM archive
Volume 39 , Issue 5 (May 1996) table of contents

Pages: 77 - 85

Year of Publication: 1996

ISSN:0001-0782

Authors

Ronald Fagin	Dept. K53-B2, IBM Research, Almaden Research Center, 650 Harry Road, San Jose, CA
Moni Naor	Dept. of Applied Math and Computer Science, Weizmann Institute of Science, Rehovot 76100, Israel
Peter Winkler	Bell Laboratories, 2D-147, 600 Mountain Avenue, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 79, Citation Count: 13

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/229459.229469 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	David A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, Journal of Computer and System Sciences, v.38 n.1, p.150-164, February 1989 [doi>10.1016/0022-0000(89)90037-8]
	2	BemOri Mi Goldreichi Oi Micalii Sii and vesti Ri A fair prot~ col for contract signing, Trans. In./'. The~ 36 (I990), 40-46.
	3	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]
	4	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
	5	Carteri JiLi and Wegman; M;N; Universal classes of hash func tions Com#ut: Syst: Sci: 18 (1979)143154!
	6	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]
	7	Benny Chor , Eyal Kushilevitz, A zero-one law for Boolean privacy, SIAM Journal on Discrete Mathematics, v.4 n.1, p.36-47, Feb. 1991 [doi>10.1137/0404004]
	8	Richard Cleve, Controlled gradual disclosure schemes for random bits and their applications, Proceedings on Advances in cryptology, p.573-588, July 1989, Santa Barbara, California, United States
	9	Claude Crépeau , Joe Kilian, Discreet solitary games, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.319-330, January 1994, Santa Barbara, California, United States
	10	Shimon Even , Oded Goldreich , Abraham Lempel, A randomized protocol for signing contracts, Communications of the ACM, v.28 n.6, p.637-647, June 1985 [doi>10.1145/3812.3818]
	11	Uri Feige , Joe Killian , Moni Naor, A minimal model for secure computation (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.554-563, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195408]
	12	O. Goldreich, Randomness, interactive proofs, and zero-knowledge—A survey, A half-century survey on The Universal Turing Machine, p.377-405, October 1988, Berlin, Germany
	13	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]
	14	Joe Kilian, Uses of randomness in algorithms and protocols, MIT Press, Cambridge, MA, 1990
	15	Rabini M:O: How to exchange secrets by oblivious transferi Tech. ~emo TR-8I; Nken Computation Laboratou; Hazard Univers i~: I98 I2
	16	Rabini M;O; Transaction protection by beaconsi J; Computer sy,t; s~; 27 (i0ss);
	17	Sham it; A{i mvesti R!; and Adle man; C i Mental poker i In The Mathematical Gardener, D i Fdar ne r; ed! Wadsworth Internation ali 1981i PPi 3743i
	18	Wegmani MiN{; and Carteri J{L; New hash functions and their use in authentication and set equali~i J2 Computi Syst2 Scii 22 22(1981) 265-279i
	19	Stephen Wiesner, Conjugate coding, ACM SIGACT News, v.15 n.1, p.78-88, Winter-Spring 1983 [doi>10.1145/1008908.1008920]
	20	Y ao; A: C: Protocols fo r seeure computations; In Proceedings of the S~mposium on Foundations g Computer Science ~Chica go; I982); 160-I64i
	21	Yaoi AiCi How to generate and exchange secretsi In Proceedings of the 27th Symposium on Foundations of Computer Science (Toronto, I98 I62-I67!

CITED BY 13

	Moni Naor , Benny Pinkas, Oblivious transfer and polynomial evaluation, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.245-254, May 01-04, 1999, Atlanta, Georgia, United States
	Tad Hogg , Bernardo A. Huberman , Matt Franklin, Protecting privacy while sharing information in electronic communities, Proceedings of the tenth conference on Computers, freedom and privacy: challenging the assumptions, p.73-75, April 04-07, 2000, Toronto, Ontario, Canada
	Bernardo A. Huberman , Matt Franklin , Tad Hogg, Enhancing privacy and trust in electronic communities, Proceedings of the 1st ACM conference on Electronic commerce, p.78-86, November 03-05, 1999, Denver, Colorado, United States
	Tim Bell , Harold Thimbleby , Mike Fellows , Ian Witten , Neil Koblitz , Matthew Powell, Explaining cryptographic systems, Computers & Education, v.40 n.3, p.199-215, April 2003
	József Balogh , János A. Csirik , Yuval Ishai , Eyal Kushilevitz, Private computation using a PEZ dispenser, Theoretical Computer Science, v.306 n.1-3, p.69-84, 5 September 2003
	Benny Pinkas, Cryptographic techniques for privacy-preserving data mining, ACM SIGKDD Explorations Newsletter, v.4 n.2, p.12-19, December 2002
	Ranveer Chandra , Venkata N. Padmanabhan , Ming Zhang, WiFiProfiler: cooperative diagnosis in wireless LANs, Proceedings of the 4th international conference on Mobile systems, applications and services, June 19-22, 2006, Uppsala, Sweden
	Shun-Dong Li , Yi-Qi Dai, Secure two-party computational geometry, Journal of Computer Science and Technology, v.20 n.2, p.258-263, March 2005
	S. Muthukrishnan, Data streams: algorithms and applications, Foundations and Trends® in Theoretical Computer Science, v.1 n.2, p.117-236, August 2005
	Nathaniel E. Baughman , Marc Liberatore , Brian Neil Levine, Cheat-proof playout for centralized and peer-to-peer gaming, IEEE/ACM Transactions on Networking (TON), v.15 n.1, p.1-13, February 2007
	John Brainard , Ari Juels , Burt Kaliski , Michael Szydlo, A new two-server approach for authentication with short secrets, Proceedings of the 12th conference on USENIX Security Symposium, p.14-14, August 04-08, 2003, Washington, DC
	Li Shundong , Wang Daoshun , Dai Yiqi , Luo Ping, Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations, Information Sciences: an International Journal, v.178 n.1, p.244-255, January, 2008
	Qingsong Ye , Huaxiong Wang , Josef Pieprzyk , Xian-Mo Zhang, Unconditionally secure disjointness tests for private datasets, International Journal of Applied Cryptography, v.1 n.3, p.225-235, February 2009