{"id":"https://openalex.org/W3174679476","doi":"https://doi.org/10.1109/iscc53001.2021.9631546","title":"An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication","display_name":"An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication","publication_year":2021,"publication_date":"2021-09-05","ids":{"openalex":"https://openalex.org/W3174679476","doi":"https://doi.org/10.1109/iscc53001.2021.9631546","mag":"3174679476"},"language":"en","primary_location":{"id":"doi:10.1109/iscc53001.2021.9631546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc53001.2021.9631546","pdf_url":null,"source":{"id":"https://openalex.org/S4363605778","display_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2106.14312","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027915780","display_name":"Matthew Ding","orcid":"https://orcid.org/0000-0001-7674-0548"},"institutions":[{"id":"https://openalex.org/I4210113610","display_name":"Westford Academy","ror":"https://ror.org/01wag9e37","country_code":"US","type":"education","lineage":["https://openalex.org/I4210113610"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Ding","raw_affiliation_strings":["MIT PRIMES, Westford Academy,Westford,USA","MIT PRIMES, Westford Academy, Westford, USA"],"affiliations":[{"raw_affiliation_string":"MIT PRIMES, Westford Academy,Westford,USA","institution_ids":["https://openalex.org/I4210113610"]},{"raw_affiliation_string":"MIT PRIMES, Westford Academy, Westford, USA","institution_ids":["https://openalex.org/I4210113610"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027915780"],"corresponding_institution_ids":["https://openalex.org/I4210113610"],"apc_list":null,"apc_paid":null,"fwci":0.3094,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.33778768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9821000099182129,"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/T10237","display_name":"Cryptography and Data Security","score":0.9768000245094299,"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/computer-science","display_name":"Computer science","score":0.7819277048110962},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.7324241995811462},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5675401091575623},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.550334095954895},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.5036763548851013},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49773743748664856},{"id":"https://openalex.org/keywords/hop","display_name":"Hop (telecommunications)","score":0.4613165557384491},{"id":"https://openalex.org/keywords/consensus-algorithm","display_name":"Consensus algorithm","score":0.45937833189964294},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.44992905855178833},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42883431911468506},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.3937806487083435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3863661289215088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33796870708465576}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7819277048110962},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.7324241995811462},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5675401091575623},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.550334095954895},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.5036763548851013},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49773743748664856},{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.4613165557384491},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.45937833189964294},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.44992905855178833},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42883431911468506},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.3937806487083435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3863661289215088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33796870708465576},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscc53001.2021.9631546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc53001.2021.9631546","pdf_url":null,"source":{"id":"https://openalex.org/S4363605778","display_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2106.14312","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.14312","pdf_url":"https://arxiv.org/pdf/2106.14312","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2106.14312","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2106.14312","pdf_url":"https://arxiv.org/pdf/2106.14312","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1876279668","https://openalex.org/W1946818232","https://openalex.org/W2025375132","https://openalex.org/W2032049676","https://openalex.org/W2034791526","https://openalex.org/W2035362408","https://openalex.org/W2050681016","https://openalex.org/W2100953052","https://openalex.org/W2120510885","https://openalex.org/W2126906505","https://openalex.org/W2145501337","https://openalex.org/W2151901719","https://openalex.org/W2559853601","https://openalex.org/W2593047802","https://openalex.org/W2969788501","https://openalex.org/W3009064483","https://openalex.org/W3031187036","https://openalex.org/W3031811086","https://openalex.org/W3080450532","https://openalex.org/W3092119772","https://openalex.org/W3137092842","https://openalex.org/W4230222559","https://openalex.org/W4301295444","https://openalex.org/W4310000758"],"related_works":["https://openalex.org/W4297802034","https://openalex.org/W2891414023","https://openalex.org/W2145120192","https://openalex.org/W4200103307","https://openalex.org/W4292223684","https://openalex.org/W2900842005","https://openalex.org/W4387914057","https://openalex.org/W3185922878","https://openalex.org/W4321603099","https://openalex.org/W2998562842"],"abstract_inverted_index":{"Iterative":[0],"Approximate":[1],"Byzantine":[2,27],"Consensus":[3],"(IABC)":[4],"is":[5],"a":[6,31,45],"fundamental":[7],"problem":[8],"of":[9,26,44,57,67],"fault-tolerant":[10],"distributed":[11],"computing":[12],"where":[13],"machines":[14],"seek":[15],"to":[16,20,71],"achieve":[17],"approximate":[18],"consensus":[19],"arbitrary":[21],"exactness":[22],"in":[23],"the":[24,42,62],"presence":[25],"failures.":[28],"We":[29],"present":[30],"novel":[32],"algorithm":[33],"for":[34],"this":[35],"problem,":[36],"named":[37],"Relay-IABC,":[38],"which":[39],"relies":[40],"on":[41],"usage":[43],"multi-hop":[46],"relayed":[47],"messaging":[48],"system":[49],"and":[50,59,97],"crytographically":[51],"secure":[52],"message":[53],"signatures.":[54],"The":[55],"use":[56],"signatures":[58],"relays":[60],"allows":[61],"strict":[63,90],"necessary":[64],"network":[65,91],"conditions":[66,92],"traditional":[68,85],"IABC":[69],"algorithms":[70,86],"be":[72],"circumvented.":[73],"In":[74],"addition,":[75],"we":[76],"show":[77],"evidence":[78],"that":[79],"Relay-IABC":[80],"achieves":[81],"faster":[82],"convergence":[83],"than":[84],"even":[87],"under":[88],"these":[89],"with":[93],"both":[94],"theoretical":[95],"analysis":[96],"experimental":[98],"results.":[99]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}