Sliding-window dynamic frameproof codes

Authors:
Maura Paterson
Affiliations:
Department of Mathematics, Royal Holloway, University of London, Egham, UK TW20 0EX
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 7
Cited 0

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
Efficient Dynamic Traitor Tracing

SIAM Journal on Computing
Low Bandwidth Dynamic Traitor Tracing Schemes

Journal of Cryptology
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
New results on frame-proof codes and traceability schemes

IEEE Transactions on Information Theory
Asymptotic bounds on frameproof codes

IEEE Transactions on Information Theory
Sequential traitor tracing

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper, we formally define sliding-window dynamic frameproof codes and provide optimal constructions for a certain class of these schemes. We also discuss bounds on the number of users such schemes can support.