Optimal adaptively secure hash-based MVBA and asynchronous common subset
From MaRDI portal
Publication:7447161
Cites work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- All You Need is DAG
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Asynchronous Byzantine agreement with subquadratic communication
- Asynchronous MPC with a strict honest majority using non-equivocation
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
- Communication Complexity of Byzantine Agreement, Revisited
- Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited
- Efficient multiparty protocols using circuit randomization
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- Improved extension protocols for Byzantine broadcast and agreement
- Linear overhead optimally-resilient robust MPC using preprocessing
- On communication-efficient asynchronous MPC with adaptive security
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Scalable and Unconditionally Secure Multiparty Computation
- Secure and efficient asynchronous broadcast protocols. (Extended abstract)
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- SPHINCS: practical stateless hash-based signatures
- Threshold cryptosystems from threshold fully homomorphic encryption
- Universally composable security: a new paradigm for cryptographic protocols
- Vector commitments and their applications
This page was built for publication: \(\widetilde{\mathrm{O}}\)ptimal adaptively secure hash-based MVBA and asynchronous common subset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447161)