Header menu link for other important links
X
Practical pay TV schemes
Published in
2003
Volume: 2727 LNCS
   
Pages: 192 - 203
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]. © 2003 Springer-Verlag Berlin Heidelberg.
About the journal
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN03029743
Open AccessNo
Concepts (20)
  •  related image
    BROADCAST ENCRYPTION
  •  related image
    Constant factors
  •  related image
    CRACKER IDENTIFICATION
  •  related image
    DATA REDUNDANCIES
  •  related image
    HIGH PROBABILITIES
  •  related image
    Memory requirements
  •  related image
    NUMBER OF SUBSCRIBERS
  •  related image
    PAY TV
  •  related image
    SET-TOP TERMINAL
  •  related image
    TRAITOR TRACING SCHEMES
  •  related image
    Upper limits
  •  related image
    BROADCAST ENCRYPTION
  •  related image
    DATA REDUNDANCY
  •  related image
    High probability
  •  related image
    NUMBER OF SUBSCRIBERS
  •  related image
    SECURE MEMORY
  •  related image
    TRAITOR TRACING SCHEMES
  •  related image
    Cryptography
  •  related image
    Cracks
  •  related image
    Security of data