{"id":"https://openalex.org/W4415367515","doi":"https://doi.org/10.1109/isit63088.2025.11195402","title":"On the Optimal Source Key Size of Secure Gradient Coding","display_name":"On the Optimal Source Key Size of Secure Gradient Coding","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367515","doi":"https://doi.org/10.1109/isit63088.2025.11195402"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195402","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/A5029083062","display_name":"Yang Zhou","orcid":"https://orcid.org/0000-0001-6867-6443"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yang Zhou","raw_affiliation_strings":["Huazhong University of Science and Technology,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109765933","display_name":"Wenbo Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenbo Huang","raw_affiliation_strings":["Huazhong University of Science and Technology,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042862785","display_name":"Kai Wan","orcid":"https://orcid.org/0000-0003-4671-3287"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Wan","raw_affiliation_strings":["Huazhong University of Science and Technology,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066014874","display_name":"Robert C. Qiu","orcid":"https://orcid.org/0000-0002-0988-5525"},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Robert Caiming Qiu","raw_affiliation_strings":["Huazhong University of Science and Technology,Wuhan,China,430074"],"affiliations":[{"raw_affiliation_string":"Huazhong University of Science and Technology,Wuhan,China,430074","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029083062"],"corresponding_institution_ids":["https://openalex.org/I47720641"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29065176,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9984999895095825,"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/T11017","display_name":"Chaos-based Image/Signal Encryption","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10796","display_name":"Cooperative Communication and Network Coding","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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.8438000082969666},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5655999779701233},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5346999764442444},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4909000098705292},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4650999903678894},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4320000112056732},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42669999599456787},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.3695000112056732}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8438000082969666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6553000211715698},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5655999779701233},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5346999764442444},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4909000098705292},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4650999903678894},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45509999990463257},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4320000112056732},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3700999915599823},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3508000075817108},{"id":"https://openalex.org/C47750902","wikidata":"https://www.wikidata.org/wiki/Q1557574","display_name":"Key size","level":4,"score":0.34700000286102295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33970001339912415},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.3343000113964081},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3301999866962433},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C510870077","wikidata":"https://www.wikidata.org/wiki/Q7444868","display_name":"Secure communication","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C38369872","wikidata":"https://www.wikidata.org/wiki/Q7445009","display_name":"Security analysis","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195402","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":[{"id":"https://openalex.org/G2488712091","display_name":null,"funder_award_id":"12141107","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1885156594","https://openalex.org/W2031137180","https://openalex.org/W2053637704","https://openalex.org/W2080911030","https://openalex.org/W2141420453","https://openalex.org/W2514994441","https://openalex.org/W2767079719","https://openalex.org/W3124562976","https://openalex.org/W3167719345","https://openalex.org/W3178386862","https://openalex.org/W3211387217","https://openalex.org/W4210348829","https://openalex.org/W4289655152"],"related_works":[],"abstract_inverted_index":{"Gradient":[0],"coding":[1,33,135],"enables":[2],"a":[3,36,212],"user":[4,37,59,94],"node":[5],"to":[6,39,62,81,154,190],"efficiently":[7],"aggregate":[8],"gradients":[9,45,67],"computed":[10],"by":[11],"server":[12],"nodes":[13],"from":[14,46,68,97],"local":[15],"datasets,":[16],"achieving":[17,158],"low":[18],"communication":[19,130,161],"costs":[20],"while":[21,157],"ensuring":[22],"resilience":[23],"against":[24],"straggling":[25],"servers.":[26,57,85,146],"This":[27],"paper":[28],"considers":[29],"the":[30,41,44,50,64,69,93,104,110,119,122,128,133,145,148,159,168,179,192,207,226,231,240],"secure":[31],"gradient":[32,134],"problem,":[34,136],"where":[35],"aims":[38],"compute":[40],"sum":[42,65,111],"of":[43,52,66,71,112,132],"K":[47],"datasets":[48,105],"with":[49,77,216,239],"assistance":[51],"<tex":[53,73,82,170,183],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[54,74,83,171,184],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[55],"distributed":[56],"The":[58,86],"is":[60],"required":[61,150,194],"recover":[63],"transmissions":[70,96],"any":[72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathrm{N}_{\\mathrm{r}}$</tex>":[75],"servers,":[76,99],"each":[78],"dataset":[79],"assigned":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N-N_{r}+m$</tex>":[84],"security":[87,123,156],"constraint":[88,124],"guarantees":[89],"that":[90,121,138],"even":[91],"if":[92],"receives":[95],"all":[98],"no":[100],"additional":[101],"information":[102],"about":[103],"can":[106],"be":[107],"obtained":[108],"beyond":[109],"gradients.":[113],"It":[114],"has":[115,163],"been":[116,164],"shown":[117],"in":[118],"literature":[120],"does":[125],"not":[126],"increase":[127],"optimal":[129,160,227],"cost":[131,162],"provided":[137],"enough":[139],"source":[140,151,195,208],"keys":[141],"are":[142,220],"shared":[143],"among":[144],"However,":[147],"minimum":[149,193],"key":[152,196,209],"size":[153,197,210],"ensure":[155],"studied":[165],"only":[166],"for":[167,198],"case":[169,182],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m=1$</tex>.":[172],"In":[173],"this":[174,199],"paper,":[175],"we":[176],"focus":[177],"on":[178,206,230],"more":[180],"general":[181],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m":[185],"\\geq":[186],"1$</tex>":[187],"and":[188,211,237],"aim":[189],"characterize":[191],"purpose.":[200],"A":[201],"new":[202],"information-theoretic":[203],"converse":[204,241],"bound":[205,242],"novel":[213],"achievable":[214],"scheme":[215,224,228],"smartly":[217],"designed":[218],"assignments":[219],"proposed.":[221],"Our":[222],"proposed":[223],"outperforms":[225],"based":[229],"widely":[232],"used":[233],"cyclic":[234],"data":[235],"assignment":[236],"coincides":[238],"under":[243],"specific":[244],"system":[245],"parameters.":[246]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}