{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:59:31Z","timestamp":1769313571578,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577669","type":"print"},{"value":"9783540483298","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-48329-2_10","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:25:55Z","timestamp":1186363555000},"page":"110-125","source":"Crossref","is-referenced-by-count":44,"title":["Fully Dynamic Secret Sharing Schemes"],"prefix":"10.1007","author":[{"given":"C.","family":"Blundo","sequence":"first","affiliation":[]},{"given":"A.","family":"Cresti","sequence":"additional","affiliation":[]},{"given":"A.","family":"De Santis","sequence":"additional","affiliation":[]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"B. Blakley","year":"1992","unstructured":"B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey, Threshold Schemes with Disenrollment, in \u201cAdvances in Cryptology-CRYPTO\u2019 92\u201d, Ed. E. Brickell, \u201cLecture Notes in Computer Science\u201d, Springer-Verlag."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp.313\u2013317, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"C. Blundo","year":"1992","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in \u201cAdvances in Cryptology-CRYPTO\u2019 92\u201d, Ed. E. Brickell, \u201cLecture Notes in Computer Science\u201d, Springer-Verlag."},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47555-9_1","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 92","author":"C. Blundo","year":"1993","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 Eurocrypt\u2019 92\u201d, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1\u201324, 1993."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4, No. 2, pp. 123\u2013134, 1991.","journal-title":"J. Cryptology"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Vol. 6, No. 3, pp. 157\u2013169, 1993.","journal-title":"Journal of Cryptology"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symp. on Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","first-page":"286","volume-title":"Advances in Cryptology-Eurocrypt\u2019 89","author":"L. Harn","year":"1989","unstructured":"L. Harn, T. Hwang, C. Laih, and J. Lee, Dynamic Threshold Scheme based on the definition of Cross-Product in a N-dimensional Linear Space in \u201cAdvances in Cryptology-Eurocrypt\u2019 89\u201d, Lecture Notes in Computer Science, Vol. 435, J. Brassard Ed., Springer-Verlag, pp. 286\u2013298."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, Vol. IT-29, no. 1, pp. 35\u201341, Jan. 1983.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"10_CR10","unstructured":"K. Martin, Discrete Structures in the Theory of Secret Sharing, PhD Thesis, University of London, 1991."},{"key":"10_CR11","unstructured":"K. Martin, Untrustworthy Participants in Perfect Secret Sharing Schemes, Proceedings of the 3rd IMA Conference on Coding and Cryptology, 1992."},{"issue":"11","key":"10_CR12","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, n. 11, pp. 612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, An Introduction to Shared Secret and\/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"10_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO 88","author":"G. J. Simmons","year":"1988","unstructured":"G. J. Simmons, How to (Really) Share a Secret, in \u201cAdvances in Cryptology-CRYPTO 88\u201d, Ed. S. Goldwasser, \u201cLecture Notes in Computer Science\u201d, Springer-Verlag."},{"key":"10_CR15","first-page":"71","volume":"1","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, W. Jackson, and K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the ICA, Vol. 1, pp. 71\u201388, 1991.","journal-title":"Bulletin of the ICA"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357\u2013390, 1992.","journal-title":"Design, Codes and Cryptography"},{"key":"10_CR17","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:20:32Z","timestamp":1737346832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577669","9783540483298"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1994]]}}}