90 search results - page 9 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
ICICS
2004
Springer
14 years 1 months ago
2004
Springer
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
EUROCRYPT
2010
Springer
14 years 15 days ago
2010
Springer
A broadcast protocol allows a sender to distribute a message through a point-to-point network to a set of parties, such that (i) all parties receive the same message, even if the s...
CRYPTO
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...