{"id":"https://openalex.org/W7160925543","doi":"https://doi.org/10.48550/arxiv.2605.10372","title":"Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience","display_name":"Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160925543","doi":"https://doi.org/10.48550/arxiv.2605.10372"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10372","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.10372","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114245476","display_name":"Michael Yiqing Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Michael Yiqing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108339282","display_name":"Anlu Yan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan, Alvin Hong Yao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135958806","display_name":"Jialin Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jialin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5210000276565552,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5210000276565552,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22750000655651093,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.10100000351667404,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.8055999875068665},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5952000021934509},{"id":"https://openalex.org/keywords/resilience","display_name":"Resilience (materials science)","score":0.531499981880188},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5033000111579895},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.45910000801086426},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.453900009393692},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.42340001463890076},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41819998621940613}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8055999875068665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7861999869346619},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5952000021934509},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5789999961853027},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.531499981880188},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5033000111579895},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.49880000948905945},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.45910000801086426},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.453900009393692},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.42340001463890076},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41819998621940613},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.41280001401901245},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C943373","wikidata":"https://www.wikidata.org/wiki/Q4817323","display_name":"Atomic broadcast","level":3,"score":0.37950000166893005},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C83529365","wikidata":"https://www.wikidata.org/wiki/Q4972103","display_name":"Broadcast communication network","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C7923308","wikidata":"https://www.wikidata.org/wiki/Q4812211","display_name":"Asynchronous system","level":5,"score":0.35740000009536743},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.32839998602867126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3271999955177307},{"id":"https://openalex.org/C510870077","wikidata":"https://www.wikidata.org/wiki/Q7444868","display_name":"Secure communication","level":3,"score":0.2962000072002411},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.27000001072883606}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10372","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.10372","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Byzantine":[0],"Reliable":[1],"Broadcast":[2],"(BRB)":[3],"is":[4],"a":[5,47,85,130],"fundamental":[6],"primitive":[7],"in":[8,71,129],"distributed":[9],"computing":[10],"and":[11,96,107],"cryptographic":[12],"systems;":[13],"reducing":[14],"the":[15,34,72],"communication":[16,99],"cost":[17],"of":[18,74],"BRB":[19,88,122],"thus":[20],"remains":[21],"an":[22,103,119],"important":[23],"research":[24],"direction.":[25],"However,":[26,59],"most":[27],"existing":[28],"works":[29],"either":[30],"focus":[31],"strictly":[32],"on":[33],"synchronous":[35],"network":[36],"model":[37],"or":[38],"utilize":[39,110],"computationally":[40,111],"impractical":[41],"erasure":[42],"codes.":[43],"Therefore,":[44],"to":[45],"achieve":[46,92],"practical":[48],"yet":[49],"network-robust":[50],"algorithm,":[51],"one":[52],"must":[53],"turn":[54],"toward":[55],"committee":[56],"sampling":[57,61],"techniques.":[58],"Committee":[60],"techniques":[62],"often":[63],"forgo":[64],"optimal":[65,94,98],"resilience":[66,95],"($f":[67],"<":[68],"\\lfloor\\frac{n}{3}":[69],"\\rfloor$)":[70],"face":[73],"asynchrony.":[75],"This":[76],"work":[77],"produces":[78],"two":[79],"interesting":[80],"results:":[81],"Firstly,":[82],"we":[83,116],"propose":[84],"\\textit{randomly":[86],"asynchronous}":[87,132],"protocol":[89,123],"that":[90,118],"can":[91],"both":[93],"asymptotically":[97],"complexity":[100],"($O(n|m|)$)":[101],"through":[102],"underutilized":[104],"technique:":[105],"\\textit{amortization};":[106],"does":[108],"not":[109],"expensive":[112],"\\textit{erasure":[113],"codes}.":[114],"Next,":[115],"show":[117],"optimally":[120],"resilient":[121],"utilizing":[124],"sampled":[125],"committees":[126],"cannot":[127],"exist":[128],"\\textit{fully":[131],"network.":[133]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}