### On the Round Complexity of Covert Computation

Vipul Goyal and Abhishek Jain

##### Abstract

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 steganographic) channel without knowing if the other parties are participating as well 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 (along with the fact that everyone participated). All covert computation protocols known so far require a large polynomial number of rounds. In this work, we first study the question of the round complexity of covert computation and obtain the following results: 1) There does not exist a constant round covert computation protocol with respect to black box simulation even for the case of two parties. (In comparison, such protocols are known even for the multi-party case if there is no covertness requirement.) 2) By relying on the two slot non-black-box simulation technique of Pass (STOC'04) and techniques from cryptography in NC^0 (Applebaum et al, FOCS'04), we obtain a construction of a constant round covert multi-party computation protocol. Put together, the above adds one more example to the growing list of tasks for which non-black-box simulation techniques (introduced in the work of Barak in FOCS'01) are necessary. Finally, we study the problem of covert multi-party computation in the setting where the parties only have point to point (covert) communication channels. We observe that our covert computation protocol for the broadcast channel inherits, from the protocol of Pass, the property of secure composition in the bounded concurrent setting. Then, as an application of this protocol, somewhat surprisingly we show the existence of covert multi-party computation with point to point channels (assuming that the number of parties is a constant).

Available format(s)
Publication info
Published elsewhere. To appear at STOC 2010. This is the full version.
Contact author(s)
abhishek @ cs ucla edu
History
2010-05-12: revised
See all versions
Short URL
https://ia.cr/2010/279

CC BY

BibTeX

@misc{cryptoeprint:2010/279,
author = {Vipul Goyal and Abhishek Jain},
title = {On the Round Complexity of Covert Computation},
howpublished = {Cryptology ePrint Archive, Paper 2010/279},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/279}},
url = {https://eprint.iacr.org/2010/279}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.