<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-03T00:29:26Z</responseDate>
  <request identifier="13107" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:13107</identifier>
        <datestamp>2024-03-06T10:51:35Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>From Partial to Global Asynchronous Reliable Broadcast</dc:title>
          <dc:creator>Ghinea, Diana</dc:creator>
          <dc:creator>Hirt, Martin</dc:creator>
          <dc:creator>Liu-Zhang, Chen-Da</dc:creator>
          <dc:subject>asynchronous broadcast</dc:subject>
          <dc:subject>partial broadcast</dc:subject>
          <dc:description>Broadcast is a fundamental primitive in distributed computing. It allows a sender to consistently distribute a message among n recipients. The seminal result of Pease et al. [JACM'80] shows that in a complete network of synchronous bilateral channels, broadcast is achievable if and only if the number of corruptions is bounded by t &lt; n/3. To overcome this bound, a fascinating line of works, Fitzi and Maurer [STOC'00], Considine et al. [JC'05], and Raykov [ICALP'15], proposed strengthening the communication network by assuming partial synchronous broadcast channels, which guarantee consistency among a subset of recipients.&#13;
We extend this line of research to the asynchronous setting. We consider reliable broadcast protocols assuming a communication network which provides each subset of b parties with reliable broadcast channels. A natural question is to investigate the trade-off between the size b and the corruption threshold t. We answer this question by showing feasibility and impossibility results:  &#13;
- A reliable broadcast protocol Π_{RBC} that:  &#13;
- For 3 ≤ b ≤ 4, is secure up to t &lt; n/2 corruptions. &#13;
- For b &gt; 4 even, is secure up to t &lt; ((b-4)/(b-2) n + 8/(b-2)) corruptions. &#13;
- For b &gt; 4 odd, is secure up to t &lt; ((b-3)/(b-1) n + 6/(b-1)) corruptions.  &#13;
- A nonstop reliable broadcast Π_{nRBC}, where parties are guaranteed to obtain output as in reliable broadcast but may need to run forever, secure up to t &lt; (b-1)/(b+1) n corruptions. &#13;
- There is no protocol for (nonstop) reliable broadcast secure up to t ≥ (b-1)/(b+1) n corruptions, implying that Π_{RBC} is an asymptotically optimal reliable broadcast protocol, and Π_{nRBC} is an optimal nonstop reliable broadcast protocol.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Diana Ghinea and Martin Hirt and Chen-Da Liu-Zhang</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.DISC.2020.29</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-131074</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.29</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
