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. © 2003 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Daza, V., Herranz, J., & Sáez, G. (2003). Constructing general dynamic group key distribution schemes with decentralized user join. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2727 LNCS, pp. 464–475). https://doi.org/10.1007/3-540-45067-X_40
Mendeley helps you to discover research relevant for your work.