Ronald Fagin, Moni Naor  Home/Search
Context Related
| wisdom.weizmann.ac...ompare_paper.ps.gz wisdom.weizmann.ac.il/~naor/P...comp.ps ampl.com/who/pw/papers/compare.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosoft.com/html/secpub (more) From: ampl.com/who/pw/papers/pubs (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider simple means by which two people may determine whether they possess the same information, without revealing anything else to each other in case that they do not. Incumbent of the Morris and Rose Goldman Career Development Chair. Research supported by an Alon Fellowship and a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences. Most of this work was done while the author was at the IBM Almaden Research Center. y Most of this work was done... (Update)
Cited by: More
Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005) (Correct)
Privacy-Preserving Set Operations - Lea Kissner Dawn (2005) (Correct)
Basing Cryptographic Protocols on Tamper-Evident Seals - Moran, Naor (2005) (Correct)
Similar documents (at the sentence level):
47.1%: Comparing Information Without Leaking It - Fagin, Naor, Winkler (1996) (Correct)
Active bibliography (related documents): More All
0.5: A Minimal Model for Secure Computation - Feige, Kilian, Naor (1994) (Correct)
0.5: A parallel model for 3D quantum reactive scattering.. - Bolloni, Crocchianti.. (Correct)
0.2: On the Complexity of Statistical Reasoning - Kilian, Naor (1998) (Correct)
Similar documents based on text: More All
0.3: Efficient Cryptographic Schemes Provably as Secure as Subset Sum - Impagliazzo, Naor (1996) (Correct)
0.2: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
0.2: Optimal Aggregation Algorithms for Middleware - Ronald Fagin Amnon (2001) (Correct)
Related documents from co-citation: More All
20: Oblivious Transfer and Polynomial Evaluation (context) - Naor, Pinkas - 1998
14: Secure multi-party computation - Goldreich - 1998
14: How to Generate and Exchange Secrets (context) - Yao
BibTeX entry: (Update)
R. Fagin, M. Naor, P. Winkler, "Comparing information without leaking it", CACM, Vol 39, No. 5, May 1996, pp. 77--85. http://citeseer.ist.psu.edu/article/fagin96comparing.html More
@article{ fagin96comparing,
author = "Ronald Fagin and Moni Naor and Peter Winkler",
title = "Comparing Information without leaking it",
journal = "{Communications of the ACM}",
volume = "39",
number = "5",
pages = "77--85",
year = "1996",
url = "citeseer.ist.psu.edu/article/fagin96comparing.html" }
Citations (may not include all citations):358 Universal Classes of Hash Functions (context) - Carter, Wegman - 1979
287 Multiparty Unconditionally Secure Protocols (context) - Chaum, Cr'epeau et al. - 1988
250 How to play any mental game (context) - Goldreich, Micali et al. - 1987
219 Completeness Theorems for NonCryptographic Fault-Tolerant Di.. (context) - Ben-Or, Goldwasser et al. - 1988
197 A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
191 New Hash Functions and Their Use in Authentication and Set E.. (context) - Wegman, Carter - 1981
185 How to Generate and Exchange Secrets (context) - Yao - 1986
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
167 Protocols for Secure Computations (context) - Yao - 1982
53 On minimal models for secure computation - Feige, Kilian et al. - 1994
49 All-or-Nothing Disclosure of Secrets - Brassard, Cr'epeau et al. - 1987
27 Use of Randomness in Algorithms and Protocols (context) - Kilian - 1990
23 Controlled Gradual Disclosure Schemes for Random Bits and Th.. (context) - Cleve - 1987
23 Conjugate coding (context) - Wiesner - 1983
22 Transaction Protection by Beacons (context) - Rabin - 1983
5 Bounded-width polynomial-sized branching programs recognize .. (context) - Barrington - 1988
5 and Zero-Knowledge--A Survey (context) - Goldreich, Interactive - 1988
3 Rivest and L (context) - Shamir - 1981
2 Lecture Notes in Computer Science (context) - Cr'epeau, Kilian et al. - 1994
2 A fair protocol for contract signing (context) - Ben-Or, Goldreich et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC