Pages that link to "Item:Q2501710"
From MaRDI portal
The following pages link to Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography (Q2501710):
Displaying 29 items.
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
- P systems and the Byzantine agreement (Q987968) (← links)
- Strong \((n, t, n)\) verifiable secret sharing scheme (Q991242) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Revising the Membrane Computing Model for Byzantine Agreement (Q2975922) (← links)
- Random oracles in constantipole (Q5176778) (← links)
- Distributed Computing (Q5395155) (← links)
- On Optimal Probabilistic Asynchronous Byzantine Agreement (Q5445740) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- (Q6083411) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Quantum detectable Byzantine agreement for distributed data trust management in blockchain (Q6124690) (← links)
- Expected linear round synchronization: the missing link for linear Byzantine SMR (Q6126136) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP (Q6535024) (← links)
- Expected linear round synchronization: the missing link for linear Byzantine SMR (Q6535025) (← links)
- The unique chain rule and its applications (Q6573946) (← links)
- Proof of availability and retrieval in a modular blockchain architecture (Q6573989) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Asymmetric distributed trust (Q6601210) (← links)
