{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T05:11:34Z","timestamp":1744348294404},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213703"},{"type":"electronic","value":"9783540246541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24654-1_8","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T12:49:37Z","timestamp":1294404577000},"page":"101-116","source":"Crossref","is-referenced-by-count":4,"title":["Broadcast Enforced Threshold Schemes with Disenrollment"],"prefix":"10.1007","author":[{"given":"Mingyan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radha","family":"Poovendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-45450-0_6","volume-title":"Information Security and Privacy","author":"S.G.. Barwick","year":"2002","unstructured":"Barwick, S.G., Jackson, W.A., Martin, K.M., Wild, P.R.: Size of broadcast in threshold schemes with disenrollment. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol.\u00a02384, pp. 71\u201388. Springer, Heidelberg (2002)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/3-540-48071-4_38","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"B. Blakley","year":"1993","unstructured":"Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.: Threshold schemes with disenrollment. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 540\u2013548. Springer, Heidelberg (1993)"},{"key":"8_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 - CRYPTO \u201993","author":"C. Blundo","year":"1994","unstructured":"Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 110\u2013125. Springer, Heidelberg (1994)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0020-0190(95)00104-K","volume":"55","author":"C. Blundo","year":"1995","unstructured":"Blundo, C.: A note on dynamic threshold schemes. Information Processing Letters\u00a055, 189\u2013193 (1995)","journal-title":"Information Processing Letters"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Charnes, C., Pieprzyk, J., Safavi-Naini, R.: Conditionally secure secret sharing schemes with disenrollment capability. In: Proceedings of the 2nd ACM Conference on Computer and communications security, pp. 89\u201395 (1994)","DOI":"10.1145\/191177.191196"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons Inc., Chichester (1991)"},{"key":"8_CR8","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its application, Technical Report ISSE TR-97-01, George Mason University (July 1997)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","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.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"8_CR10","volume-title":"Proceedings of 37th annual Conference on Information Sciences and Systems (CISS)","author":"M. Li","year":"2003","unstructured":"Li, M., Poovendran, R.: A note on threshold schemes with disenrollment. In: Proceedings of 37th annual Conference on Information Sciences and Systems (CISS), March 2003, John Hopkins University, Baltimore (2003)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Poovendran, R.: Broadcast Enforced Threshold Schemes with Disenrollment, UWEETR-2003-0014, University of Washington (2003)","DOI":"10.21236\/ADA459839"},{"key":"8_CR12","first-page":"255","volume-title":"Cryptography and Coding III","author":"K.M. Martin","year":"1993","unstructured":"Martin, K.M.: Untrustworthy participants in perfect secret sharing schemes. In: Ganley, M.J. (ed.) Cryptography and Coding III, pp. 255\u2013264. Oxford University Press, Oxford (1993)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Martin, K.M., Nakahara Jr, J.: Weakness of protocols for updating the parameters of an established threshold scheme. In: IEE Proceedings Computers and Digital Techniques, vol.\u00a0148(1), pp. 45\u201348 (2001)","DOI":"10.1049\/ip-cdt:20010204"},{"key":"8_CR14","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 systems. IEEE Transactions on Information Theory\u00a029, 35\u201341 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR15","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. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"8_CR16","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 shared secret sharing schemes. Design, Codes and Cryptography\u00a02, 357\u2013390 (1992)","journal-title":"Design, Codes and Cryptography"},{"key":"8_CR17","unstructured":"Stinson, D.R., Wei, R.: Bibliography on secret sharing schemes, Online Available, http:\/\/cacr.math.uwaterloo.ca\/dstinson\/ssbib.html"},{"key":"8_CR18","unstructured":"Tamura, U., Tada, M., Okamoto, E.: Update of access structure in Shamire\u2019s (k, n) threshold scheme. In: Proceedings of the 1999 symposium on cryptography and information security, January 1999, pp. 26\u201329 (1999)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24654-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:25Z","timestamp":1605761425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24654-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213703","9783540246541"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24654-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}