156 search results - page 1 / 32 » On the Round Complexity of Covert Computation |
STOC
2010
ACM
13 years 9 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 6 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
2008
Springer
13 years 6 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
ASIACRYPT
2010
Springer
13 years 1 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
EUROCRYPT
2007
Springer
13 years 8 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...