Sciweavers

185 search results - page 3 / 37
» Efficiently computing private recommendations
Sort
View
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 1 months ago
Efficient Private Record Linkage
— Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and...
Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmag...
ACNS
2009
Springer
118views Cryptology» more  ACNS 2009»
13 years 10 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...
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 10 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
EUROCRYPT
2004
Springer
13 years 10 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
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
13 years 10 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel