{"id":"https://openalex.org/W7165117854","doi":"https://doi.org/10.48550/arxiv.2606.19129","title":"Giskard : Byzantine Robust and Confidential Aggregation for Large-Scale Decentralized Learning","display_name":"Giskard : Byzantine Robust and Confidential Aggregation for Large-Scale Decentralized Learning","publication_year":2026,"publication_date":"2026-06-17","ids":{"openalex":"https://openalex.org/W7165117854","doi":"https://doi.org/10.48550/arxiv.2606.19129"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05663243v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05663243","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05663243","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067581356","display_name":"Ousmane Touat","orcid":"https://orcid.org/0000-0002-3307-2110"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Touat, Ousmane","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085459670","display_name":"C\u00e9sar Sabater","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sabater, C\u00e9sar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049210535","display_name":"Mohamed Maouche","orcid":"https://orcid.org/0000-0001-6473-7173"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maouche, Mohamed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018656827","display_name":"Sonia Ben Mokhtar","orcid":"https://orcid.org/0000-0003-2821-7714"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mokhtar, Sonia Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.8066999912261963,"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"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.8066999912261963,"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/T10237","display_name":"Cryptography and Data Security","score":0.1589999943971634,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.015599999576807022,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/delegate","display_name":"Delegate","score":0.7156999707221985},{"id":"https://openalex.org/keywords/confidentiality","display_name":"Confidentiality","score":0.6155999898910522},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.5246000289916992},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.4790000021457672},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.43880000710487366},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.38989999890327454},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3864000141620636},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3650999963283539}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7343000173568726},{"id":"https://openalex.org/C143273055","wikidata":"https://www.wikidata.org/wiki/Q2382794","display_name":"Delegate","level":2,"score":0.7156999707221985},{"id":"https://openalex.org/C71745522","wikidata":"https://www.wikidata.org/wiki/Q2476929","display_name":"Confidentiality","level":2,"score":0.6155999898910522},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.5246000289916992},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.4790000021457672},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45559999346733093},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.4018000066280365},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.38989999890327454},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3864000141620636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3849000036716461},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3650999963283539},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.2554999887943268}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05663243v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05663243","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2606.19129","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05663243v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05663243","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Dealing":[0],"simultaneously":[1],"with":[2,36,57,127],"confidentiality":[3,43,95,192],"and":[4,29,96,122,143,160,191,194],"Byzantine":[5,58,97,225],"behaviors":[6],"in":[7,15],"decentralized":[8,16,145],"learning":[9,22],"is":[10],"a":[11,20,37,117,139,152,162,167],"challenging":[12],"problem.":[13],"Indeed,":[14],"learning,":[17],"clients":[18],"train":[19],"machine":[21],"model":[23,32,49,90,219],"while":[24,216],"keeping":[25],"their":[26,31],"data":[27],"locally":[28],"share":[30],"parameters":[33],"or":[34,111],"gradients":[35],"set":[38],"of":[39,76,130,154,156],"neighbors.":[40],"While":[41],"enforcing":[42,93],"calls":[44],"for":[45,141],"hiding":[46],"the":[47,63,113,128,131,173],"exchanged":[48],"parameters/gradients":[50],"(e.g.,":[51],"by":[52,187],"using":[53,176],"cryptographic":[54],"techniques),":[55],"dealing":[56],"contributions":[59],"often":[60],"requires":[61],"inspecting":[62],"latter.":[64],"Hence,":[65],"most":[66],"research":[67],"works":[68],"address":[69],"these":[70,100],"objectives":[71],"separately.":[72],"A":[73],"recent":[74],"line":[75],"work":[77],"proposes":[78],"to":[79,85,116,201,206,223],"employ":[80],"secure":[81],"multi-party":[82],"computation":[83,115],"(MPC)":[84],"implement":[86],"robust":[87],"aggregators":[88],"against":[89],"poisoning,":[91],"thereby":[92],"both":[94,185],"resilience.":[98],"However,":[99],"solutions":[101],"scale":[102],"badly:":[103],"they":[104],"either":[105],"require":[106],"all-to-all":[107],"communication":[108,123,213],"between":[109],"participants":[110],"delegate":[112],"entire":[114],"small":[118],"subset,":[119],"whose":[120],"computational":[121],"load":[124],"grows":[125],"proportionally":[126],"size":[129,157],"network.":[132],"In":[133],"this":[134],"paper,":[135],"we":[136],"present":[137],"Giskard,":[138],"protocol":[140],"confidential":[142],"Byzantine-robust":[144],"aggregation.":[146],"Giskard":[147,184,210],"organizes":[148],"$n$":[149],"parties":[150],"into":[151],"tree":[153],"committees":[155],"$O(\\log":[158],"n)$":[159],"evaluates":[161],"coordinate-wise":[163],"approximate":[164],"median":[165],"via":[166],"committee-adapted":[168],"distributed":[169],"binary":[170],"search":[171],"over":[172],"value":[174],"domain,":[175],"BGW-style":[177],"MPC":[178],"within":[179],"each":[180],"committee.":[181],"We":[182],"assess":[183],"theoretically":[186],"proving":[188],"its":[189,207],"security":[190],"properties":[193],"experimentally":[195],"through":[196],"extensive":[197],"experiments":[198],"involving":[199],"up":[200,222],"one":[202],"million":[203],"participants.":[204],"Compared":[205],"closest":[208],"competitors,":[209],"reduces":[211],"per-party":[212],"complexity":[214],"asymptotically":[215],"exhibiting":[217],"comparable":[218],"utility":[220],"under":[221],"$n/4$":[224],"parties.":[226]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-19T00:00:00"}