{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T11:16:32Z","timestamp":1775214992484,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319491745","type":"print"},{"value":"9783319491752","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49175-2_2","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T06:59:42Z","timestamp":1478674782000},"page":"24-43","source":"Crossref","is-referenced-by-count":11,"title":["Dynamic and Verifiable Hierarchical Secret Sharing"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Traverso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denise","family":"Demirel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"issue":"1","key":"2_CR1","first-page":"90","volume":"4","author":"M Agarwal","year":"2014","unstructured":"Agarwal, M., Mehr, R.: Review of matrix decomposition techniques for signal processing applications. Int. J. Eng. Res. Appl. 4(1), 90\u201393 (2014). www.ijera.com","journal-title":"Int. J. Eng. Res. Appl."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1007\/978-3-642-25385-0_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M Backes","year":"2011","unstructured":"Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 590\u2013609. Springer, Heidelberg (2011). http:\/\/dx.doi.org\/10.1007\/978-3-642-25385-0_32"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-28166-7_2","volume-title":"Applied Cryptography and Network Security","author":"J Baron","year":"2015","unstructured":"Baron, J., Defrawy, K.E., Lampkins, J., Ostrovsky, R.: Communication-optimal proactive secret sharing for dynamic groups. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 23\u201341. Springer, Heidelberg (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-28166-7_2"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-48329-2_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 1993","author":"C Blundo","year":"1994","unstructured":"Blundo, C., Cresti, A., Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110\u2013125. Springer, Heidelberg (1994). http:\/\/dx.doi.org\/10.1007\/3-540-48329-2_10"},{"key":"2_CR5","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 1989","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). doi: 10.1007\/3-540-46885-4_45"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21\u201323 October 1985, pp. 383\u2013395 (1985). http:\/\/dx.doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Doganay, M.C., Pedersen, T.B., Saygin, Y., Sava\u015f, E., Levi, A.: Distributed privacy preserving k-means clustering with additive secret sharing. In: Proceedings of 2008 International Workshop on Privacy and Anonymity in Information Society, pp. 3\u201311. ACM (2008)","DOI":"10.1145\/1379287.1379291"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, pp. 427\u2013438. IEEE (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Proceedings of 3rd Theory of Cryptography Conference Theory of Cryptography, TCC 2006, New York, NY, USA, 4\u20137 March 2006, pp. 329\u2013342 (2006). http:\/\/dx.doi.org\/10.1007\/11681878_17","DOI":"10.1007\/11681878_17"},{"key":"2_CR10","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6\u20138 July 2001, Heraklion, Crete, Greece, pp. 580\u2013589 (2001). http:\/\/doi.acm.org\/10.1145\/380752.380853"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0053748","volume-title":"Information Security and Privacy","author":"H Ghodosi","year":"1998","unstructured":"Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Secret sharing in multilevel and compartmented groups. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 367\u2013378. Springer, Heidelberg (1998). doi: 10.1007\/BFb0053748"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, V., Gopinath, K.: $$\\text{G}_{{\\rm its}}^{{2}}$$ VSR: : an information theoretical secure verifiable secret redistribution protocol for long-term archival storage. In: 4th International IEEE Security in Storage Workshop, SISW 2007, pp. 22\u201333. IEEE (2007)","DOI":"10.1109\/SISW.2007.11"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0 1995","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). doi: 10.1007\/3-540-44750-4_27"},{"issue":"8","key":"2_CR14","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/j.ic.2009.03.007","volume":"207","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8), 889\u2013899 (2009). http:\/\/dx.doi.org\/10.1016\/j.ic.2009.03.007","journal-title":"Inf. Comput."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-39568-7_19","volume-title":"Advances in Cryptology","author":"SC Kothari","year":"1985","unstructured":"Kothari, S.C.: Generalized linear threshold scheme. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 231\u2013241. Springer, Heidelberg (1985). doi: 10.1007\/3-540-39568-7_19"},{"issue":"4","key":"2_CR16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1049\/iet-ifs.2009.0098","volume":"4","author":"M Nojoumian","year":"2010","unstructured":"Nojoumian, M., Stinson, D.R., Grainger, M.: Unconditionally secure social secret sharing scheme. Inf. Secur. IET 4(4), 202\u2013211 (2010)","journal-title":"Inf. Secur. IET"},{"key":"2_CR17","unstructured":"Pakniat, N., Eslami, Z., Nojoumian, M.: Ideal social secret sharing using Birkhoff interpolation method. IACR Cryptology ePrint Archive 2014, 515 (2014). http:\/\/eprint.iacr.org\/2014\/515"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). doi: 10.1007\/3-540-46766-1_9"},{"issue":"4","key":"2_CR19","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1880022.1880028","volume":"13","author":"DA Schultz","year":"2010","unstructured":"Schultz, D.A., Liskov, B., Liskov, M.: MPSS: mobile proactive secret sharing. ACM Trans. Inf. Syst. Secur. 13(4), 34 (2010). http:\/\/doi.acm.org\/10.1145\/1880022.1880028","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"11","key":"2_CR20","doi-asserted-by":"crossref","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). http:\/\/doi.acm.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"2_CR21","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 1988","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, Heidelberg (1990). doi: 10.1007\/0-387-34799-2_30"},{"issue":"2","key":"2_CR22","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49175-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T07:50:20Z","timestamp":1568533820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49175-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491745","9783319491752"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49175-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}