30 search results - page 3 / 6 » Concurrently Secure Computation in Constant Rounds |
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
106
click to vote
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
118
click to vote
EUROCRYPT
2011
Springer
14 years 3 months ago
2011
Springer
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
108
click to vote
CCS
2008
ACM
15 years 1 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...