Abstract
We propose an efficient and robust Pay TV scheme for the case when there are a number of streams, as opposed to just one. In our model, the broadcast is divided into billing periods; during each billing period the entitlement of the users does not change. We achieve full flexibility with only a constant factor data redundancy. Our scheme has very little secure memory requirements and does not require the users’ secure keys to be changed once they have been written into the secure memory. There is also no upper limit on the number of subscribers. We extend this scheme to have the cracker identification property: If a collusion of less than t users crack their set-top terminals and produce a new decryption key, the exact set of crackers can be efficiently identified with high probability. This property is similar to but different from the traitor tracing schemes of Chor et al [5].
Financial support from Ministry of Information Technology, Government of Korea is acknowledged.
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
M. Abdalla, Y. Shavitt, and A. Wool. Towards making broadcast encryption practical. In Financial Cryptography, volume 1648 of LNCS, pages 140–157, 1999.
C. Blundo and A. Cresti. Space requirements for broadcast encryption. In Advances in Cryptology, Eurocrypt’ 94, volume 950 of LNCS, pages 287–298, 1994.
C. Blundo, L. A. Frotta Mattos, and D. R. Stinson. Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution. In Advances in Cryptography, CRYPTO’ 96, LNCS, pages 387–400, 1996.
D. Boneh and M. Franklin. An efficient public key traitor tracing scheme. In Proc. 19th International Advances in Cryptology Conference — CRYPTO’ 99, pages 338–353, 1999.
B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Advances in cryptology — CRYPTO’ 94, volume 839 of LNCS, pages 257–270, 1994.
J. L. Cohen, M. H. Etzel, D. W. Faucher, and D. N. Heer. Security for broadband digital networks. In Communications Technology, pages 58–69, 1995.
A. Fiat and M. Naor. Broadcast encryption. In Advances in Cryptology, CRYPTO’ 93, volume 773 of LNCS, 1994.
M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Advances in Cryptology, Eurocrypt’ 98, volume 1403 of LNCS, pages 512–526, 1998.
J. McCormac. European scrambling systems 5. Waterford University Press, Waterford, Ireland, 1996.
Y. Mu and V. Varadharajan. Robust and secure broadcast. In Progress In Cryptology — Indocrypt 2001, volume 2247 of LNCS, pages 223–231, 2001.
M. Naor and B. Pinkas. Threshold traitor tracing. In Advances in cryptology — CRYPTO’98, volume 1462 of Lecture Notes in Computer Science (LNCS), pages 502–517, 1998.
A. Wool. Key management for encrypted broadcast. In 5th ACM conference on Computer and Communications Security, pages 7–16, 1998.
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
Narayanan, A., Rangan, C.P., Kim, K. (2003). Practical Pay TV Schemes. 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_17
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_17
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