Pages that link to "Item:Q3036697"
From MaRDI portal
The following pages link to Authenticated Algorithms for Byzantine Agreement (Q3036697):
Displaying 50 items.
- Agreement under faulty interfaces (Q293206) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- Simultaneity is harder than agreement (Q757014) (← links)
- Knowledge and common knowledge in a Byzantine environment: Crash failures (Q918186) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- On the possibility and impossibility of achieving clock synchronization (Q1077930) (← links)
- Stopping times of distributed consensus protocols: a probabilistic analysis (Q1089784) (← links)
- A new look at fault-tolerant network routing (Q1099603) (← links)
- Reliable broadcasts and communication models: tradeoffs and lower bounds (Q1112599) (← links)
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement (Q1187030) (← links)
- On the message complexity of binary Byzantine agreement under crash failures (Q1189856) (← links)
- Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs (Q1199456) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Diffusion without false rumors: On propagating updates in a Byzantine environment. (Q1874396) (← links)
- A simple Byzantine generals protocol (Q2015794) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- How Byzantine is a send corruption? (Q2096642) (← links)
- Order-fairness for Byzantine consensus (Q2102076) (← links)
- The fault-tolerant cluster-sending problem (Q2103916) (← links)
- Practical quantum Byzantine protocol via nearly optimal entanglement resources (Q2105946) (← links)
- Quantum Byzantine agreement for any number of dishonest parties (Q2107116) (← links)
- Synchronization modulo \(P\) in dynamic networks (Q2110375) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of randomized Byzantine agreement (Q2121502) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
- Round-optimal Byzantine agreement (Q2169994) (← links)
- Synchronous consensus with optimal asynchronous fallback guarantees (Q2175907) (← links)
- Optimistically tuning synchronous Byzantine consensus: another win for null messages (Q2241306) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← links)
- Authenticated broadcast with a partially compromised public-key infrastructure (Q2637312) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
