Abstract
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, we identify their original scheme definition has a limitation: a coalition of participants can reconstruct all shared secrets without broadcast from the dealer, and hence render the dealer no control over disenrollment. We introduce a constraint that delays this lack of control of the dealer over disenrollment. We also establish the lower bounds on the entropy of broadcast messages in such a model. We demonstrate the need for new models by presenting a construction under an open problem.
Chapter PDF
References
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. 2384, pp. 71–88. Springer, Heidelberg (2002)
Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 National Computer Conference, pp. 313–317 (1979)
Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.: Threshold schemes with disenrollment. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 540–548. Springer, Heidelberg (1993)
Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110–125. Springer, Heidelberg (1994)
Blundo, C.: A note on dynamic threshold schemes. Information Processing Letters 55, 189–193 (1995)
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–95 (1994)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons Inc., Chichester (1991)
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)
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–352. Springer, Heidelberg (1995)
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)
Li, M., Poovendran, R.: Broadcast Enforced Threshold Schemes with Disenrollment, UWEETR-2003-0014, University of Washington (2003)
Martin, K.M.: Untrustworthy participants in perfect secret sharing schemes. In: Ganley, M.J. (ed.) Cryptography and Coding III, pp. 255–264. Oxford University Press, Oxford (1993)
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. 148(1), pp. 45–48 (2001)
Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Transactions on Information Theory 29, 35–41 (1983)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Stinson, D.R.: An explication of shared secret sharing schemes. Design, Codes and Cryptography 2, 357–390 (1992)
Stinson, D.R., Wei, R.: Bibliography on secret sharing schemes, Online Available, http://cacr.math.uwaterloo.ca/dstinson/ssbib.html
Tamura, U., Tada, M., Okamoto, E.: Update of access structure in Shamire’s (k, n) threshold scheme. In: Proceedings of the 1999 symposium on cryptography and information security, January 1999, pp. 26–29 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, M., Poovendran, R. (2004). Broadcast Enforced Threshold Schemes with Disenrollment. In: Matsui, M., Zuccherato, R.J. (eds) Selected Areas in Cryptography. SAC 2003. Lecture Notes in Computer Science, vol 3006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24654-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24654-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21370-3
Online ISBN: 978-3-540-24654-1
eBook Packages: Springer Book Archive