{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:02:37Z","timestamp":1784736157556,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671855","type":"print"},{"value":"9783540465133","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46513-8_15","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T10:47:23Z","timestamp":1186051643000},"page":"200-214","source":"Crossref","is-referenced-by-count":35,"title":["Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures"],"prefix":"10.1007","author":[{"given":"Douglas R.","family":"Stinson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","first-page":"523","volume-title":"European Symposium on Algorithms (ESA) 95","author":"N. Alon","year":"1999","unstructured":"N. Alon, Z. Galil and M. Yung, Efficient dynamic-resharing \u201cverifiable secret sharing\u201d against mobile adversary, European Symposium on Algorithms (ESA) 95, LNCS 979, 523\u2013537."},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","first-page":"251","volume-title":"Advances in Cryptology-Crypto\u201986","author":"J. C. Benaloh","year":"1987","unstructured":"J. C. Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret, Advances in Cryptology-Crypto\u201986, LNCS 263, 1987, 251\u2013260."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations, Proc. 20th Annual Symp. on the Theory of Computing, ACM, 1988, 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"G.R. Blackley, Safeguarding cryptographic keys. Proc. Nat. Computer Conf. AFIPS Conf. Proc., 1979, 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-39757-4_22","volume-title":"An optimal class of symmetric key generation systems, Eurocrypt\u201984","author":"R. Blom","year":"1985","unstructured":"R. Blom, An optimal class of symmetric key generation systems, Eurocrypt\u201984, LNCS 209, (1985), 335\u2013338."},{"key":"15_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Maintaining security in the presence of transient faults, Crypto\u201994","author":"R. Canetti","year":"1994","unstructured":"R. Canetti and A. Herzberg, Maintaining security in the presence of transient faults, Crypto\u201994, LNCS 839, 1994."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau and I. Damgard, Multiparty Unconditionally Secure Protocols, Proc. 20th Annual Symp. on the Theory of Computing, ACM, 1988, 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in Presence of Faults, Proc. 26th Annual Symp. on the Foundations of Computing Science, IEEE, 1985, 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret sharing, Proc. 28th Annual Symp. on the Foundations of Computing Science, IEEE, 1987, 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali, An Optimal Algorithm for Synchronous Byzantine Agreement, Proc. 20th Annual Symp. on Theory of Computing, ACM, 1988, 148\u2013161.","DOI":"10.1145\/62212.62225"},{"key":"15_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0052254","volume-title":"Proactive RSA, Crypto\u201997","author":"Y. Frankel","year":"1997","unstructured":"Y. Frankel, P. Gemmel, P. D. MacKenzie and M. Yung, Proactive RSA, Crypto\u201997, LNCS 1294, 440\u2013452."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. O. Rabin and T. Rabin, Simplified VSS and fast-track multiparty computations with applications to threshold cryptography, Proc. of 17th ACM Symp. on Principles of Distributed Computing, (1998), 101\u2013111.","DOI":"10.1145\/277697.277716"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, 38 (1991) 691\u2013729.","journal-title":"Journal of the ACM"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung, Proactive public key and signature systems, The 4th ACM Symp. on Comp. and Comm. Security, April 1997.","DOI":"10.1145\/266420.266442"},{"key":"15_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Crypto\u201995","author":"A. Herzberg","year":"1995","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, Proactive secret sharing or: How to cope with perpetual leakage, Crypto\u201995, LNCS 963339-352."},{"key":"15_CR16","series-title":"Lect Notes Comput Sci","first-page":"266","volume-title":"Eurocrypt\u201990","author":"I. Ingemarsson","year":"1990","unstructured":"I. Ingemarsson and G. J. Simmons, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, Eurocrypt\u201990, LNCS 473, 1990, 266\u2013282."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, 24 (1981), 583\u2013584.","journal-title":"Communications of the ACM"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, ACM Symposium on principles of distributed computing, 1991, 51\u201359.","DOI":"10.1145\/112600.112605"},{"key":"15_CR19","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Advances in Cryptology-Crypto\u201991","author":"T. P. Pedersen","year":"1991","unstructured":"T. P. Pedersen, Non-interactive and information-theoretic secret sharing, Advances in Cryptology-Crypto\u201991, LNCS 576, 1991, 129\u2013140."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"T. Rabin, Robust sharing of secrets when the dealer is honest or faulty, Journal of the ACM, 41 (1994), 1089\u20131109.","journal-title":"Journal of the ACM"},{"key":"15_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0055722","volume-title":"Crypto\u201998","author":"T. Rabin","year":"1998","unstructured":"T. Rabin, A simplified approach to threshold and proactive RSA, Crypto\u201998, LNCS 1462, 1998, 89\u2013104."},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, Proc. 21st Annual Sympo. on the Theory of Computing, ACM, 1989, 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"15_CR23","first-page":"612","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Commun. ACM, 22 (1979), 612\u2013613.","journal-title":"How to share a secret, Commun"},{"key":"15_CR24","unstructured":"R. S. Rees, D. R. Stinson, R. Wei and G. H. J. van Rees, An application of covering designs: determining the maximum consistent set of shares in a threshold scheme, Ars Combin., to appear."},{"key":"15_CR25","unstructured":"D. R. Stinson, Cryptography Theory and Practice, CRC Press, 1995."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M. Tompa","year":"1988","unstructured":"M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology, 1 (1988), 133\u2013138.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46513-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:23:58Z","timestamp":1737339838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46513-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671855","9783540465133"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46513-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}