Efficient private matching and set intersection

Efficient private matching and set intersection (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Michael J. Freedman , Kobbi Nissim , Benny Pinkas

Citations:

146 - 10 self

BibTeX

@INPROCEEDINGS{Freedman04efficientprivate,
    author = {Michael J. Freedman and Kobbi Nissim and Benny Pinkas},
    title = {Efficient private matching and set intersection},
    booktitle = {},
    year = {2004},
    pages = {1--19},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

484	Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2005
441	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT - Paillier - 1999
210	Balanced allocations - Azar, Broder, et al. - 1994
198	Limiting Privacy Breaches in Privacy Preserving Data Mining - Evfimievski, Gehrke, et al. - 2003
187	Computationally private information retrieval with polylogarithmic communication - Cachin, Micali, et al. - 1999
174	Oblivious transfer and polynomial evaluation - Naor, Pinkas - 1999
138	Limits on the provable consequences of oneway permutations - Impagliazzo, Rudich - 1988
130	The probabilistic communication complexity of set intersection - Kalyanasundaram, Schnitger - 1992
114	Efficient oblivious transfer protocols - NAOR, PINKAS - 2001
113	A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system - Damg˚ard, Jurik
81	Priced oblivious transfer: How to sell digital goods - Aiello, Ishai, et al.
80	Secure multiparty computation of approximations - Feigenbaum, Ishai, et al. - 2001
64	Secure multi-party computation - Goldreich - 1998
61	Using multiple hash functions to improve IP lookups - Broder, Mitzenmacher - 2001
56	Comparing information without leaking it - Fagin, Naor, et al. - 1996
33	A generalization, a simplification and some applications of Paillier’s probabilistic public-key system - DAMG˚ARD, JURIK - 2001
29	Applications of matrix methods to the theory of lower bounds in computational complexity - Razborov - 1990
28	Verifiable homomorphic oblivious transfer and private equality test - Lipmaa - 2003
27	Enhancing privacy and trust in electronic communities - Huberman, Franklin, et al. - 1999
26	A fair and efficient solution to the socialist millionaires’ problem - Boudot, Schoenmakers, et al.
24	E cient oblivious transfer protocols - Naor, Pinkas - 2001
18	Secure games with polynomial expressions - Kiayias, Yung - 2001
16	Trapdooring Discrete Logarithms on Elliptic Curves over Rings - Paillier - 2000
2	3. Fabrice Boudot, Berry Schoenmakers, and Jacques Traore. A fair and efficient solution to the socialist millionaires' problem - Cachin, Micali, et al. - 1999