Paterson, Maura B. (2007) Sequential and dynamic frameproof codes. Designs, Codes and Cryptography 42 (3), pp. 317-326. ISSN 0925-1022.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text (Refereed)
seqdynam.pdf - Published Version of Record Restricted to Repository staff only Download (175kB) |
Abstract
There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes and traitor-tracing schemes. The concept of traitor-tracing has been applied to a digital broadcast setting in the form of dynamic traitor-tracing schemes and sequential traitor-tracing schemes, which could be used to combat piracy of pay-TV broadcasts, for example. In this paper, we extend the properties of frameproof codes to this dynamic model, defining and constructing both l-sequential c-frameproof codes and l-dynamic c-frameproof codes. We also give bounds on the number of users supported by such schemes.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | frameproof codes, dynamic traitor tracing, cryptography |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Maura Paterson |
| Date Deposited: | 17 Jan 2013 12:09 |
| Last Modified: | 09 Aug 2023 12:32 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/5367 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
