{"id":"https://openalex.org/W4415367156","doi":"https://doi.org/10.1109/isit63088.2025.11195350","title":"Synchronous BFT Under an Information Theoretic Setting with Private Observations","display_name":"Synchronous BFT Under an Information Theoretic Setting with Private Observations","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367156","doi":"https://doi.org/10.1109/isit63088.2025.11195350"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195350","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5100361458","display_name":"Mo Li","orcid":"https://orcid.org/0000-0002-6047-9709"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mo Li","raw_affiliation_strings":["The Chinese University of Hong Kong,School of Science and Engineering,Shenzhen,China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,School of Science and Engineering,Shenzhen,China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028927392","display_name":"Yanyan Dong","orcid":"https://orcid.org/0000-0002-6161-3455"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanyan Dong","raw_affiliation_strings":["The Chinese University of Hong Kong,School of Science and Engineering,Shenzhen,China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,School of Science and Engineering,Shenzhen,China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076731706","display_name":"Ximing Fu","orcid":"https://orcid.org/0000-0001-7058-2091"},"institutions":[{"id":"https://openalex.org/I4210136793","display_name":"Peng Cheng Laboratory","ror":"https://ror.org/03qdqbt06","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210136793"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ximing Fu","raw_affiliation_strings":["Harbin Institute of Technology, Shenzhen and Peng Cheng Laboratory,School of Computer Science and Technology,Shenzhen,China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Shenzhen and Peng Cheng Laboratory,School of Computer Science and Technology,Shenzhen,China","institution_ids":["https://openalex.org/I4210136793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100361458"],"corresponding_institution_ids":["https://openalex.org/I4210116924"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2545344,"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":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12004","display_name":"Advanced Frequency and Time Standards","score":0.9210000038146973,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12004","display_name":"Advanced Frequency and Time Standards","score":0.9210000038146973,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.5659999847412109},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5554999709129333},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.527899980545044},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4722999930381775},{"id":"https://openalex.org/keywords/cryptographic-protocol","display_name":"Cryptographic protocol","score":0.4595000147819519},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4494999945163727},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.44029998779296875},{"id":"https://openalex.org/keywords/private-information-retrieval","display_name":"Private information retrieval","score":0.38769999146461487}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6363999843597412},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.5659999847412109},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5554999709129333},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4722999930381775},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.47029998898506165},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.4595000147819519},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3578000068664551},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.35760000348091125},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3456000089645386},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.33469998836517334},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.3239000141620636},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.319599986076355},{"id":"https://openalex.org/C80966040","wikidata":"https://www.wikidata.org/wiki/Q7885028","display_name":"Uniform consensus","level":4,"score":0.30230000615119934},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C53076038","wikidata":"https://www.wikidata.org/wiki/Q2915383","display_name":"Oblivious transfer","level":3,"score":0.2671000063419342},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.2655999958515167}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195350","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1487545695","https://openalex.org/W1506874911","https://openalex.org/W2003214215","https://openalex.org/W2114579022","https://openalex.org/W2126924915","https://openalex.org/W2131848219","https://openalex.org/W2794717484","https://openalex.org/W2895944784","https://openalex.org/W3015234426","https://openalex.org/W3108722340","https://openalex.org/W4232836212","https://openalex.org/W4384926196","https://openalex.org/W4407783231"],"related_works":[],"abstract_inverted_index":{"Byzantine":[0],"Fault":[1],"Tolerance":[2],"(BFT)":[3],"protocols":[4,17,218],"enable":[5],"reliable":[6],"consensus":[7,141,149,153,157,167,207,237],"in":[8],"distributed":[9],"systems,":[10],"even":[11],"with":[12,121,177],"malicious":[13,128,186],"nodes.":[14,103],"Synchronous":[15],"BFT":[16,71,109],"provide":[18],"the":[19,31,45,49,96,116,140,145,148,156,164,191,197,206,236,247],"strongest":[20],"fault":[21],"tolerance,":[22],"ensuring":[23],"security":[24],"as":[25,27,144],"long":[26],"more":[28],"than":[29,246],"half":[30],"nodes":[32,117,181,200],"are":[33],"honest,":[34],"leveraging":[35],"cryptographic":[36,52],"signatures":[37,53],"implemented":[38],"via":[39],"asymmetric":[40],"algorithms.":[41],"This":[42],"paper":[43],"studies":[44],"possibility":[46],"of":[47,87,94,132,147,159,166,169,196,215],"eliminating":[48],"reliance":[50],"on":[51,205,235],"and":[54,61,81,155,182],"trusted":[55],"third":[56],"parties":[57],"to":[58,101],"distribute":[59],"public":[60],"private":[62,85],"keys":[63],"for":[64,212],"synchronous":[65,70],"BFT.":[66],"We":[67,104],"formulated":[68],"a":[69,84,88,133,175,202,213,231],"problem":[72,107,162],"where":[73],"each":[74],"node":[75],"has":[76],"an":[77,160],"unbounded":[78],"computational":[79],"power":[80],"can":[82,242],"have":[83],"observation":[86],"random":[89,97],"variable.":[90],"The":[91,130],"joint":[92],"distribution":[93],"all":[95,102,170],"variables":[98],"is":[99,137,163,201,210,239],"known":[100],"call":[105],"this":[106],"Information-Theoretic":[108],"(IT-BFT).":[110],"To":[111],"maintain":[112],"liveness,":[113],"we":[114,188],"partition":[115],"into":[118],"two":[119],"layers,":[120],"Layer":[122,198],"1":[123,199],"containing":[124],"at":[125],"most":[126],"one":[127],"node.":[129],"performance":[131],"secure":[134,171,216],"IT-BFT":[135,161,172,217],"protocol":[136],"quantified":[138],"using":[139],"rate":[142,168],"defined":[143],"entropy":[146],"information":[150,195,250],"gained":[151],"per":[152],"round,":[154],"capacity":[158,238],"supermum":[165],"protocols.":[173],"For":[174],"system":[176],"<tex":[178,183,220,225],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[179,184,221,226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[180],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$f$</tex>":[185],"nodes,":[187],"show":[189],"that":[190],"G\u00e1cs-K\u00f6rner":[192],"(GK)":[193],"common":[194,249],"lower":[203,233],"bound":[204,234],"capacity,":[208],"which":[209,241],"tight":[211],"family":[214],"when":[219],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n=2":[222],"f+1$</tex>.":[223],"When":[224],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n":[227],"\\geq":[228],"2":[229],"f+2$</tex>,":[230],"better":[232],"obtained,":[240],"be":[243],"strictly":[244],"higher":[245],"GK":[248],"bound.":[251]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}