Sciweavers

Share
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
books