Network-agnostic multi-party computation revisited (extended abstract)
From MaRDI portal
Publication:6635768
DOI10.1007/978-3-031-57722-2_6MaRDI QIDQ6635768
Ashish Choudhury, Supreeth Varadarajan, Nidhish Bhimrajka
Publication date: 12 November 2024
verifiable secret sharingpublic key infrastructuremultiparty computationcryptographic securitynetwork-agnostic
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Efficient asynchronous verifiable secret sharing and 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
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Asynchronous Multi-Party Computation with Quadratic Communication
- 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
- Scalable Secure Multiparty Computation
- State machine replication under changing network conditions
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Network-agnostic security comes (almost) for free in DKG and MPC
- Optimal Synchronous Approximate Agreement with Asynchronous Fallback
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
- Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
- Network agnostic MPC with statistical security
Related Items (1)
This page was built for publication: Network-agnostic multi-party computation revisited (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635768)
