Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Chaum, C. Crépeau, I. Damgård (1988)
Multiparty unconditionally secure protocols
About the Authors: RONALD FAGIN is manager of the Foundations of Computer Science group at the IBM Almaden Research Center
A. Yao (1982)
Protocols for secure computations23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
M. Wegman, L. Carter (1981)
New Hash Functions and Their Use in Authentication and Set EqualityJ. Comput. Syst. Sci., 22
J. Kilian (1990)
Uses of randomness in algorithms and protocols
Oded Goldreich (1991)
The Knowledge Complexity of Interactive Proof Systems.Proofs that Release Minimum Knowledge.Randomness, Interactive Proofs, and Zero-Knowledge--A SurveyJournal of Symbolic Logic, 56
M. Ben-Or, Oded Goldreich, S. Micali, R. Rivest (1990)
A fair protocol for signing contractsIEEE Trans. Inf. Theory, 36
(1981)
Mental Poker, i n The Mathematical Gardner
S. Even, Oded Goldreich, A. Lempel (1985)
A randomized protocol for signing contractsCommun. ACM, 28
Oded Goldreich, S. Micali, A. Wigderson (1987)
How to play ANY mental gameProceedings of the nineteenth annual ACM symposium on Theory of computing
P. Kidwell (1996)
The universal turing machine: a half-century surveyIEEE Annals of the History of Computing, 18
D. Barrington (1989)
Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹J. Comput. Syst. Sci., 38
(1996)
C COMMUNICATIONS OF THE ACM
U. Feige, J. Kilian, M. Naor (1994)
A minimal model for secure computation (extended abstract)
(1981)
How to exchange secrets by oblivious transfer , Tech
R. Cleve (1989)
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
C. Crépeau, J. Kilian (1994)
Discreet Solitary Games
Almaden Research Center, 650 Harry Road, San Jose, CA 95120-6099; email: fagin@almaden.ibm.com MONI NAOR is the incumbent of the Morris and Rose Goldman Career Development Chair
G. Brassard, C. Crépeau, J. Robert (1986)
All-or-Nothing Disclosure of Secrets
M. Rabin (1983)
Transaction Protection by BeaconsJ. Comput. Syst. Sci., 27
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Author's Present Address: Dept. of Applied Math and Computer Science, Weizmann Institute of Science
Benny Chor, Eyal Kushilevitz (1991)
A Zero-One Law for Boolean PrivacySIAM J. Discret. Math., 4
L. Carter, M. Wegman (1979)
Universal Classes of Hash FunctionsJ. Comput. Syst. Sci., 18
D. Barrington (1986)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
A. Yao (1986)
How to Generate and Exchange Secrets (Extended Abstract)
S. Wiesner (1983)
Conjugate codingSIGACT News, 15
How can two people determine without revealing anything else to each other whether they possess the same information in case they do not? There are surprisingly simple solutions. Comparing Information Without Ronald Fagin, Moni Naor, and Peter Winkler Leaking It Spy vs. Spy is a trademark of E.C. Publications, Inc. ©1996. All rights reserved. Used with permission COMMUNICATIONS OF THE ACM May 1996/Vol. 39, No. 5 C onsider the following problem, which actually occurred in real life; the problem is masked somewhat to protect the participants confidentiality. Bob comes to Ron, a manager in his com- pany, with a complaint about a sensitive matter, asking Ron to keep his identity confidential. A few months later, Moshe (another manager) tells Ron that someone has complained to him, also with a confidentiality request, about the same matter. Ron and Moshe would like to determine whether the same person has complained to each of them, but, if there are two complainers, Ron and Moshe want to give no information to each other about their identities. The protocol typically used in a situation like this is akin to the game 20 Questions, but is known as delicate conversational probing.
Communications of the ACM – Association for Computing Machinery
Published: May 1, 1996
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.