On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
DOI10.1007/S00145-023-09451-9OpenAlexW4360983526MaRDI QIDQ2697681
Ashish Choudhury, Arpita Patra
Publication date: 13 April 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09451-9
communication complexityasynchronous networkverifiable secret sharingsecure multiparty computationUC securityunbounded adversary
Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Guaranteed output delivery comes free in honest majority MPC
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous constructive cryptography
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- Asynchronous Byzantine agreement with optimal resilience
- Communication-efficient unconditional MPC with guaranteed output delivery
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On communication-efficient asynchronous MPC with adaptive security
- Asynchronous Secure Multiparty Computation in Constant Time
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Information-theoretically secure protocols and security under composition
- An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- How to share a secret
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous Multi-Party Computation with Quadratic Communication
- Scalable and Unconditionally Secure Multiparty Computation
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Foundations of Cryptography
- Universally Composable Synchronous Computation
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
- Universally Composable Security
- The Power of Shunning
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computations with optimal resilience (extended abstract)
- On the Power of Hybrid Networks in Multi-Party Computation
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Perfectly-Secure MPC with Linear Communication Complexity
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Theory of Cryptography
This page was built for publication: On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
