Distributed CONGEST Algorithms against Mobile Adversaries (Q6202259): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q130816785, #quickstatements; #temporary_batch_1733738269825
 
(3 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4380874726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information dissemination in distributed systems with faulty units / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to withstand mobile virus attacks, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly-Secure MPC with Linear Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal communication in networks with randomly distributed byzantine faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bound on mobile Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous byzantine agreement protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making Asynchronous Distributed Computations Robust to Channel Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular construction of a Byzantine agreement protocol with optimal message bit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for byzantine agreement without authentication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Space Localized Byzantine Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proactive Secret Sharing with a Dishonest Majority / 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: Q3666268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From partial consistency to global broadcast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eavesdropping games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Byzantine Agreement for <i>n</i> &gt; 3<i>t</i> Processors in <i>t</i> + 1 Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding for Interactive Communication: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Explicit Coding for Interactive Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Broadcast Revisited: Towards Universal Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adversarial Noise Threshold for Distributed Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling in cut, flow, and network design problems / 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: Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast in radio networks tolerating byzantine adversarial behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Byzantine Broadcast in Loosely Connected Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to withstand mobile virus attacks (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms Made Secure: A Graph Theoretic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Congestion Cycle Covers and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Distributed Computing Made (Nearly) Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly reliable and secure message transmission tolerating mobile adversary / 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: Reliable communication in networks with Byzantine link failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting with locally bounded byzantine faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coding theorem for distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Codes Over Certain Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time is not a healer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Proactive Perfectly Secure Message Transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Agreement / 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: Small cuts and connectivity certificates: a fault tolerant approach / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130816785 / rank
 
Normal rank

Latest revision as of 11:01, 9 December 2024

scientific article; zbMATH DE number 7824333
Language Label Description Also known as
English
Distributed CONGEST Algorithms against Mobile Adversaries
scientific article; zbMATH DE number 7824333

    Statements

    Distributed CONGEST Algorithms against Mobile Adversaries (English)
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    CONGEST
    0 references
    fault tolerance
    0 references
    interactive coding
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers