{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:08:22Z","timestamp":1774022902525,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tit.2018.2852276","type":"journal-article","created":{"date-parts":[[2018,11,10]],"date-time":"2018-11-10T00:01:48Z","timestamp":1541808108000},"page":"436-443","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Uniform Secret Sharing"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-0058","authenticated-orcid":false,"given":"Maki","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3371-5745","authenticated-orcid":false,"given":"Toru","family":"Fujiwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc P. C.","family":"Fossorier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"699","article-title":"Communication complexity of secure computation","author":"franklin","year":"1992","journal-title":"Proc Ann ACM Symp Theory of Computing (STOC)"},{"key":"ref11","first-page":"160","article-title":"Lossy chains and fractional secret sharing","author":"ishai","year":"2013","journal-title":"Proc 30th Int Symp Theor Aspects Comput Sci (STACS)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.09.012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48285-7_11"},{"key":"ref15","first-page":"33","article-title":"Lower bound on the size of shares of nonperfect secret sharing schemes","volume":"917","author":"okada","year":"1994","journal-title":"Proc 4th Int Conf Theory Appl Cryptol (ASIACRYPT)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.272461"},{"key":"ref18","first-page":"945","article-title":"Secret sharing system using (k, L, n) threshold scheme","volume":"69","author":"yamamoto","year":"1985","journal-title":"IECE Trans"},{"key":"ref19","first-page":"788","article-title":"Non-linear function ramp scheme","author":"yoneyama","year":"2004","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref4","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc Int Workshop Manag Requirements Knowl (AFIPS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162183"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00198463"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"ref8","author":"ferr\u00e0s","year":"2017","journal-title":"On the Information Ratio of Non-Perfect Secret Sharing Schemes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","article-title":"Secret-sharing schemes: A survey","volume":"6639","author":"beimel","year":"2011","journal-title":"Proc 3rd Int Conf Coding Cryptol (IWCC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/WOWMOM.2006.17"},{"key":"ref9","first-page":"217","article-title":"Optimal non-perfect uniform secret sharing schemes","volume":"8617","author":"ferr\u00e1s","year":"2014","journal-title":"Proc 34th Annu Int Adv Cryptol (CRYPTO)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557361"},{"key":"ref22","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32284-6_11"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8581519\/08528893.pdf?arnumber=8528893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T16:56:08Z","timestamp":1643302568000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8528893\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2852276","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}