25 search results - page 2 / 5 » Bounded-Concurrent Secure Two-Party Computation in a Constan... |
STOC
2010
ACM
13 years 10 months 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...
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...