{"id":"https://openalex.org/W4415367485","doi":"https://doi.org/10.1109/isit63088.2025.11195249","title":"Differentially Private Secure Multiplication with Erasures and Adversaries","display_name":"Differentially Private Secure Multiplication with Erasures and Adversaries","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367485","doi":"https://doi.org/10.1109/isit63088.2025.11195249"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195249","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/A5012796533","display_name":"Hailong Hu","orcid":"https://orcid.org/0000-0001-5138-4014"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haoyang Hu","raw_affiliation_strings":["Georgia Institute of Technology, School of Electrical and Computer Engineering,Atlanta,GA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, School of Electrical and Computer Engineering,Atlanta,GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008627075","display_name":"Viveck R. Cadambe","orcid":"https://orcid.org/0000-0001-6786-8785"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viveck R Cadambe","raw_affiliation_strings":["Georgia Institute of Technology, School of Electrical and Computer Engineering,Atlanta,GA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, School of Electrical and Computer Engineering,Atlanta,GA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012796533"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":2.3568,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.91484003,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":95},"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/T10237","display_name":"Cryptography and Data Security","score":0.9957000017166138,"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/T10237","display_name":"Cryptography and Data Security","score":0.9957000017166138,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8424000144004822},{"id":"https://openalex.org/keywords/secret-sharing","display_name":"Secret sharing","score":0.59579998254776},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.5781999826431274},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5515999794006348},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5382999777793884},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.44449999928474426},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43320000171661377},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.42879998683929443},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.4253999888896942}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8424000144004822},{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.59579998254776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5807999968528748},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5781999826431274},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5515999794006348},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5382999777793884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5181000232696533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4999000132083893},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.44449999928474426},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4194999933242798},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.39410001039505005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37599998712539673},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.27090001106262207},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.26829999685287476},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C13652956","wikidata":"https://www.wikidata.org/wiki/Q7444883","display_name":"Secure two-party computation","level":4,"score":0.25940001010894775},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195249","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/G7733981083","display_name":null,"funder_award_id":"2506573","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1873763122","https://openalex.org/W2141420453","https://openalex.org/W2148575324","https://openalex.org/W2248469562","https://openalex.org/W2268702383","https://openalex.org/W2911978475","https://openalex.org/W2963498933","https://openalex.org/W3007714448","https://openalex.org/W3009878528","https://openalex.org/W3124082353","https://openalex.org/W3127518390","https://openalex.org/W3133603318","https://openalex.org/W3187534145","https://openalex.org/W3201582037","https://openalex.org/W3212424730","https://openalex.org/W4206775542","https://openalex.org/W4285260949","https://openalex.org/W4310902982","https://openalex.org/W4323065158","https://openalex.org/W4386057506","https://openalex.org/W4386075238","https://openalex.org/W4402171154","https://openalex.org/W4405908161","https://openalex.org/W4415367485"],"related_works":[],"abstract_inverted_index":{"We":[0,145],"consider":[1],"a":[2,95,147],"private":[3],"distributed":[4],"multiplication":[5,102],"problem":[6],"involving":[7],"<tex":[8,14,33],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[9,15,34,55],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[10],"computation":[11,44],"nodes":[12],"and":[13,45,72,107,143],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T$</tex>":[16],"colluding":[17],"nodes.":[18,159],"Shamir's":[19,89],"secret":[20],"sharing":[21],"algorithm":[22,150],"provides":[23],"perfect":[24],"informationtheoretic":[25],"privacy,":[26],"while":[27],"requiring":[28],"an":[29,104],"honest":[30,51,105],"majority,":[31],"i.e.,":[32],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathrm{N}":[35],"\\geq":[36],"2":[37,58],"\\mathrm{T}+1$</tex>.":[38],"Recent":[39],"work":[40],"has":[41],"investigated":[42],"approximate":[43],"characterized":[46],"privacy-accuracy":[47],"trade-offs":[48],"for":[49,60,100],"the":[50,67,75,84,115,119,129,133,136,152],"minority":[52],"setting":[53],"(<tex":[54],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N":[56],"\\leq":[57],"\\mathrm{T}$</tex>)":[59],"real-valued":[61],"data,":[62],"quantifying":[63],"privacy":[64,69],"leakage":[65],"via":[66,74],"differential":[68],"(DP)":[70],"framework":[71],"accuracy":[73],"mean":[76],"squared":[77],"error.":[78],"However,":[79],"it":[80],"does":[81],"not":[82],"incorporate":[83],"error":[85],"correction":[86],"capabilities":[87],"of":[88,135],"secret-sharing":[90],"algorithm.":[91],"This":[92],"paper":[93],"develops":[94],"new":[96],"polynomialbased":[97],"coding":[98],"scheme":[99,131],"secure":[101],"with":[103],"minority,":[106],"characterizes":[108],"its":[109],"achievable":[110],"privacy-utility":[111],"tradeoff,":[112],"showing":[113],"that":[114],"tradeoff":[116],"can":[117],"approach":[118],"converse":[120],"bound":[121],"as":[122,124],"closely":[123],"desired.":[125],"Unlike":[126],"previous":[127],"schemes,":[128],"proposed":[130],"inherits":[132],"capability":[134],"Reed-Solomon":[137],"(RS)":[138],"code":[139],"to":[140,156],"tolerate":[141],"erasures":[142],"adversaries.":[144],"utilize":[146],"modified":[148],"Berlekamp-Welch":[149],"over":[151],"real":[153],"number":[154],"field":[155],"detect":[157],"adversarial":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}