Sciweavers

13 search results - page 1 / 3
» Efficient Private Matching and Set Intersection
Sort
View
EUROCRYPT
2004
Springer
13 years 8 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
FC
2009
Springer
84views Cryptology» more  FC 2009»
13 years 8 months ago
Private Intersection of Certified Sets
Abstract. This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersec...
Jan Camenisch, Gregory M. Zaverucha
ACNS
2009
Springer
118views Cryptology» more  ACNS 2009»
13 years 8 months ago
Efficient Robust Private Set Intersection
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, M...
ASIACRYPT
2010
Springer
13 years 2 months ago
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such tha...
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik
CSREASAM
2006
13 years 6 months ago
An Efficient Bloom Filter Based Solution for Multiparty Private Matching
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...
Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. ...