Comparing information without leaking it
- 1 May 1996
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 39 (5) , 77-85
- https://doi.org/10.1145/229459.229469
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A minimal model for secure computation (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- A Zero-One Law for Boolean PrivacySIAM Journal on Discrete Mathematics, 1991
- A fair protocol for signing contractsIEEE Transactions on Information Theory, 1990
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Conjugate codingACM SIGACT News, 1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979