30 search results - page 1 / 6 » Concurrently Secure Computation in Constant Rounds |
FOCS
2003
IEEE
14 years 27 days ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
IACR
2011
12 years 7 months ago
2011
CRYPTO
2001
Springer
14 years 3 days ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
STOC
2010
ACM
14 years 13 days ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...