Abstract
In broadcast networks, it is often required to encrypt data so that only a privileged set of users with access to the session key can access the data. The standard technique of transferring the session key to each user individually does not scale with the number of users typically found on a network such as cable. This method is not only time-wise inefficient, but also incurs high communication cost. To counter this, a number of approaches have been proposed in the literature that include methods based on secret sharing schemes, construction of subset covers using combinatorial designs, etc.
In this paper, we propose and study two natural combinatorial optimization problems related to the subset cover framework for broadcast encryption. Here our objective is to minimize the communication cost given certain security and storage related constraints. We first derive lower bounds for the optimal communication cost for both problems. Then we propose the Partition-and-Power (PaP) subset cover scheme and show that it can provide a secure broadcast encryption with the communication costs matching those lower bounds. We illustrate the merits of the PaP scheme through a few examples and compare it with some of the prevailing subset cover schemes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdalla, M., Shavitt, Y., Wool, A.: Towards making broadcast encryption practical. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, pp. 140–157. Springer, Heidelberg (1999)
Berkovits, S.: How to Broadcast a Secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 536–541. Springer, Heidelberg (1991)
Blundo, C., Cresti, A.: Space Requirements for Broadcast Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 287–298. Springer, Heidelberg (1995)
Blundo, C., Frota Mattos, L.A., Stinson, D.R.: Tradeoffs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 387–400. Springer, Heidelberg (1996)
Chiou, G.H., Chen, W.T.: Secure Broadcasting Using the Secure Lock. IEEE Transactions on Software Engineering SE-15(8), 929–934 (1989)
Diestel, R.: Graph Theory. Springer, Heidelberg (2005)
Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Halevy, D., Shamir, A.: The LSD Broadcast Encryption Scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Luby, M., Staddon, J.: Combinatorial Bounds for Broadcast Encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 512–526. Springer, Heidelberg (1998)
Naor, D., Naor, M., Lotspiech, J.: Revocation and Tracing Schemes for Stateless Receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Stinson, D.R.: On some methods for unconditionally secure key distribution and broadcast encryption. Designs, Codes and Cryptography 12, 215–243 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aravamuthan, S., Lodha, S. (2005). An Optimal Subset Cover for Broadcast Encryption. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds) Progress in Cryptology - INDOCRYPT 2005. INDOCRYPT 2005. Lecture Notes in Computer Science, vol 3797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596219_18
Download citation
DOI: https://doi.org/10.1007/11596219_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30805-8
Online ISBN: 978-3-540-32278-8
eBook Packages: Computer ScienceComputer Science (R0)