On the round complexity of randomized Byzantine agreement (Q2121502): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-022-09421-7 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4214936143 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.11329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Byzantine Agreement, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for asynchronous randomized consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized Consensus under a Weak Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for randomized synchronous consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine agreement in the full-information model in O(log n) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple constant-time consensus protocols in realistic failure models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination and Composability of Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient player-optimal protocols for strong and differential consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions with low average sensitivity depend on few coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial Byzantine agreement in <i>t</i> + 1 rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant Computation in the Full Information Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptively Secure Coin-Flipping, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Techniques for Noninteractive Zero-Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifiable Random Functions from Standard Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Expected Constant-Round Protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Byzantine agreement in polynomial expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of asynchronous agreement against powerful adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the composition of authenticated Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reverse hypercontractivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically increasing the fault-tolerance of distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thunderella: blockchains with optimistic instant confirmation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Byzantine agreement for any number of faulty processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the round complexity of randomized Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid consensus: efficient consensus in the permissionless model / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-022-09421-7 / rank
 
Normal rank

Latest revision as of 03:23, 17 December 2024

scientific article
Language Label Description Also known as
English
On the round complexity of randomized Byzantine agreement
scientific article

    Statements

    On the round complexity of randomized Byzantine agreement (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2022
    0 references
    Byzantine agreement
    0 references
    lower bound
    0 references
    round complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers