686 search results - page 85 / 138 » Secure Two-Party Computation Is Practical |
109
Voted
ASIACRYPT
1991
Springer
15 years 6 months ago
1991
Springer
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...
112
Voted
CTRSA
2005
Springer
15 years 8 months ago
2005
Springer
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 ...
106
Voted
DAM
2006
15 years 2 months ago
2006
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-...
133
Voted
CCS
2007
ACM
15 years 9 months ago
2007
ACM
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...
115
Voted
CCS
2004
ACM
15 years 8 months ago
2004
ACM
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...