2 research outputs found
Round Efficient Unconditionally Secure Multiparty Computation Protocol
In this paper, we propose a round efficient {\it unconditionally secure multiparty computation} (UMPC)
protocol in {\it information theoretic} model with players, in the absence of any physical broadcast channel,
which communicates field elements per multiplication
and requires rounds, even if up to players
are under the control of an active adversary having {\it unbounded computing power}. In the absence of a physical broadcast channel
and with players, the best known UMPC protocol with minimum number of rounds,
requires rounds and
communicates field elements per multiplication, where denotes
the multiplicative depth of the circuit representing the function to be computed securely.
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.
To design our protocol, we use certain new techniques which are of independent interest