Results 1 
3 of
3
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,
LargeScale Secure Computation: Multiparty Computation for (Parallel) RAM Programs
"... Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and privately processing large data sets over multiple parties with parallel, distributed algorithms. More specifically, we demonstrate loadbalanced, statistically secure computation protocols for computi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and privately processing large data sets over multiple parties with parallel, distributed algorithms. More specifically, we demonstrate loadbalanced, statistically secure computation protocols for computing Parallel RAM (PRAM) programs, handling (1/3−) fraction malicious players, while preserving up to polylogarithmic factors the computation and memory complexities of the PRAM program, aside from a onetime execution of a broadcast protocol per party. Additionally, our protocol has polylog communication locality—that is, each of the n parties speaks only with polylog(n) other parties. 1
LargeScale Secure Computation
, 2014
"... We are interested in secure computation protocols in settings where the number of parties is huge and their data even larger. Assuming the existence of a singleuse broadcast channel (per player), we demonstrate statistically secure computation protocols for computing (multiple) arbitrary dynamic RA ..."
Abstract
 Add to MetaCart
(Show Context)
We are interested in secure computation protocols in settings where the number of parties is huge and their data even larger. Assuming the existence of a singleuse broadcast channel (per player), we demonstrate statistically secure computation protocols for computing (multiple) arbitrary dynamic RAM programs over parties ’ inputs, handling (1/3−) fraction static corruptions, while preserving up to polylogarithmic factors the computation and memory complexities of the RAM program. Additionally, our protocol is load balanced and has polylogarithmic communication locality.