Abstract
A key distribution scheme for broadcast encryption is proposed. It is based on block designs. In this scheme a centre provides each user (receiver) of the system with a set of keys. If at a later stage, some users are no longer entitled to the messages, they should also no longer be able to decrypt them. This should even be the case if these illegitimate users can form a coalition and exchange the keys that they have obtained before (provided that the size of this coalition does not exceed some value).
By means of block designs a tradeoff can be made between the size of the largest admissible coalition and the total length of the keys that each user has to store. The proposed system is unconditionally secure and seems better suited for large coalitions than existing schemes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Fiat and M. Naor, “Broadcast Encryption,” Advances in Cryptology, Proc. CRYPTO'93, D. R. Stinson, Ed., Lecture Notes in Computer Science 773, Springer Verlag, Berlin, pp. 480–491, 1994.
E. F. Assmus and J. D. Key, Designs and Their Codes, Cambr. Univ. Press, 1993.
L. Lovász, “On the ratio of optimal integral and fractional covers,” Discrete Math., 13, 383–390, 1975.
S. K. Stein, “Two combinatorial covering theorems,” J. Comb. Theory, Ser. A, 16, 391–397, 1974.
Z. Fúredi, “Matchings and coverings in hypergraphs,” Graphs and Combinatorics, 4, 115–206, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korjik, V., Ivkov, M., Merinovich, Y., Barg, A., van Tilborg, H.C.A. (1995). A broadcast key distribution scheme based on block designs. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_2
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive