Abstract
In a dynamic group key distribution scheme, members of a group themselves generate private common keys with the help of a group controller in an initialization phase. The system must enable the revocation and the addition of members to the group in the successive periods of time. If the addition of new members can also be performed by the existing members themselves, then the scheme is said to have decentralized user join.
In this work we construct a general family of dynamic group key distribution schemes with decentralized user join by using linear secret sharing schemes as a tool. This allows to obtain new schemes with more flexible characteristics than the previous threshold-based constructions.
This work was partially supported by Spanish Ministerio de Ciencia y Tecnología under project TIC 2000-1044.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Anzai, N. Matsuzaki and T. Matsumoto. A quick group key distribution scheme with “Entity Revocation”. Advances in Cryptology-Asiacrypt’99, LNCS 1716, Springer-Verlag, pp. 333–347 (1999).
S. Berkovits. How to broadcast a secret. Advances in Cryptology-Eurocrypt’91, LNCS 547, Springer-Verlag, pp. 536–541 (1991).
E.F. Brickell. Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing, 9, pp. 105–113 (1989).
R. Canetti, T. Malkin and K. Nissim. Efficient communication-storage tradeoffs for multicast encryption. Advances in Cryptology-Eurocrypt’99, LNCS 1592, Springer-Verlag, pp. 469–479 (1998).
G. Caronni, B. Plattner, D. Sun, M. Wandvogel and N. Weiler. The VersaKey framework: versatile group key management. IEEE Journal on Selected Areas in Communications, 17(9), (1999).
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. Proceedings of FOCS’87, IEEE Press, pp. 427–437 (1987).
P.A. Fouque and J. Stern. One round threshold discrete-log key generation without private channels. Proceedings of PKC’01, LNCS 1992, Springer-Verlag, pp. 190–206 (2001).
R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. Advances in Cryptology-Eurocrypt’99, LNCS 1592, Springer-Verlag, pp. 295–310 (1999).
L. Gong. New protocols for third party based authentication and secure broadcast. Proceedings of 2nd ACM Conference CCS, pp. 176–183 (1994).
M. Just, E. Kranakis, D. Krizanc and P. van Oorschot. On key distribution via true broadcasting. Proceedings of 2nd ACM Conference CCS, pp. 81–88 (1994).
H. Kurnio, L. McAven, R. Safavi-Naini and H. Wang. A dynamic group key distribution scheme with flexible user join. Proceedings of ICISC’02, LNCS 2587, Springer-Verlag, pp. 478–496 (2002).
H. Kurnio, R. Safavi-Naini and H. Wang. A group key distribution scheme with decentralised user join. Proceedings of SCN’02, LNCS 2576, Springer-Verlag, pp. 146–163 (2002).
D.A. McGrew and A.T. Sherman. Key establishment in large dynamic groups using one-way function trees. Manuscript (1998).
A. Mayer and M. Yung. Generalized secret sharing and group-key distribution using short keys. Proceedings of IEEE Conference on Compression and Complexity of Sequences, pp. 30–44 (1997).
M. Naor, B. Pinkas. Efficient trace and revoked schemes. Proceedings of Financial Cryptography’00, LNCS 1962, Springer-Verlag, pp. 1–20 (2000).
C. Padró and G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Transactions on Information Theory, 46(7), pp. 2596–2604 (2000).
B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its applications to electronic voting. Advances in Cryptology-Crypto’99, LNCS 1666, Springer-Verlag, pp. 148–164 (1999).
A. Shamir. How to share a secret. Communications of the ACM, 22, pp. 612–613 (1979).
G.J. Simmons, W. Jackson and K. Martin. The geometry of secret sharing schemes. Bulletin of the ICA 1, pp. 71–88 (1991).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daza, V., Herranz, J., Sáez, G. (2003). Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_40
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive