Network agnostic MPC with statistical security
From MaRDI portal
Publication:6582167
DOI10.1007/978-3-031-48618-0_3zbMATH Open1544.94218MaRDI QIDQ6582167
Ashish Choudhury, Ananya Appan
Publication date: 2 August 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Player simulation and general adversary structures in perfect multiparty computation
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Synchronous consensus with optimal asynchronous fallback guarantees
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Efficient General-Adversary Multi-Party Computation
- Authenticated Algorithms for Byzantine Agreement
- Reaching Agreement in the Presence of Faults
- Perfectly secure message transmission
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Optimal Synchronous Approximate Agreement with Asynchronous Fallback
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
Related Items (1)
This page was built for publication: Network agnostic MPC with statistical security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582167)
