Results 1 
7 of
7
On 2Round Secure Multiparty Computation
 In Proc. Crypto ’02
, 2002
"... Abstract. Substantial efforts have been spent on characterizing the round complexity of various cryptographic tasks. In this work we study the round complexity of secure multiparty computation in the presence of an active (Byzantine) adversary, assuming the availability of secure pointtopoint chan ..."
Abstract

Cited by 36 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Substantial efforts have been spent on characterizing the round complexity of various cryptographic tasks. In this work we study the round complexity of secure multiparty computation in the presence of an active (Byzantine) adversary, assuming the availability of secure pointtopoint channels and a broadcast primitive. It was recently shown that in this setting three rounds are sufficient for arbitrary secure computation tasks, with a linear security threshold, and two rounds are sufficient for certain nontrivial tasks. This leaves open the question whether every function can be securely computed in two rounds. We show that the answer to this question is “no”: even some very simple functions do not admit secure 2round protocols (independently of their communication and time complexity) and thus 3 is the exact round complexity of general secure multiparty computation. Yet, we also present some positive results by identifying a useful class of functions which can be securely computed in two rounds. Our results apply both to the informationtheoretic and to the computational notions of security.
A.: Scalable Multiparty Computation with Nearly Optimal Work and Resilience (full version of this paper
"... Abstract. We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is also nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2 − ɛ) fraction of the players, for an arbitrary ɛ> 0. 1
NearLinear UnconditionallySecure Multiparty Computation with a Dishonest Minority
"... Abstract. Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as well as correctness of the output are guaranteed. Of special importance both in cryptography and in complexity t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as well as correctness of the output are guaranteed. Of special importance both in cryptography and in complexity theory is the setting of informationtheoretic MPC, where (dishonest) players are unbounded, and no cryptographic assumptions are used. In this setting, it was known since the 1980’s that an honest majority of players is both necessary and sufficient to achieve privacy and correctness. The main open question that was left in this area is to establish the exact communication complexity of MPC protocols that can tolerate malicious behavior of a minority of dishonest players. In all works, there was a large gap between the communication complexity of the best known protocols in the malicious setting and the “honestbutcurious ” setting, where players do not deviate from the protocol. In this paper, we show, for the first time, an MPC protocol that can tolerate dishonest minority of malicious players that matches the communication complexity of the best known MPC protocol in the honestbutcurious setting. More specifically, we present a new nplayer multiparty computation protocol that is secure against a computationallyunbounded active and malicious adversary that can adaptively corrupt up to a minority t < n/2 of the players. For polynomiallylarge binary circuits that are not too unshaped, our protocol
Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation
"... We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f that can be computed by a circuit with m gates, our algorithm requires each n+m player to ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f that can be computed by a circuit with m gates, our algorithm requires each n+m player to send a number of bits and perform an amount of computation that is Õ( n + √ n). This significantly improves over traditional algorithms, which require each player to both send a number of messages and perform computation that is Ω(nm). Contact: Varsha Dani,
Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary
"... We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous message passing communication model, but unlike most related work, we do not assume the existence of a broadcast channel. Our main result holds for the case where there are n players, of which a 1/3 − ɛ ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous message passing communication model, but unlike most related work, we do not assume the existence of a broadcast channel. Our main result holds for the case where there are n players, of which a 1/3 − ɛ fraction are controlled by an adversary, for ɛ any positive constant. We describe a SMPC algorithm for this model that requires each player to send Õ ( n+m n + √ n+m n) messages and perform Õ( n + √ n) computations to compute any function f, where m is the size of a circuit to compute f. We also consider a model where all players are selfish but rational. In this model, we describe a Nash equilibrium protocol that solve SMPC n+m n+m
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
, 2016
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Cryptographic Multiparty Computation
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.