Self-healing Key Distribution Schemes with Sponsorization

  • Germán Sáez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3677)


In a self-healing key distribution scheme a group manager enables a large and dynamic group of users to establish a group key over an unreliable network. The group manager broadcasts in every session some packet of information in order to provide a common key to members of the session group. The goal of self-healing key distribution schemes is that, even if the broadcast is lost in a certain session, the group member can recover the key from the broadcast packets received before and after the session. This approach to key distribution is quite suitable for wireless networks, mobile wireless ad-hoc networks and in several Internet-related settings, where high security requirements need to be satisfied.

In this work we provide a generalization of previous definitions in two aspects. The first one is to consider general structures instead of threshold ones to provide more flexible performance to the scheme. The second one is to consider the possibility that a coalition of users sponsor a user outside the group for one session: we give the formal definition of self-healing key distribution schemes with sponsorization, some bounds on the required amount of information. We also give a general construction of a family of self-healing key distribution schemes with sponsorization by means of a linear secret sharing scheme. Our construction differs from previous self-healing key distribution schemes in the fact that the length of the broadcast is almost constant. Finally we analyze the particular case of this general construction when Shamir’s secret sharing scheme is used.


Group key self-healing dynamic groups linear secret sharing schemes broadcast 


  1. 1.
    Blundo, C., D’Arco, P., De Santis, A., Listo, M.: Design of Self-Healing Key Distribution Schemes. Designs, Codes and Cryptography 32, 15–44 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Blundo, C., D’Arco, P., De Santis, A., Listo, M.: Definitions and Bounds for Self-Healing Key Distribution. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 234–245. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Cover, T.M., Thomas, J.A.: Elements of Inform. Theory. J. Wiley & Sons, Chichester (1991)CrossRefGoogle Scholar
  4. 4.
    Daza, V., Herranz, J., Sáez, G.: Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 464–475. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Kurnio, H., Safavi-Naini, R., Wang, H.: A Group Key Distribution Scheme with Decentralised User Join. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 146–163. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Liu, D., Ning, P., Sun, K.: Efficient Self-Healing Key Distribution with Revocation Capability. In: 10th ACM Conf. on Computer and Com. Security (2003)Google Scholar
  7. 7.
    Staddon, J., Miner, S., Franklin, M., Balfanz, D., Malkin, M., Dean, D.: Self-Healing Key Distribution with Revocation. In: IEEE Symp. on Security and Privacy (2002)Google Scholar
  8. 8.
    Stinson, D.R.: An explication of secret sharing schemes. Designs, Codes and Cryptography 2, 357–390 (1992)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • Germán Sáez
    • 1
  1. 1.Dept. Matemàtica Aplicada IVUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations