Sciweavers

23 search results - page 2 / 5
» Practical Private Set Intersection Protocols with Linear Com...
Sort
View
ICALP
2007
Springer
13 years 11 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 11 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
ACNS
2011
Springer
237views Cryptology» more  ACNS 2011»
12 years 9 months ago
Private Discovery of Common Social Contacts
The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common p...
Emiliano De Cristofaro, Mark Manulis, Bertram Poet...
ECCV
1998
Springer
13 years 9 months ago
On Degeneracy of Linear Reconstruction from Three Views: Linear Line Complex and Applications
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
Gideon P. Stein, Amnon Shashua
IACR
2011
127views more  IACR 2011»
12 years 5 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky