Comparing Information Without Leaking It

Communications of the ACM

Volumn 39, Issue 5, 1996, Pages 77-85

  Fagin, Ronald ^a   Naor, Moni ^b   Winkler, Peter ^c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; CRYPTOGRAPHY; FUNCTION EVALUATION; FUNCTIONS; NETWORK PROTOCOLS; RANDOM NUMBER GENERATION; RANDOM PROCESSES; TURING MACHINES;

BARRINGTONS THEOREM; DIGITAL ENVELOPES; ELECTRONIC TRUSTED PARTY; PASSWORD; PERMUTATION COMPOSITION; RANDOM PERMUTATION;

SECURITY OF DATA;

EID: 0030150177     PISSN: 00010782     EISSN: None     Source Type: Journal    
DOI: 10.1145/229459.229469     Document Type: Article

References (21)

1. 1, J. Computer Syst. Sci. 38 (1988), 150-164.
2. Ben-Or, M., Goldreich, O., Micali, S., and Rivest, R. A fair protocol for contract signing, IEEE Trans. Inf. Theory 36 (1990), 40-46.
3. Ben-Or, M., Goldwasser, S., and Wigderson, A. Completeness theorems for non-cryptographic fault-tolerated distributed computation. In Proceedings of 20th ACM Symposium on Theory of Computing (Chicago, 1988), pp. 1-10.
4. Brassard, G, Crépeau, C., and Robert, J.-M. All-or-Nothing Disclosure of Secrets, Advances in Cryptology, Crypto '86, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, New York, 1987, pp. 234-238.
5. Carter, J.L., and Wegman, M.N. Universal classes of hash functions. J. Comput. Syst. Sci. 18 (1979), 143-154.
6. Chaum D., Crépeau C., and Damgård I. Multiparty unconditionally secure protocols. In Proceedings of the 20th ACM Symposium on Theory of Computing (Chicago, 1988), pp. 11-19.
7. Chor, B., and Kushilevitz, E. A zero-one law for Boolean privacy. SIAM J. Discr. Math. 4 (1991), 36-47.
8. Cleve, R. Controlled Gradual Disclosure Schemes for Random Bits and Their Applications, Advances in Cryptology, Crypto '89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, New York 1987, pp. 573-587.
9. Crépeau, C., and Kilian, J. Discreet Solitary Games, Advances in Cryptology, Crypto '93, Lecture Notes in Computer Science, Vol. 773, Springer-Verlag, New York, 1994, pp. 319-330.
10. Even, S., Goldreich, O., and Lempel, A. A randomized protocol for signing contracts. Commun. ACM 28 (1985), 637-647.
11. Feige, U., Kilian, J., and Naor, M. On minimal models for secure computation. In Proceedings of the 26th ACM Symposium on Theory of Computing (Montréal, 1994), pp. 554-563.
12. Goldreich, O. Randomness, interactive proofs, and zero-knowledge - A survey. In The Universal Turing Machine: A Half Century Survey, R. Herken, ed., Oxford University Press, 1988, pp. 377-405.
13. Goldreich, O., Micali, M., and Wigderson, A. How to play any mental game. In Proceedings of the 19th ACM Symposium on Theory of Computing (New York, 1987), pp. 218-229.
14. Kilian, J. Use of Randomness in Algorithms and Protocols. MIT Press, Cambridge, Mass., 1990.
15. Rabin, M.O. How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
16. Rabin, M.O. Transaction protection by beacons. J. Computer Syst. Sci. 27 (1983), 256-267.
17. Shamir, A., Rivest, R., and Adleman, L. Mental poker. In The Mathematical Gardener, D. Klarner, ed. Wadsworth International, 1981, pp. 37-43.
18. Wegman, M.N., and Carter, J.L. New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22 (1981), 265-279.
19. Wiesner, S. Conjugate coding. SIGACT News 15 (1983), 78-88.
20. Yao, A.C. Protocols for secure computations. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (Chicago, 1982), 160-164.
21. Yao, A.C. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (Toronto, 1986), pp. 162-167.