Sciweavers

71 search results - page 10 / 15
» LEGO for Two-Party Secure Computation
Sort
View
EUROCRYPT
2004
Springer
14 years 29 days ago
Public-Key Steganography
Informally, a public-key steganography protocol allows two parties, who have never met or exchanged a secret, to send hidden messages over a public channel so that an adversary can...
Luis von Ahn, Nicholas J. Hopper
SDM
2004
SIAM
242views Data Mining» more  SDM 2004»
13 years 9 months ago
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Multivariate statistical analysis is an important data analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analy...
Wenliang Du, Yunghsiang S. Han, Shigang Chen
TCOS
2010
13 years 2 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford
EUROCRYPT
2004
Springer
13 years 11 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