156 search results - page 23 / 32 » On the Round Complexity of Covert Computation |
IACR
2011
12 years 7 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
ICISC
2009
13 years 5 months ago
2009
Abstract. Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, t...
AAAI
2007
13 years 9 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
COCO
2005
Springer
14 years 28 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...