Pages that link to "Item:Q3036697"
From MaRDI portal
The following pages link to Authenticated Algorithms for Byzantine Agreement (Q3036697):
Displaying 50 items.
- 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)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Byzantine Gathering in Networks with Authenticated Whiteboards (Q2980903) (← links)
- Structured Derivation of Semi-Synchronous Algorithms (Q3095340) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- The Firing Squad Problem Revisited. (Q3304114) (← links)
- Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- On the composition of authenticated Byzantine Agreement (Q3455220) (← links)
- PoW-Based Distributed Cryptography with No Trusted Setup (Q3457075) (← links)
- Reaching approximate agreement in the presence of faults (Q3763582) (← links)
- Message-optimal protocols for Byzantine Agreement (Q4031321) (← links)
- An algorithm for identification of maliciously faulty units (Q4323717) (← links)
- (Q4389722) (← links)
- (Q5090934) (← links)
- Time is not a healer (Q5096164) (← links)
- Unconditional Byzantine agreement for any number of faulty processors (Q5096793) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance (Q5170187) (← links)
- On Verifying Fault Tolerance of Distributed Protocols (Q5458335) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- (Q6083410) (← links)
- On the number of authenticated rounds in Byzantine Agreement (Q6084559) (← links)
- Gossiping for communication-efficient broadcast (Q6108990) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)
- Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures (Q6161036) (← links)
- Synchronization Modulo k in Dynamic Networks (Q6488455) (← links)
- Improved extension protocols for Byzantine broadcast and agreement (Q6535027) (← links)
- From partial to global asynchronous reliable broadcast (Q6535028) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
- Brief announcement: Multi-threshold asynchronous reliable broadcast and consensus (Q6535048) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6536327) (← links)
- Levels of authentication in distributed agreement (Q6570910) (← links)
- Byzantine generals in the permissionless setting (Q6573944) (← links)
- Player-replaceability and forensic support are two sides of the same (crypto) coin (Q6573949) (← links)
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! (Q6579852) (← links)
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case (Q6579853) (← links)
