{"id":"https://openalex.org/W7128498693","doi":"https://doi.org/10.1007/s10207-026-01214-4","title":"Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol","display_name":"Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7128498693","doi":"https://doi.org/10.1007/s10207-026-01214-4"},"language":"en","primary_location":{"id":"doi:10.1007/s10207-026-01214-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10207-026-01214-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10207-026-01214-4.pdf","source":{"id":"https://openalex.org/S164062316","display_name":"International Journal of Information Security","issn_l":"1615-5262","issn":["1615-5262","1615-5270"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Security","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10207-026-01214-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099057003","display_name":"Nasit S Sony","orcid":null},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nasit S Sony","raw_affiliation_strings":["University of California, Merced, CA, 95340, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Merced, CA, 95340, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108940900","display_name":"Xianzhong Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xianzhong Ding","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, Berkeley, CA, 94720, USA"],"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, Berkeley, CA, 94720, USA","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5099057003"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":{"value":2590,"currency":"EUR","value_usd":3190},"apc_paid":{"value":2590,"currency":"EUR","value_usd":3190},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38905325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"2","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.9912999868392944,"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.9912999868392944,"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/T12112","display_name":"Ammonia Synthesis and Nitrogen Reduction","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1503","display_name":"Catalysis"},"field":{"id":"https://openalex.org/fields/15","display_name":"Chemical Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.0005000000237487257,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.8730000257492065},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.6762999892234802},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.588699996471405},{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.5394999980926514},{"id":"https://openalex.org/keywords/atomic-broadcast","display_name":"Atomic broadcast","score":0.5090000033378601},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.474700003862381},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47380000352859497},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.44279998540878296},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41600000858306885}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8730000257492065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8410000205039978},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.6762999892234802},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.588699996471405},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5694000124931335},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.5394999980926514},{"id":"https://openalex.org/C943373","wikidata":"https://www.wikidata.org/wiki/Q4817323","display_name":"Atomic broadcast","level":3,"score":0.5090000033378601},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.474700003862381},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47380000352859497},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3686999976634979},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C2775937380","wikidata":"https://www.wikidata.org/wiki/Q1232589","display_name":"Replica","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3447999954223633},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.3093000054359436},{"id":"https://openalex.org/C7923308","wikidata":"https://www.wikidata.org/wiki/Q4812211","display_name":"Asynchronous system","level":5,"score":0.29580000042915344},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C104562893","wikidata":"https://www.wikidata.org/wiki/Q47591","display_name":"Byzantine architecture","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10207-026-01214-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10207-026-01214-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10207-026-01214-4.pdf","source":{"id":"https://openalex.org/S164062316","display_name":"International Journal of Information Security","issn_l":"1615-5262","issn":["1615-5262","1615-5270"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Security","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10207-026-01214-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10207-026-01214-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10207-026-01214-4.pdf","source":{"id":"https://openalex.org/S164062316","display_name":"International Journal of Information Security","issn_l":"1615-5262","issn":["1615-5262","1615-5270"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Security","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338292","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7128498693.pdf"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1836078613","https://openalex.org/W1840851275","https://openalex.org/W1963710334","https://openalex.org/W2035362408","https://openalex.org/W2102764738","https://openalex.org/W2116643105","https://openalex.org/W2117362057","https://openalex.org/W2131848219","https://openalex.org/W2138775315","https://openalex.org/W2140036537","https://openalex.org/W2151413173","https://openalex.org/W2167882086","https://openalex.org/W2328007342","https://openalex.org/W2343310721","https://openalex.org/W2534313446","https://openalex.org/W2757041386","https://openalex.org/W2763398287","https://openalex.org/W2890933237","https://openalex.org/W2964159515","https://openalex.org/W2981692198","https://openalex.org/W3046502842","https://openalex.org/W3046841722","https://openalex.org/W3095928864","https://openalex.org/W3096691500","https://openalex.org/W3137092842","https://openalex.org/W3185672164","https://openalex.org/W4226245226","https://openalex.org/W4308643124","https://openalex.org/W4312724280","https://openalex.org/W4405993362","https://openalex.org/W4415591258"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Multi-valued":[1],"Byzantine":[2,142,206],"agreement":[3,50,96,143],"(MVBA)":[4],"protocols":[5,18,24],"are":[6],"critical":[7],"components":[8],"in":[9,19,31,51,69],"designing":[10],"atomic":[11],"broadcast":[12,164],"and":[13,35,57,138,170,208,236,275],"fault-tolerant":[14],"state":[15],"machine":[16],"replication":[17],"asynchronous":[20,70,140],"networks.":[21],"While":[22],"these":[23,172],"have":[25],"seen":[26],"significant":[27],"advancements,":[28],"challenges":[29],"remain":[30],"optimizing":[32],"their":[33,165],"communication":[34,58,237],"computation":[36,56],"efficiency":[37],"without":[38,53],"sacrificing":[39],"performance.":[40],"In":[41,146],"this":[42,147],"paper,":[43],"we":[44],"address":[45],"the":[46,139,175,265,271,283],"challenge":[47],"of":[48,65,76,122,153,216,221,239,267],"achieving":[49],"MVBA":[52],"incurring":[54],"extra":[55],"rounds.":[59],"Our":[60],"approach":[61],"leverages":[62],"an":[63,95,180,213],"analysis":[64],"message":[66,219],"distribution":[67],"patterns":[68],"networks,":[71],"observing":[72],"that":[73],"a":[74,127,134,149],"subset":[75,152],"$$f+1$$":[77,154],"<mml:math":[78,107,155,195,223,242,278],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[79,108,156,196,224,243,279],"<mml:mrow>":[80,109,157,197,225,244,247],"<mml:mi>f</mml:mi>":[81,113,158],"<mml:mo>+</mml:mo>":[82,114,159,250],"<mml:mn>1</mml:mn>":[83,115,160],"</mml:mrow>":[84,116,161,204,233,253,259],"</mml:math>":[85,117,162,205,234,260,281],"parties,":[86,104,268],"including":[87],"at":[88],"least":[89],"one":[90],"honest":[91],"party,":[92],"can":[93],"achieve":[94],"more":[97],"efficiently":[98],"than":[99],"relying":[100],"on":[101],"all":[102],"n":[103,263],"where":[105,262],"$$n=3f+1$$":[106],"<mml:mi>n</mml:mi>":[110,200,229,255],"<mml:mo>=</mml:mo>":[111],"<mml:mn>3</mml:mn>":[112,201],",":[118,235,261],"f":[119],"maximum":[120],"number":[121,266],"faulty":[123],"parties.":[124],"We":[125],"introduce":[126],"novel":[128],"protocol,":[129],"Prioritized-MVBA":[130],"(pMVBA),":[131],"which":[132],"integrates":[133],"committee-based":[135],"selection":[136],"process":[137],"binary":[141],"(ABBA)":[144],"protocol.":[145],"design,":[148],"randomly":[150],"selected":[151],"parties":[163],"requests,":[166],"collect":[167],"verifiable":[168],"proofs,":[169],"utilize":[171],"proofs":[173],"within":[174],"ABBA":[176],"framework":[177],"to":[178,188,190],"reach":[179],"agreement.":[181],"The":[182],"proposed":[183],"pMVBA":[184],"protocol":[185],"is":[186,264,270,282],"resilient":[187],"up":[189],"$$\\lfloor":[191],"\\frac{n}{3}":[192],"\\rfloor":[193],"$$":[194,277],"<mml:mo>\u230a</mml:mo>":[198],"<mml:mfrac>":[199],"</mml:mfrac>":[202],"<mml:mo>\u230b</mml:mo>":[203],"failures":[207],"achieves":[209],"optimal":[210],"performance,":[211],"with":[212],"expected":[214],"runtime":[215],"O":[217],"(1),":[218],"complexity":[220,238],"$$O(n^2)$$":[222],"<mml:mi>O</mml:mi>":[226,245],"<mml:mo>(</mml:mo>":[227,246,248],"<mml:msup>":[228,254],"<mml:mn>2</mml:mn>":[230,256],"</mml:msup>":[231,257],"<mml:mo>)</mml:mo>":[232,252,258],"$$O((l+\\lambda":[240],")n^2)$$":[241],"<mml:mi>l</mml:mi>":[249],"<mml:mi>\u03bb</mml:mi>":[251,280],"l":[269],"input":[272],"bit":[273],"length,":[274],"$$\\lambda":[276],"security":[284],"parameter.":[285]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2026-02-11T00:00:00"}