100 search results - page 4 / 20 » Asynchronous Secure Multiparty Computation in Constant Time |
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
ICDCS
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper presents a new transformation which adds fault-containment properties to any silent self-stabilizing protocol. The transformation features a constant slow-down factor a...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
IANDC
2007
13 years 8 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
ICPADS
2005
IEEE
14 years 2 months ago
2005
IEEE
To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system ...