{"id":"https://openalex.org/W7125594706","doi":"https://doi.org/10.1145/3774949.3774962","title":"Practical Byzantine consensus algorithm based on Kademlia algorithm","display_name":"Practical Byzantine consensus algorithm based on Kademlia algorithm","publication_year":2025,"publication_date":"2025-08-27","ids":{"openalex":"https://openalex.org/W7125594706","doi":"https://doi.org/10.1145/3774949.3774962"},"language":null,"primary_location":{"id":"doi:10.1145/3774949.3774962","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3774949.3774962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 9th International Conference on High Performance Compilation, Computing and Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5123767812","display_name":"Peng Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I174104030","display_name":"Taiyuan Normal University","ror":"https://ror.org/051k00p03","country_code":"CN","type":"education","lineage":["https://openalex.org/I174104030"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Zhao","raw_affiliation_strings":["School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"],"raw_orcid":"https://orcid.org/0009-0009-5271-8472","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China","institution_ids":["https://openalex.org/I174104030"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123740652","display_name":"Guanglei Qiang","orcid":null},"institutions":[{"id":"https://openalex.org/I174104030","display_name":"Taiyuan Normal University","ror":"https://ror.org/051k00p03","country_code":"CN","type":"education","lineage":["https://openalex.org/I174104030"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guanglei Qiang","raw_affiliation_strings":["School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"],"raw_orcid":"https://orcid.org/0009-0009-5693-2310","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China","institution_ids":["https://openalex.org/I174104030"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123743793","display_name":"Bo Lu","orcid":null},"institutions":[{"id":"https://openalex.org/I174104030","display_name":"Taiyuan Normal University","ror":"https://ror.org/051k00p03","country_code":"CN","type":"education","lineage":["https://openalex.org/I174104030"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Lu","raw_affiliation_strings":["School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"],"raw_orcid":"https://orcid.org/0009-0000-6650-5931","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China","institution_ids":["https://openalex.org/I174104030"]}]},{"author_position":"last","author":{"id":null,"display_name":"Fujiang Yuan","orcid":"https://orcid.org/0009-0009-6990-6701"},"institutions":[{"id":"https://openalex.org/I174104030","display_name":"Taiyuan Normal University","ror":"https://ror.org/051k00p03","country_code":"CN","type":"education","lineage":["https://openalex.org/I174104030"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fujiang Yuan","raw_affiliation_strings":["School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China"],"raw_orcid":"https://orcid.org/0009-0009-6990-6701","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Taiyuan Normal University, Taiyuan Normal University, Jinzhong, shanxi, China","institution_ids":["https://openalex.org/I174104030"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174104030"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"87","last_page":"96"},"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.19910000264644623,"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.19910000264644623,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.12559999525547028,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.06539999693632126,"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/scalability","display_name":"Scalability","score":0.7432000041007996},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.6725999712944031},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6172999739646912},{"id":"https://openalex.org/keywords/consensus-algorithm","display_name":"Consensus algorithm","score":0.58160001039505},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5559999942779541},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.4207000136375427},{"id":"https://openalex.org/keywords/uniform-consensus","display_name":"Uniform consensus","score":0.38119998574256897},{"id":"https://openalex.org/keywords/peer-to-peer","display_name":"Peer-to-peer","score":0.37130001187324524},{"id":"https://openalex.org/keywords/reputation","display_name":"Reputation","score":0.35179999470710754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7526000142097473},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7432000041007996},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.6725999712944031},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6172999739646912},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5989999771118164},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.58160001039505},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5559999942779541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5317999720573425},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.4207000136375427},{"id":"https://openalex.org/C80966040","wikidata":"https://www.wikidata.org/wiki/Q7885028","display_name":"Uniform consensus","level":4,"score":0.38119998574256897},{"id":"https://openalex.org/C534932454","wikidata":"https://www.wikidata.org/wiki/Q161410","display_name":"Peer-to-peer","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C48798503","wikidata":"https://www.wikidata.org/wiki/Q877546","display_name":"Reputation","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.3319000005722046},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.321399986743927},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.3199000060558319},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C175551986","wikidata":"https://www.wikidata.org/wiki/Q47089","display_name":"Fault (geology)","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.287200003862381},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C101780184","wikidata":"https://www.wikidata.org/wiki/Q840576","display_name":"Dissemination","level":2,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3774949.3774962","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3774949.3774962","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 9th International Conference on High Performance Compilation, Computing and Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","score":0.4773476719856262,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2114579022","https://openalex.org/W2155025530","https://openalex.org/W2760605238","https://openalex.org/W2921088707","https://openalex.org/W2936759722","https://openalex.org/W2963507231","https://openalex.org/W3003936169","https://openalex.org/W3108722340","https://openalex.org/W4210362383","https://openalex.org/W4214672453","https://openalex.org/W4366977140","https://openalex.org/W4385737807","https://openalex.org/W4408924948","https://openalex.org/W7102648384"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"improved":[4,132],"solution":[5],"(K-PBFT)":[6],"based":[7],"on":[8],"the":[9,18,34,39,78,95,103,111,116,121,135],"Kademlia":[10],"and":[11,23,82,140],"PBFT":[12,29,43,79,137],"consensus":[13,122,138],"algorithms,":[14],"aiming":[15],"to":[16,62],"solve":[17],"problems":[19],"of":[20,27,36,42,97,105],"poor":[21],"scalability":[22],"high":[24],"communication":[25,40],"overhead":[26],"traditional":[28,136],"in":[30,47,50],"large-scale":[31],"networks.":[32],"When":[33],"number":[35],"nodes":[37],"increases,":[38],"complexity":[41],"increases":[44],"quadratically,":[45],"resulting":[46],"a":[48,98],"decrease":[49],"efficiency.":[51],"To":[52],"address":[53],"this":[54],"problem,":[55],"K-PBFT":[56,128],"uses":[57],"Kademlia\u2019s":[58],"node":[59,64,87],"management":[60],"mechanism":[61,101],"optimize":[63],"division":[65],"by":[66],"selecting":[67],"subsets":[68],"through":[69],"random":[70],"functions.":[71],"It":[72],"ensures":[73],"that":[74,109,127],"each":[75],"subset":[76,84],"meets":[77],"operating":[80],"conditions":[81],"allows":[83],"overlap":[85],"or":[86],"omission,":[88],"thereby":[89],"improving":[90],"fault":[91,143],"tolerance.":[92,144],"In":[93],"addition,":[94],"introduction":[96],"reputation":[99,112],"points":[100],"simplifies":[102],"selection":[104],"primary":[106],"nodes.":[107],"Nodes":[108],"meet":[110],"standards":[113],"can":[114],"skip":[115],"submission":[117],"phase,":[118],"further":[119,131],"accelerating":[120],"speed.":[123],"Experimental":[124],"results":[125],"show":[126],"has":[129,141],"been":[130],"compared":[133],"with":[134],"algorithm":[139],"better":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-25T00:00:00"}