Sciweavers

686 search results - page 85 / 138
» Secure Two-Party Computation Is Practical
Sort
View
ASIACRYPT
1991
Springer
14 years 1 months ago
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
Joan Daemen
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
14 years 3 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
DAM
2006
121views more  DAM 2006»
13 years 10 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski
CCS
2007
ACM
14 years 4 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
CCS
2004
ACM
14 years 3 months ago
Parallel mixing
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
Philippe Golle, Ari Juels