{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T04:04:39Z","timestamp":1727064279335},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319979151"},{"type":"electronic","value":"9783319979168"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97916-8_14","type":"book-chapter","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T12:13:24Z","timestamp":1532520804000},"page":"206-223","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["XOR-Based Hierarchical Secret Sharing Scheme"],"prefix":"10.1007","author":[{"given":"Koji","family":"Shima","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Doi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"14_CR1","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. AFIPS 48, 313\u2013317 (1979)","journal-title":"AFIPS"},{"issue":"11","key":"14_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-24638-1_26","volume-title":"Theory of Cryptography","author":"T Tassa","year":"2004","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 473\u2013490. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_26"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical Threshold secret sharing. J. Cryptol. 20(2), 237\u2013264 (2007)","journal-title":"J. Cryptol."},{"key":"14_CR5","first-page":"631","volume":"2005","author":"Y Fujii","year":"2005","unstructured":"Fujii, Y., Tada, M., Hosaka, N., Tochikubo, K., Kato, T.: A fast $$(2, n)$$(2,n)-threshold scheme and its application. CSS 2005, 631\u2013636 (2005). (in Japanese)","journal-title":"CSS"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast $$(3, n)$$(3,n)-threshold secret sharing scheme using Exclusive-OR operations. IEICE Trans. Fundam. E91-A(1), 127\u2013138 (2008)","DOI":"10.1093\/ietfec\/e91-a.1.127"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: On a fast $$(k, n)$$(k,n)-threshold secret sharing scheme. IEICE Trans. Fundam. E91-A(9), 2365\u20132378 (2008)","DOI":"10.1093\/ietfec\/e91-a.9.2365"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-85886-7_31","volume-title":"Information Security","author":"J Kurihara","year":"2008","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A new (k,n)-threshold secret sharing scheme and its extension. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 455\u2013470. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85886-7_31"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1587\/transfun.E94.A.1375","volume":"E94-A","author":"Jun KURIHARA","year":"2011","unstructured":"Kurihara, J., Uyematsu, T.: A novel realization of threshold schemes over binary field extensions. IEICE Trans. Fundam. E94-A(6), 1375\u20131380 (2011)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1049\/ip-com:20040423","volume":"151","author":"G-L Feng","year":"2004","unstructured":"Feng, G.-L., Deng, R.-H., Bao, F.: Packet-loss resilient coding scheme with only XOR operations. IEE Proc. Commun. 151(4), 322\u2013328 (2004)","journal-title":"IEE Proc. Commun."},{"key":"14_CR11","unstructured":"Bl\u00f6mer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., Zuckerman, D.: An XOR-Based Erasure-Resilient Coding Scheme. ICSI Technical report TR-95-048 (1995)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-319-48965-0_28","volume-title":"Cryptology and Network Security","author":"L Chen","year":"2016","unstructured":"Chen, L., Laing, T.M., Martin, K.M.: Efficient, XOR-based, ideal $$(t,n)-$$(t,n)-threshold schemes. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 467\u2013483. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_28"},{"key":"14_CR13","unstructured":"Sel\u00e7uk, A.A., Ka\u015fkalo\u011flu, K., \u00d6zbudak, F.: On hierarchical threshold secret sharing. IACR Cryptology ePrint Archive 2009, p. 450 (2009)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology \u2014 CRYPTO 88","author":"GJ Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (Really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390\u2013448. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_30"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Castiglione, A., De Santis, A., Masucci, B.: Hierarchical and shared key assignment. NBiS-2014, pp. 263\u2013270 (2014)","DOI":"10.1109\/NBiS.2014.106"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(95)00065-8","volume":"154","author":"C Blundo","year":"1996","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. TCS 154, 283\u2013306 (1996)","journal-title":"TCS"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48071-4_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Gargano, L., Vaccaro, U.: On the information rate of secret sharing schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 148\u2013167. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_11"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast $$(k, L, n)$$(k,L,n)-threshold ramp secret sharing scheme. IEICE Trans. Fundam. E92-A(8), 1808\u20131821 (2009)","DOI":"10.1587\/transfun.E92.A.1808"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Shima, K., Doi, H.: $$(\\{1,3\\}, n)$$({1,3},n) hierarchical secret sharing scheme based on XOR operations for a small number of indispensable participants. AsiaJCIS 2016, pp. 108\u2013114 (2016)","DOI":"10.1109\/AsiaJCIS.2016.11"},{"key":"14_CR22","first-page":"875","volume":"25","author":"K Shima","year":"2017","unstructured":"Shima, K., Doi, H.: A hierarchical secret sharing scheme over finite fields of characteristic 2. J. Inf. Process. 25, 875\u2013883 (2017)","journal-title":"J. Inf. Process."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97916-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T07:48:27Z","timestamp":1571644107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97916-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319979151","9783319979168"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97916-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}