Pages that link to "Item:Q5756649"
From MaRDI portal
The following pages link to On Expected Constant-Round Protocols for Byzantine Agreement (Q5756649):
Displaying 29 items.
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- How Byzantine is a send corruption? (Q2096642) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Instant block confirmation in the sleepy model (Q2147229) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Efficient Simultaneous Broadcast (Q5445453) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)
- Byzantine lattice agreement in synchronous message passing systems (Q6535031) (← links)
- Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
- Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults (Q6587961) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Early stopping for any number of corruptions (Q6637339) (← links)
- Closing the efficiency gap between synchronous and network-agnostic consensus (Q6637554) (← links)
- Round efficient Byzantine agreement from VDFs (Q6660385) (← links)
