The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2007)
Providence, Rhode Island
Oct. 21, 2007 to Oct. 23, 2007
ISSN: 0272-5428
ISBN: 0-7695-3010-9
pp: 238-248
<p>In STOC?05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if other parties are also participating in the protocol or not. At the end of the protocol, if all parties participated in the protocol and if the function output is favorable to all parties, then the output is revealed. Ahn et al. constructed a protocol for covert two-party computation in the random oracle model.</p><p> In this paper, we offer a construction for covert multiparty computation. Our construction is in the standard model and does not require random oracles. In order to achieve this goal, we introduce a number of new techniques. Central to our work is the development of "zero-knowledge proofs to garbled circuits, "which we believe could be of independent interest. Along the way, we also develop a definition of covert computation as per the Ideal/Real model simulation paradigm.</p>
Rafail Ostrovsky, Vipul Goyal, Nishanth Chandran, Amit Sahai, "Covert Multi-Party Computation", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 238-248, 2007, doi:10.1109/FOCS.2007.61
109 ms
(Ver 3.1 (10032016))