Round Efficient Unconditionally Secure Multiparty Computation Protocol.

In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel. Our protocol communicates ]> field elements per multiplication and requires ]> rounds, even if up to t players are under the control of an active adversary having unbounded computing power, where ]> denotes the multiplicative depth of the circuit representing the function to be computed securely. In the absence of a physical broadcast channel and with n > 2t players, the best known UMPC protocol with minimum number of rounds, requires ]> rounds and communicates ]> field elements per multiplication. On the other hand, the best known UMPC protocol with minimum communication complexity requires communication overhead of ]> field elements per multiplication, but has a round complexity of ]> rounds. Hence our UMPC protocol is the most round efficient protocol so far and ranks second according to communication complexity. [ABSTRACT FROM AUTHOR]