Towards achieving asynchronous MPC with linear communication and optimal resilience
From MaRDI portal
Publication:6653027
DOI10.1007/978-3-031-68397-8_6MaRDI QIDQ6653027
Chen-Da Liu-Zhang, Vipul Goyal, Yifan Song
Publication date: 13 December 2024
Cryptography (94A60) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security and composition of multiparty cryptographic protocols
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Asynchronous Byzantine agreement with subquadratic communication
- Guaranteed output delivery comes free in honest majority MPC
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Communication-efficient unconditional MPC with guaranteed output delivery
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On communication-efficient asynchronous MPC with adaptive security
- Asynchronous Secure Multiparty Computation in Constant Time
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- How to share a secret
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
- Asynchronous Multi-Party Computation with Quadratic Communication
- Scalable and Unconditionally Secure Multiparty Computation
- Impossibility of distributed consensus with one faulty process
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Perfectly-Secure MPC with Linear Communication Complexity
- Robust Multiparty Computation with Linear Communication Complexity
- Scalable Secure Multiparty Computation
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Theory of Cryptography
- Le Mans: dynamic and fluid MPC for dishonest majority
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Asymptotically free broadcast in constant expected time via packed VSS
- Network-agnostic security comes (almost) for free in DKG and MPC
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Network-agnostic multi-party computation revisited (extended abstract)
- Perfect asynchronous MPC with linear communication overhead
- Linear-communication asynchronous complete secret sharing with optimal resilience
Related Items (1)
This page was built for publication: Towards achieving asynchronous MPC with linear communication and optimal resilience
