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 single-use 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 corrup-tions, 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
Graduation date: 2016Secure multi-party computation (MPC) is a conceptual framework in cryptography....
We construct a multiparty computation (MPC) protocol that is secure even if a malicious adversary, i...
We consider a collection of related multiparty computation protocols that provide core operations fo...
Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and pr...
Abstract. Secure computation consists of protocols for secure arith-metic: secret values are added a...
We present the first general protocol for secure multiparty computation in which the total amount of...
We devise multi-party computation protocols for general secure function evaluation with the property...
We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous me...
Secure multiparty computation (SMC) allows a set of parties to jointly compute a function on private...
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a ...
Abstract. We study the following two related questions: – What are the minimal computational resourc...
Secure multiparty computation is a basic concept of growing interest in modern cryptography. It allo...
Secure computation allows mutually distrusting parties to compute over private data. Such collaborat...
Secure computation enables a set of mutually distrustful parties to collaboratively compute a public...
There has been a tremendous growth in the size of distributed systems in the past three decades. Tod...
Graduation date: 2016Secure multi-party computation (MPC) is a conceptual framework in cryptography....
We construct a multiparty computation (MPC) protocol that is secure even if a malicious adversary, i...
We consider a collection of related multiparty computation protocols that provide core operations fo...
Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and pr...
Abstract. Secure computation consists of protocols for secure arith-metic: secret values are added a...
We present the first general protocol for secure multiparty computation in which the total amount of...
We devise multi-party computation protocols for general secure function evaluation with the property...
We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous me...
Secure multiparty computation (SMC) allows a set of parties to jointly compute a function on private...
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a ...
Abstract. We study the following two related questions: – What are the minimal computational resourc...
Secure multiparty computation is a basic concept of growing interest in modern cryptography. It allo...
Secure computation allows mutually distrusting parties to compute over private data. Such collaborat...
Secure computation enables a set of mutually distrustful parties to collaboratively compute a public...
There has been a tremendous growth in the size of distributed systems in the past three decades. Tod...
Graduation date: 2016Secure multi-party computation (MPC) is a conceptual framework in cryptography....
We construct a multiparty computation (MPC) protocol that is secure even if a malicious adversary, i...
We consider a collection of related multiparty computation protocols that provide core operations fo...