{"id":"https://openalex.org/W4416513934","doi":"https://doi.org/10.1109/itw62417.2025.11240272","title":"On the Size of a Share for Non-perfect Secret Sharing Schemes","display_name":"On the Size of a Share for Non-perfect Secret Sharing Schemes","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4416513934","doi":"https://doi.org/10.1109/itw62417.2025.11240272"},"language":null,"primary_location":{"id":"doi:10.1109/itw62417.2025.11240272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","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":["National Institute of Information and Communications Technology,Cybersecurity Research Institute,Tokyo,Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Information and Communications Technology,Cybersecurity Research Institute,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.20062419,"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/T10237","display_name":"Cryptography and Data Security","score":0.8651000261306763,"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.8651000261306763,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.08129999786615372,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.013199999928474426,"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/secret-sharing","display_name":"Secret sharing","score":0.8532999753952026},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7009000182151794},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5249999761581421},{"id":"https://openalex.org/keywords/homomorphic-secret-sharing","display_name":"Homomorphic secret sharing","score":0.5181999802589417},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4823000133037567},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.41589999198913574},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.41100001335144043},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3928999900817871}],"concepts":[{"id":"https://openalex.org/C3087436","wikidata":"https://www.wikidata.org/wiki/Q1386603","display_name":"Secret sharing","level":3,"score":0.8532999753952026},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7009000182151794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6237999796867371},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5249999761581421},{"id":"https://openalex.org/C132161212","wikidata":"https://www.wikidata.org/wiki/Q5891458","display_name":"Homomorphic secret sharing","level":4,"score":0.5181999802589417},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47530001401901245},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46549999713897705},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.41589999198913574},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.41100001335144043},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.37549999356269836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.351500004529953},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C2778950925","wikidata":"https://www.wikidata.org/wiki/Q4672474","display_name":"Access structure","level":4,"score":0.3246999979019165},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29319998621940613},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C2992947560","wikidata":"https://www.wikidata.org/wiki/Q5167661","display_name":"Fair share","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C103659442","wikidata":"https://www.wikidata.org/wiki/Q1662488","display_name":"Information ratio","level":4,"score":0.2653999924659729},{"id":"https://openalex.org/C2779201187","wikidata":"https://www.wikidata.org/wiki/Q2775060","display_name":"Information leakage","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C184660509","wikidata":"https://www.wikidata.org/wiki/Q462624","display_name":"Shared secret","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw62417.2025.11240272","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw62417.2025.11240272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Information Theory Workshop (ITW)","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":14,"referenced_works":["https://openalex.org/W1534695542","https://openalex.org/W1566541904","https://openalex.org/W1872301466","https://openalex.org/W1977854174","https://openalex.org/W2068101455","https://openalex.org/W2076645411","https://openalex.org/W2092107314","https://openalex.org/W2141420453","https://openalex.org/W2160940849","https://openalex.org/W2401293175","https://openalex.org/W2524272550","https://openalex.org/W2899869462","https://openalex.org/W2970097841","https://openalex.org/W3022676255"],"related_works":[],"abstract_inverted_index":{"In":[0,34,187],"a":[1,5,90,110,129],"secret":[2,6,28,63,185],"sharing":[3],"scheme,":[4],"s":[7],"is":[8,48,58,66],"divided":[9],"into":[10],"multiple":[11],"shares":[12,20,31],"and":[13,29,64,180,210],"distributed":[14],"among":[15],"n":[16,72,122,151],"participants.":[17],"As":[18],"more":[19],"are":[21],"collected,":[22],"the":[23,27,30,35,38,45,59,62,67,80,94,120,135,149,163,175,197],"mutual":[24],"information":[25,181],"between":[26,177],"increases":[32],"monotonically.":[33],"perfect":[36,198],"case,":[37,82],"best":[39],"known":[40],"explicit":[41],"lower":[42,111,131,199],"bound":[43,112,132,200],"on":[44],"share":[46,86,178],"size":[47,179],"given":[49],"by":[50,161,167],"$\\frac{{{2^k}":[51,114,139],"-":[52,115,140],"1}}{k}":[53],"\\cdot":[54,117,144],"H(s)$,":[55,118,145],"where":[56],"H(s)":[57],"entropy":[60],"of":[61,93,113,165,174],"k":[65],"largest":[68],"integer":[69,99],"such":[70],"that":[71,133,194],"\u2265":[73,123,152],"2<sup":[74,124,153],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[75,125,154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sup>+k\u22122.":[76],"This":[77],"paper":[78],"considers":[79],"non-perfect":[81,184,191,206],"in":[83,106,183],"which":[84,146],"each":[85],"reveals":[87],"at":[88],"most":[89],"$\\frac{1}{L}$":[91],"fraction":[92],"secret's":[95],"entropy,":[96],"for":[97],"an":[98],"L":[100],">":[101],"1.":[102],"A":[103],"prior":[104,212],"result":[105],"this":[107],"setting":[108],"provides":[109],"1}}{{kL}}":[116],"under":[119,148],"condition":[121,150],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sup>+k+L\u22123.":[126],"We":[127],"provide":[128],"new":[130],"approaches":[134],"perfect-case":[136,159],"bound,":[137],"namely":[138],"2":[141],"+":[142],"1/L}}{k}":[143],"holds":[147],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sup>+k+2L\u22124.":[155],"The":[156],"proof":[157],"generalizes":[158],"techniques":[160],"increasing":[162],"number":[164],"participants":[166,203],"2(L\u22121).":[168],"These":[169],"results":[170],"refine":[171],"our":[172],"understanding":[173],"trade-off":[176],"leakage":[182],"sharing.":[186],"particular,":[188],"we":[189],"construct":[190],"access":[192],"structures":[193],"nearly":[195],"attain":[196],"with":[201],"fewer":[202],"than":[204],"previous":[205],"bounds,":[207],"thus":[208],"complementing":[209],"extending":[211],"work.":[213]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-23T00:00:00"}