{"id":"https://openalex.org/W4401692262","doi":"https://doi.org/10.1109/isit57864.2024.10619511","title":"Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs","display_name":"Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692262","doi":"https://doi.org/10.1109/isit57864.2024.10619511"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619511","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit57864.2024.10619511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5101987564","display_name":"Maki Yoshida","orcid":"https://orcid.org/0000-0002-1267-0058"},"institutions":[{"id":"https://openalex.org/I90023481","display_name":"National Institute of Information and Communications Technology","ror":"https://ror.org/016bgq349","country_code":"JP","type":"facility","lineage":["https://openalex.org/I90023481"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Maki Yoshida","raw_affiliation_strings":["Cybersecurity Research Institute, National Institute of Information and Communications Technology,Tokyo,Japan"],"affiliations":[{"raw_affiliation_string":"Cybersecurity Research Institute, National Institute of Information and Communications Technology,Tokyo,Japan","institution_ids":["https://openalex.org/I90023481"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101987564"],"corresponding_institution_ids":["https://openalex.org/I90023481"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11277521,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1878","last_page":"1882"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9987999796867371,"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.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9872000217437744,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9799000024795532,"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/computer-science","display_name":"Computer science","score":0.7776059508323669},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6335307359695435},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.5047043561935425},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.4718330502510071},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3965468406677246},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32673680782318115},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32241618633270264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08574575185775757}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7776059508323669},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6335307359695435},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5047043561935425},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.4718330502510071},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3965468406677246},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32673680782318115},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32241618633270264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08574575185775757},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619511","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit57864.2024.10619511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W117166206","https://openalex.org/W139740867","https://openalex.org/W2002501531","https://openalex.org/W2009432965","https://openalex.org/W2021276494","https://openalex.org/W2106476824","https://openalex.org/W2728575722","https://openalex.org/W2789739729","https://openalex.org/W2795260699","https://openalex.org/W2940882131","https://openalex.org/W2953032017","https://openalex.org/W2996598375","https://openalex.org/W3022945989","https://openalex.org/W3043124302","https://openalex.org/W3141585064","https://openalex.org/W3187814643","https://openalex.org/W4386066260"],"related_works":["https://openalex.org/W2378598099","https://openalex.org/W2611275940","https://openalex.org/W4231775656","https://openalex.org/W2069340834","https://openalex.org/W2550686250","https://openalex.org/W2083288298","https://openalex.org/W2607129240","https://openalex.org/W2477549100","https://openalex.org/W2054224598","https://openalex.org/W2024784309"],"abstract_inverted_index":{"Non-interactive":[0],"secure":[1],"multiparty":[2],"computation":[3],"is":[4,89],"a":[5,11,43,46,56,147,163],"method":[6],"to":[7,55,162],"share":[8,47],"and":[9,52,74,97,109,115,125,166],"compute":[10],"private":[12,23,76],"function":[13,106,140],"<tex":[14,18,31,49,71],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[15,19,32,50,72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$f$</tex>":[16,51,73],"among":[17],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[20,33],"parties":[21],"holding":[22],"inputs":[24],"xi":[25,75],"with":[26],"1":[27],"<":[28,30],"i":[29],"in":[34,58],"the":[35,63,84,92,100,116,122,126,135,143,152,157,167,174],"information":[36],"theoretical":[37],"setting.":[38],"Each":[39],"party":[40],"locally":[41],"computes":[42],"message":[44],"from":[45,83],"of":[48,95,105,138],"send":[53],"it":[54],"referee":[57,61],"parallel.":[59],"The":[60,86],"obtains":[62],"output":[64],"f":[65],"(xi,\u2026":[66],",":[67],"xn)":[68],"while":[69],"keeping":[70],"other":[77],"than":[78],"what":[79],"can":[80],"be":[81],"inferred":[82],"output.":[85],"communication":[87,136],"complexity":[88,137],"evaluated":[90],"by":[91,145],"maximum":[93],"length":[94],"shares":[96],"messages.":[98],"In":[99],"previous":[101,158],"work,":[102],"several":[103],"kinds":[104],"families,":[107],"upper":[108,159,171],"lower":[110,149],"bounds":[111],"have":[112],"been":[113],"improved":[114],"only":[117],"gaps":[118],"remaining":[119],"are":[120],"for":[121,151,173],"group":[123,153],"products":[124,154],"Abelian":[127,175],"programs":[128],"(including":[129],"symmetric":[130],"functions).":[131],"This":[132],"paper":[133],"improves":[134],"both":[139],"families":[141],"towards":[142],"optimum":[144],"deriving":[146],"new":[148],"bound":[150,160,172],"that":[155],"matches":[156],"(up":[161],"constant":[164],"factor)":[165],"first":[168],"asymptotically":[169],"optimal":[170],"programs.":[176]},"counts_by_year":[],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}