{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:59:56Z","timestamp":1729648796827,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523536","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1221-1225","source":"Crossref","is-referenced-by-count":1,"title":["Strongly secure ramp secret sharing schemes"],"prefix":"10.1109","author":[{"given":"M.","family":"Iwamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","first-page":"57","article-title":"Reconstruction control of practical information in ramp scheme","author":"hirota","year":"2003","journal-title":"Technical Repotrt of IEICE"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_17"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00399-7"},{"key":"11","first-page":"99","article-title":"Secret sharing scheme realizing general access structure","author":"itoh","year":"1987","journal-title":"IEEE GLOBECOM"},{"key":"12","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","article-title":"Efficient sharing of many secrets","author":"blundo","year":"1993","journal-title":"Proc of STACS'93"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056621"},{"key":"2","first-page":"313","article-title":"Safe guarding cryptographic keys","volume":"48","author":"blaldey","year":"1979","journal-title":"AFIPS 1979 Nat Computer Conf"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"10","first-page":"34","article-title":"Lower bound on the size of shares of non-perfect secret sharing schemes","author":"okada","year":"1994","journal-title":"Advances in Crypology-ASIACRYPT'94"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"6","first-page":"945","article-title":"On secret sharing systems using (k, L, n) threshold scheme","volume":"j68 a","author":"yamamoto","year":"1985","journal-title":"IECE Trans"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF00198463"},{"key":"9","first-page":"690","article-title":"Some basic properties of general nonperfect secret sharing schemes","volume":"4","author":"ogata","year":"1998","journal-title":"J of Universal Computer Science"},{"key":"8","first-page":"126","article-title":"Non-perfect secret sharing schemes and matroids","author":"kurosawa","year":"1993","journal-title":"Advances in Cryptology-EUROCRYPT'93"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523536.pdf?arnumber=1523536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:29Z","timestamp":1497694109000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523536","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}