Sciweavers

321 search results - page 21 / 65
» Secure Multiparty Computation of Approximations
Sort
View
ICDE
2005
IEEE
100views Database» more  ICDE 2005»
14 years 12 months ago
Configurable Security Protocols for Multi-party Data Analysis with Malicious Participants
Standard multi-party computation models assume semi-honest behavior, where the majority of participants implement protocols according to specification, an assumption not always pl...
Bradley Malin, Edoardo Airoldi, Samuel Edoho-Eket,...
EUROCRYPT
2004
Springer
14 years 2 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
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 7 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han
EUROCRYPT
2007
Springer
14 years 4 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
EUROCRYPT
2004
Springer
14 years 4 months ago
Secure Computation of the k th-Ranked Element
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
Gagan Aggarwal, Nina Mishra, Benny Pinkas