Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
From MaRDI portal
Publication:6110376
DOI10.1007/s00145-023-09457-3zbMath1517.94053OpenAlexW4366815705MaRDI QIDQ6110376
Ashish Choudhury, Anirudh Chandramouli, Ananya Appan
Publication date: 5 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09457-3
unconditional securityverifiable secret sharingasynchronous MPCinformation checking protocolnon threshold adversaries
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Player simulation and general adversary structures in perfect multiparty computation
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Asynchronous Byzantine agreement with optimal resilience
- Asynchronous Secure Multiparty Computation in Constant Time
- Efficient General-Adversary Multi-Party Computation
- 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
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Foundations of Cryptography
- Universally Composable Synchronous Computation
- Universally Composable Security
- Fast asynchronous Byzantine agreement with optimal resilience
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
This page was built for publication: Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
