Corpus ID: 15340736

Efficient Asynchronous Multiparty Computation with Optimal Resilience

@article{Patra2008EfficientAM,
  title={Efficient Asynchronous Multiparty Computation with Optimal Resilience},
  author={Arpita Patra and Ashish Choudhury and C. Pandu Rangan},
  journal={IACR Cryptol. ePrint Arch.},
  year={2008},
  volume={2008},
  pages={425}
}
We propose an efficient information theoretic secure asynchronous multiparty computation (AMPC) protocol with optimal fault tolerance; i.e., with n = 3t + 1, where n is the total number of parties and t is the number of parties that can be under the influence of a Byzantine (active) adversary At having unbounded computing power. Our protocol communicates O(n5κ) bits per multiplication and involves a negligible error probability of 2−O(κ), where κ is the error parameter. As far as our knowledge… Expand
Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate
TLDR
A new Asynchronous secure multiparty computation (AMPC) protocol that provides information theoretic security with n = 4t + 1, where t out of n parties can be under the influence of a Byzantine (active) adversary at having unbounded computing power is proposed. Expand
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
TLDR
This paper presents an optimally resilient, perfectly secure Asynchronous VSS (AVSS) protocol that can generate d-sharing of a secret for any d, where t≤d≤2t, and proposes a new Optimally resilient Asynchronous Multiparty Computation (AMPC) Protocol that communicates bits per multiplication gate. Expand
Asynchronous Byzantine Agreement with Subquadratic Communication
TLDR
This work shows asynchronous BA protocols with (expected) subquadratic communication complexity tolerating an adaptive adversary who can corrupt f ≤ (1− )n/3 of the parties (for any > 0) and shows a secure-computation protocol in the same threat model that has o(n) communication when computing no-input functionalities with short output. Expand
Optimal Multi-Valued Asynchronous Broadcast and Asynchronous Byzantine Agreement
Asynchronous Broadcast (known as A-cast) and Asynchronous Byzantine Agreement (ABA) are the fundamental primitives used as a building block in many asynchronous distributed cryptographic tasks, suchExpand
Efficient Asynchronous Byzantine Agreement with Optimal Resilience
TLDR
A novel and simple asynchronous verifiable secret sharing (AVSS) protocol, which significantly improves the communication complexity of the only known AVSS protocol of [17] with n = 3t + 1. Expand

References

SHOWING 1-10 OF 52 REFERENCES
Simple and Efficient Perfectly-Secure Asynchronous MPC
TLDR
The proposed MPC protocol is the first protocol with perfect security against an active, adaptive adversary corrupting t < n/4 players, which is optimal, and is as efficient as the most efficient perfectly secure protocol for the synchronous model and the mostefficient asynchronous protocol with cryptographic security. Expand
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract)
TLDR
This work considers secure multi-party computation in the asynchronous model and presents an efficient protocol with optimal resilience, which requires access to an expensive broadcast primitive only ${\mathcal O(n)$ times — independently of the size c of the circuit. Expand
Asynchronous Multiparty Computation: Theory and Implementation
TLDR
An asynchronous protocol for general multiparty computation that is secure against an adaptive and active adversary corrupting less than n /3 players and allows automatic parallelization of primitive operations such as secure multiplications, without having to resort to complicated multithreading is proposed. Expand
Efficient Multi-party Computation with Dispute Control
TLDR
This work presents an active MPC protocol that provides optimal (t < n/2) security and communicates only O(n 2 ) field elements per multiplication, and is to be compared with the most efficient previously known protocol for the same model. Expand
Scalable and Unconditionally Secure Multiparty Computation
TLDR
These are the first unconditionally secure protocols where the part of the communication complexity that depends on the circuit size is linear in n and the protocol has so called everlasting security. Expand
Perfectly-Secure MPC with Linear Communication Complexity
TLDR
This protocol provides perfect security against an active, adaptive adversary corrupting t < n/3 players, which is optimal, and improves the efficiency of perfectly secure MPC protocols by a factor of Ω(n2). Expand
Asynchronous secure computations with optimal resilience (extended abstract)
TLDR
This work describes an ( [~1 – I)-resilient protocol that securely computes any function F, and introduces a new secret sharing scheme called Ultimate Secret Sharing that guarantees that all the honest players will obtain their share of the secret, and it enables the players to verify that the shares are genuine. Expand
Efficient Asynchronous Secure Multiparty Distributed Computation
This paper significantly improves the message complexity of perfect asynchronous secure computations among n players tolerating a computationally unbounded active adversary that corrupts up to t <Expand
Asynchronous Multi-Party Computation with Quadratic Communication
TLDR
An efficient protocol for secure multi-party computation in the asynchronous model with optimal resilience, based on a public-key encryption scheme with threshold decryption and employing several techniques, including circuit randomization due to Beaver, and an abstraction of certificates, which can be of independent interest. Expand
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
TLDR
The notion of relative resilience—a means to compare the security and fault-tolerance of one protocol with that of another in a formal manner—provides a key tool for understanding and proving protocol security. Expand
...
1
2
3
4
5
...