{"id":"https://openalex.org/W4200403450","doi":"https://doi.org/10.1109/roedunet54112.2021.9638279","title":"Optimal Byzantine Fault Tolerance Consensus Algorithm for permissioned systems","display_name":"Optimal Byzantine Fault Tolerance Consensus Algorithm for permissioned systems","publication_year":2021,"publication_date":"2021-11-04","ids":{"openalex":"https://openalex.org/W4200403450","doi":"https://doi.org/10.1109/roedunet54112.2021.9638279"},"language":"en","primary_location":{"id":"doi:10.1109/roedunet54112.2021.9638279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/roedunet54112.2021.9638279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 20th RoEduNet Conference: Networking in Education and Research (RoEduNet)","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/A5023001821","display_name":"Lenu\u021ba Alboaie","orcid":"https://orcid.org/0000-0003-0969-8102"},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Lenuta Alboaie","raw_affiliation_strings":["Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania","institution_ids":["https://openalex.org/I138164181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041213558","display_name":"S\u00eenic\u0103 Alboaie","orcid":"https://orcid.org/0000-0002-3096-5060"},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Sinica Alboaie","raw_affiliation_strings":["Axiologic Research SRL, Alexandru Ioan Cuza University, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Axiologic Research SRL, Alexandru Ioan Cuza University, Iasi, Romania","institution_ids":["https://openalex.org/I138164181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026475937","display_name":"Cristina Georgiana Calancea","orcid":"https://orcid.org/0000-0003-0592-2736"},"institutions":[{"id":"https://openalex.org/I138164181","display_name":"Alexandru Ioan Cuza University","ror":"https://ror.org/022kvet57","country_code":"RO","type":"education","lineage":["https://openalex.org/I138164181"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Cristina Georgiana Calancea","raw_affiliation_strings":["Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Alexandru Ioan Cuza University, Iasi, Romania","institution_ids":["https://openalex.org/I138164181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023001821"],"corresponding_institution_ids":["https://openalex.org/I138164181"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22848741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"6","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":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9776999950408936,"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/T11478","display_name":"Caching and Content Delivery","score":0.9435999989509583,"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-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.8865577578544617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.800573468208313},{"id":"https://openalex.org/keywords/asynchrony","display_name":"Asynchrony (computer programming)","score":0.6074248552322388},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5913160443305969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5645573139190674},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.48783472180366516},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4801556468009949},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4673747420310974},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.43780121207237244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33062082529067993},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2817063331604004}],"concepts":[{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.8865577578544617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.800573468208313},{"id":"https://openalex.org/C2779019669","wikidata":"https://www.wikidata.org/wiki/Q25203946","display_name":"Asynchrony (computer programming)","level":3,"score":0.6074248552322388},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5913160443305969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5645573139190674},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.48783472180366516},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4801556468009949},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4673747420310974},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.43780121207237244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33062082529067993},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2817063331604004},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/roedunet54112.2021.9638279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/roedunet54112.2021.9638279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 20th RoEduNet Conference: Networking in Education and Research (RoEduNet)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6800000071525574,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1601379374","https://openalex.org/W2003214215","https://openalex.org/W2126087831","https://openalex.org/W2135044397","https://openalex.org/W2769965994","https://openalex.org/W2914443561","https://openalex.org/W2994233011","https://openalex.org/W3040491562","https://openalex.org/W3137092842","https://openalex.org/W3162074700","https://openalex.org/W4248175462","https://openalex.org/W6745707141","https://openalex.org/W6759587416","https://openalex.org/W6772025062"],"related_works":["https://openalex.org/W1698117324","https://openalex.org/W2292106967","https://openalex.org/W4290996430","https://openalex.org/W4210453042","https://openalex.org/W2997526278","https://openalex.org/W2109232026","https://openalex.org/W2775054947","https://openalex.org/W2146384899","https://openalex.org/W2145120192","https://openalex.org/W4388748071"],"abstract_inverted_index":{"In":[0],"this":[1,68],"paper,":[2],"we":[3,132],"propose":[4],"the":[5,28,50,71,88,101,118,123,135,154],"\u201cOptimal":[6],"Byzantine":[7,18,139],"Fault":[8],"Tolerance\u201d":[9],"consensus":[10,51,82],"algorithm":[11,69,136],"for":[12,34,67,114,145],"permissioned":[13],"replicated":[14],"distributed":[15],"systems":[16],"with":[17,148],"fault":[19],"tolerance.":[20],"It":[21,53],"seems":[22],"to":[23,37,46,77,100],"achieve":[24],"total":[25,143],"fairness,":[26],"in":[27,49,95],"sense":[29],"that":[30],"it":[31],"is":[32,70],"impossible":[33],"an":[35],"attacker":[36],"manipulate":[38],"which":[39],"of":[40,90,103],"two":[41],"transactions":[42,94,155],"will":[43],"be":[44,47],"chosen":[45],"first":[48],"order.":[52],"has":[54],"asynchrony,":[55],"no":[56,58,62],"leaders,":[57],"round":[59],"robin":[60],"and":[61,74,117,141],"Proof-of-Work.":[63],"A":[64],"main":[65],"characteristic":[66],"digital":[72],"signatures":[73],"broadcast":[75],"usage":[76],"record":[78],"network":[79],"activity.":[80],"The":[81],"participants":[83],"inform":[84],"everyone":[85],"else":[86],"about":[87],"set":[89],"accepted":[91],"or":[92],"rejected":[93],"a":[96,142],"time":[97],"frame.":[98],"As":[99],"ordering":[102],"transactions,":[104,147],"three":[105],"mechanisms":[106],"have":[107],"been":[108],"proposed:":[109],"computer":[110],"clocks,":[111],"lexicographical":[112],"order":[113,120,144],"message":[115],"hashes":[116],"semantic":[119],"given":[121],"by":[122],"versioned":[124],"data,":[125],"manipulated":[126],"inside":[127],"transactions.":[128],"Considering":[129],"these":[130],"traits,":[131],"can":[133],"say":[134],"yields":[137],"fair":[138],"agreement":[140],"all":[146],"very":[149],"little":[150],"communication":[151],"overhead":[152],"beyond":[153],"themselves.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}