{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:50Z","timestamp":1773377870162,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849591","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"3047-3051","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes"],"prefix":"10.1109","author":[{"given":"Reo","family":"Eriguchi","sequence":"first","affiliation":[{"name":"Department of Complexity Science and Engineering, The University of Tokyo"}]},{"given":"Noboru","family":"Kunihiro","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Tokyo"}]},{"given":"Mitsugu","family":"Iwamoto","sequence":"additional","affiliation":[{"name":"Department of Informatics, The University of Electro-Communications"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.1.101"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9879-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.10.020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0334-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9027-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref4","first-page":"1","article-title":"Graph decompositions and secret sharing schemes","volume":"658","author":"blundo","year":"1992","journal-title":"Advances in Cryptology -CRYPTO LNCS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0217-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008381427667"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00100-6"},{"key":"ref7","first-page":"597","article-title":"Improving the linear programming technique in the search for lower bounds in secret sharing","volume":"10820","author":"farr as","year":"2018","journal-title":"Advances in Cryptology-EuroCrypt'96 LNCS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_3"},{"key":"ref9","first-page":"99","article-title":"Secret sharing scheme realizing general access structure","author":"ito","year":"1987","journal-title":"IEEE GLOBECOM"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849591.pdf?arnumber=8849591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:25Z","timestamp":1773347725000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849591","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}