{"id":"https://openalex.org/W7167708708","doi":"https://doi.org/10.1145/3816782.3819206","title":"Towards Reliable Broadcast with Optimal Communication and Round Complexity","display_name":"Towards Reliable Broadcast with Optimal Communication and Round Complexity","publication_year":2026,"publication_date":"2026-07-06","ids":{"openalex":"https://openalex.org/W7167708708","doi":"https://doi.org/10.1145/3816782.3819206"},"language":null,"primary_location":{"id":"doi:10.1145/3816782.3819206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819206","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3816782.3819206","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071703563","display_name":"Thomas Locher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Locher","raw_affiliation_strings":["DFINITY, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0007-8846-0288","affiliations":[{"raw_affiliation_string":"DFINITY, Zurich, Switzerland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088669734","display_name":"Victor Shoup","orcid":"https://orcid.org/0009-0003-6996-5660"},"institutions":[{"id":"https://openalex.org/I4210110221","display_name":"Coalition Against Trafficking Women","ror":"https://ror.org/020qa8h77","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210110221"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Victor Shoup","raw_affiliation_strings":["Category Labs, New York, USA"],"raw_orcid":"https://orcid.org/0009-0003-6996-5660","affiliations":[{"raw_affiliation_string":"Category Labs, New York, USA","institution_ids":["https://openalex.org/I4210110221"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":"155","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.38420000672340393,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.38420000672340393,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.14110000431537628,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.10530000180006027,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.31700000166893005},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.30469998717308044},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.3041999936103821},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2953000068664551},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.27160000801086426}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.605400025844574},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.3041999936103821},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29829999804496765},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26820001006126404},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3816782.3819206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819206","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3816782.3819206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3816782.3819206","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1598291964","https://openalex.org/W1610688607","https://openalex.org/W1988655303","https://openalex.org/W2034838776","https://openalex.org/W2519202371","https://openalex.org/W2528438932","https://openalex.org/W2534313446","https://openalex.org/W2811448169","https://openalex.org/W3177492523","https://openalex.org/W3183732253","https://openalex.org/W3185672164","https://openalex.org/W4220853208","https://openalex.org/W4399395199","https://openalex.org/W4409851605"],"related_works":[],"abstract_inverted_index":{"The":[0,138,165],"reliable":[1,71],"broadcast":[2,25,72],"protocol":[3,17,64,73,101,116,144,171],"with":[4,108],"the":[5,15,39,47,58,62,79,95,142,150,169,177,185],"best":[6],"communication":[7,34,75,96,139,158,166,186],"complexity":[8,35,49,76,88,97,140,159,167],"for":[9],"long":[10],"messages":[11],"to":[12,29,162],"date":[13],"is":[14,44,52,55,77,89,102,145,172,187],"MiniCast":[16,32,51],"of":[18,42,50,61,65,83,98,141,168],"Locher":[19],"&":[20],"Shoup":[21],"(2024).":[22],"To":[23],"reliably":[24],"a":[26,69],"message":[27],"m":[28,43],"n":[30],"parties,":[31],"has":[33],"~":[36,147,163,173],"1.5|m|n":[37],"when":[38],"size":[40],"|m|":[41],"large.":[45],"However,":[46],"round":[48,87],"4,":[53],"which":[54,155],"worse":[56],"than":[57,124],"3":[59],"rounds":[60],"classical":[63],"Bracha.":[66],"We":[67,127],"give":[68,129],"new":[70,100,115,131],"whose":[74,86],"essentially":[78,103],"same":[80],"as":[81],"that":[82,134],"MiniCast,":[84,113],"but":[85,180],"just":[90],"3.":[91],"For":[92],"large":[93],"|m|,":[94],"our":[99,114,182],"optimal":[104],"(for":[105],"3-round":[106],"protocols":[107,133],"somewhat":[109],"balanced":[110],"communication).":[111],"Like":[112],"does":[117],"not":[118],"rely":[119,135],"on":[120,136],"any":[121],"cryptography":[122],"other":[123,183],"hash":[125],"functions.":[126],"also":[128,146],"two":[130],"2-round":[132],"signatures.":[137],"first":[143],"1.5|m|n,":[148,174],"unless":[149],"sender":[151],"provably":[152],"misbehaves,":[153],"in":[154,176],"case":[156],"its":[157],"may":[160],"degrade":[161],"2|m|n.":[164],"second":[170],"even":[175],"worst":[178],"case,":[179],"(unlike":[181],"protocols)":[184],"unbalanced.":[188]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-07-09T00:00:00"}