Practical pay TV schemes

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 428
  • Download : 869
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.
Publisher
Springer-Verlag
Issue Date
2003-07-09
Language
English
Citation

8th Australasian Conference on Information Security and Privacy, ACISP 2003, pp.192 - 203

ISSN
0302-9743
URI
http://hdl.handle.net/10203/16014
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0