{"id":"https://openalex.org/W2901999914","doi":"https://doi.org/10.1109/nca.2018.8548163","title":"A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary","display_name":"A Formal Treatment of Efficient Byzantine Routing Against Fully Byzantine Adversary","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2901999914","doi":"https://doi.org/10.1109/nca.2018.8548163","mag":"2901999914"},"language":"en","primary_location":{"id":"doi:10.1109/nca.2018.8548163","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2018.8548163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008781968","display_name":"Siddhant Goenka","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Siddhant Goenka","raw_affiliation_strings":["UMBC"],"affiliations":[{"raw_affiliation_string":"UMBC","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039007125","display_name":"Sisi Duan","orcid":"https://orcid.org/0000-0002-1385-6807"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sisi Duan","raw_affiliation_strings":["UMBC"],"affiliations":[{"raw_affiliation_string":"UMBC","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100356583","display_name":"Haibin Zhang","orcid":"https://orcid.org/0000-0002-0080-6341"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haibin Zhang","raw_affiliation_strings":["UMBC"],"affiliations":[{"raw_affiliation_string":"UMBC","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008781968"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16192591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9983000159263611,"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.9983000159263611,"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.9980999827384949,"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"}},{"id":"https://openalex.org/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9866999983787537,"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/byzantine-architecture","display_name":"Byzantine architecture","score":0.7873960733413696},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7764120697975159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7737851142883301},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.7311386466026306},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.594836950302124},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.586127758026123},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4857650101184845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4322253465652466},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4085327684879303},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36402392387390137},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33622249960899353},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.3017730414867401},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12838086485862732},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.05763399600982666}],"concepts":[{"id":"https://openalex.org/C104562893","wikidata":"https://www.wikidata.org/wiki/Q47591","display_name":"Byzantine architecture","level":2,"score":0.7873960733413696},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7764120697975159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7737851142883301},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.7311386466026306},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.594836950302124},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.586127758026123},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4857650101184845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4322253465652466},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4085327684879303},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36402392387390137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33622249960899353},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3017730414867401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12838086485862732},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.05763399600982666},{"id":"https://openalex.org/C195244886","wikidata":"https://www.wikidata.org/wiki/Q41493","display_name":"Ancient history","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nca.2018.8548163","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2018.8548163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1497177773","https://openalex.org/W1551814240","https://openalex.org/W1807098818","https://openalex.org/W1965159636","https://openalex.org/W1975209676","https://openalex.org/W1982488304","https://openalex.org/W1986507065","https://openalex.org/W2003214215","https://openalex.org/W2003590000","https://openalex.org/W2005416464","https://openalex.org/W2014772227","https://openalex.org/W2023272701","https://openalex.org/W2024870556","https://openalex.org/W2029936518","https://openalex.org/W2038467333","https://openalex.org/W2053142757","https://openalex.org/W2067186740","https://openalex.org/W2067514565","https://openalex.org/W2072463110","https://openalex.org/W2088844348","https://openalex.org/W2097067636","https://openalex.org/W2097830365","https://openalex.org/W2098764857","https://openalex.org/W2104069294","https://openalex.org/W2107238520","https://openalex.org/W2107288276","https://openalex.org/W2110880385","https://openalex.org/W2114579022","https://openalex.org/W2122464312","https://openalex.org/W2123527797","https://openalex.org/W2129909248","https://openalex.org/W2131300413","https://openalex.org/W2135057483","https://openalex.org/W2136179057","https://openalex.org/W2138045532","https://openalex.org/W2145752233","https://openalex.org/W2150519657","https://openalex.org/W2153349112","https://openalex.org/W2153724511","https://openalex.org/W2158626053","https://openalex.org/W2160966042","https://openalex.org/W2169107844","https://openalex.org/W2169856608","https://openalex.org/W2170599464","https://openalex.org/W2513460136","https://openalex.org/W3023704438","https://openalex.org/W3112127769","https://openalex.org/W3137092842","https://openalex.org/W4234335113","https://openalex.org/W4302094287","https://openalex.org/W6632960668","https://openalex.org/W6638564739","https://openalex.org/W6654014462","https://openalex.org/W6679265533","https://openalex.org/W6862240463"],"related_works":["https://openalex.org/W1698117324","https://openalex.org/W2292106967","https://openalex.org/W4290996430","https://openalex.org/W2109232026","https://openalex.org/W4210453042","https://openalex.org/W2997526278","https://openalex.org/W2775054947","https://openalex.org/W2146384899","https://openalex.org/W603186994","https://openalex.org/W2126087831"],"abstract_inverted_index":{"We":[0,31,51],"describe":[1],"efficient":[2,65],"path-based":[3],"Byzantine":[4,12,29],"routing":[5],"protocols":[6,40,56,62,74],"that":[7,60,81],"are":[8,63],"secure":[9,68],"against":[10,69],"fully":[11],"adversaries.":[13],"Our":[14],"work":[15],"is":[16,45],"in":[17],"sharp":[18],"contrast":[19],"to":[20,42],"prior":[21],"works":[22],"which":[23],"handle":[24],"a":[25,33],"weaker":[26,70],"subset":[27],"of":[28,36,38,48],"attacks.":[30],"provide":[32],"formal":[34],"proof":[35],"correctness":[37],"our":[39,43,55,61,73],"which,":[41],"knowledge,":[44],"the":[46],"first":[47],"its":[49],"kind.":[50],"implement":[52],"and":[53,72,77],"evaluate":[54],"using":[57],"DeterLab,":[58],"demonstrating":[59],"as":[64,66],"those":[67],"adversaries":[71],"can":[75],"efficiently":[76],"correctly":[78],"detect":[79],"routers":[80],"fail":[82],"arbitrarily.":[83]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}