{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:27:42Z","timestamp":1761708462979,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642111440"},{"type":"electronic","value":"9783642111457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11145-7_35","type":"book-chapter","created":{"date-parts":[[2010,1,13]],"date-time":"2010-01-13T08:23:04Z","timestamp":1263370984000},"page":"449-458","source":"Crossref","is-referenced-by-count":4,"title":["A Multi-stage Secret Sharing Scheme Using All-or-Nothing Transform Approach"],"prefix":"10.1007","author":[{"given":"Mitra","family":"Fatemi","sequence":"first","affiliation":[]},{"given":"Taraneh","family":"Eghlidos","sequence":"additional","affiliation":[]},{"given":"Mohammadreza","family":"Aref","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"35_CR1","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\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: AFIPS, National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Stadler","year":"1996","unstructured":"Stadler, M.: Publicley Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-68339-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"W. Ogata","year":"1996","unstructured":"Ogata, W., Kurosawa, K.: Optimum Secret Sharing Scheme Secure against Cheating. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 200\u2013211. Springer, Heidelberg (1996)"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TIT.2004.840857","volume":"51","author":"S.G. Barwick","year":"2005","unstructured":"Barwick, S.G., Jackson, W.A., Martin, K.M.: Updating the Parameters of a Threshold Scheme by Minimal Broadcast. IEEE Transactions on Information Theory\u00a051(2), 620\u2013633 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D.R. Stinson","year":"1992","unstructured":"Stinson, D.R.: An Explication of Secret Sharing Schemes. Des., Codes, Cryptogr.\u00a02, 357\u2013390 (1992)","journal-title":"Des., Codes, Cryptogr."},{"issue":"19","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J. He","year":"1994","unstructured":"He, J., Dawson, E.: Multi-Stage Secret Sharing Scheme Based on One-way Function. Electronic Letters\u00a030(19), 1591\u20131592 (1994)","journal-title":"Electronic Letters"},{"key":"35_CR8","unstructured":"Chien, H.Y., Jan, J.K., Tseng, Y.M.: A Practical (t,n) Multi-Secret Sharing Scheme. IEICE Transactions on Fundamentals E83-A(12), 2762\u20132765 (2000)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Runhua, S., Liusheng, H., Yonglong, L., Hong, Z.: A Threshold Multi-Secret Sharing Scheme. In: IEEE International Conference on Networking, Sensing and Control, ICNSC 2008, pp. 1705\u20131707 (2008)","DOI":"10.1109\/ICNSC.2008.4525497"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.amc.2004.04.081","volume":"166","author":"C.W. Chan","year":"2006","unstructured":"Chan, C.W., Chang, C.C.: A Scheme for Threshold Multi-Secret Sharing. Applied Mathematics and Computation\u00a0166, 1\u201314 (2006)","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"35_CR11","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1049\/el:19950201","volume":"31","author":"L. Harn","year":"1995","unstructured":"Harn, L.: Comment: Multistage Secret Sharing based on One-way Function. Electronics Letters\u00a031(4), 262 (1995)","journal-title":"Electronics Letters"},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0096-3003(03)00355-2","volume":"151","author":"C.C. Yang","year":"2004","unstructured":"Yang, C.C., Chang, C.C., Hwang, M.S.: A (t,n) multi-secret sharing scheme. Applied Mathematics and Computation\u00a0151(2), 483\u2013490 (2004)","journal-title":"Applied Mathematics and Computation"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R. Rivest","year":"1997","unstructured":"Rivest, R.: All-or-Nothing Encryption and the Package Transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 210\u2013218. Springer, Heidelberg (1997)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-Resilient Functions and All-or-Nothing Transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E.D. Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On Secret Sharing System. IEEE Transaction on Information Theory\u00a029(1), 35\u201341 (1983)","journal-title":"IEEE Transaction on Information Theory"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Chor, B., Friedman, J., Goldreich, O., Hastad, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem or t-resilient Functions. In: FOCS, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J. He","year":"1995","unstructured":"He, J., Dawson, E.: Multisecret-Sharing Scheme Based on One-way Function. Electronic Letters\u00a031(2), 93\u201395 (1995)","journal-title":"Electronic Letters"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11145-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T18:03:41Z","timestamp":1590516221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11145-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111440","9783642111457"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11145-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}