115
Voted
TCC
16 years 29 days ago
2009 Springer 
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
102
Voted
TCC
16 years 29 days ago
2009 Springer 
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
104
Voted
TCC
16 years 29 days ago
2009 Springer 
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated th...
120
click to vote
TCC
16 years 29 days ago
2009 Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
117
Voted
TCC
16 years 29 days ago
2009 Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
|
Cryptology