Sciweavers

ASIACRYPT
2010
Springer
13 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
CRYPTO
2008
Springer
109views Cryptology» more  CRYPTO 2008»
14 years 2 months ago
Adaptive One-Way Functions and Applications
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan
TCC
2004
Springer
96views Cryptology» more  TCC 2004»
14 years 5 months ago
On the Notion of Pseudo-Free Groups
We explore the notion of a pseudo-free group, first introduced by Hohenberger [Hoh03], and provide an alternative stronger definition. We show that if Z∗ n is a pseudo-free abe...
Ronald L. Rivest
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 1 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...