73 search results - page 15 / 15 » Efficient Public-Key Cryptography in the Presence of Key Lea... |
TCC
2009
Springer
14 years 5 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
TCC
2009
Springer
14 years 5 months 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...