Sciweavers

Share
1066 search results - page 1 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ASIACRYPT
2010
Springer
10 years 10 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
FC
2010
Springer
164views Cryptology» more  FC 2010»
11 years 15 hour ago
Practical Private Set Intersection Protocols with Linear Complexity
Emiliano De Cristofaro, Gene Tsudik
CRYPTO
2005
Springer
96views Cryptology» more  CRYPTO 2005»
11 years 5 months ago
Privacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...
Lea Kissner, Dawn Xiaodong Song
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
11 years 5 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
IACR
2011
94views more  IACR 2011»
9 years 11 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
books