Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
From MaRDI portal
Recommendations
Cited in
(33)- Synchronous consensus with optimal asynchronous fallback guarantees
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- P systems and the Byzantine agreement
- Proof of availability and retrieval in a modular blockchain architecture
- The unique chain rule and its applications
- Dynamic-FROST: Schnorr threshold signatures with a flexible committee
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Distributed Computing
- Adaptively secure distributed PRFs from LWE
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Revising the membrane computing model for Byzantine agreement
- Asymmetric distributed trust
- Random oracles in constantipole
- Byzantine agreement with optimal resilience via statistical fraud detection
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- scientific article; zbMATH DE number 7774290 (Why is no real title available?)
- On expected constant-round protocols for Byzantine agreement
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
- Round-optimal Byzantine agreement
- scientific article; zbMATH DE number 1973984 (Why is no real title available?)
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Strong \((n, t, n)\) verifiable secret sharing scheme
- Randomization can be a healer: consensus with dynamic omission failures
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- Constant-round asynchronous multi-party computation based on one-way functions
- Quantum detectable Byzantine agreement for distributed data trust management in blockchain
This page was built for publication: Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501710)
