Sciweavers

Share
176 search results - page 1 / 36
» On the Round Complexity of Covert Computation
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
9 years 4 months ago
On the Round Complexity of Covert Computation
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...
Vipul Goyal and Abhishek Jain
EUROCRYPT
2008
Springer
9 years 1 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
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...
Vipul Goyal, Payman Mohassel, Adam Smith
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
9 years 1 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
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...
Payman Mohassel, Enav Weinreb
IACR
2016
40views Biometrics» more  IACR 2016»
3 years 8 months ago
The Exact Round Complexity of Secure Computation
Abstract. We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message e...
Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Ant...
EUROCRYPT
2007
Springer
9 years 4 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
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...
Jonathan Katz, Chiu-Yuen Koo
books