Sequential and Dynamic Frameproof Codes

Maura Paterson

(2007)

Maura Paterson (2007) Sequential and Dynamic Frameproof Codes. Designs, Codes and Cryptography, 42 (3). pp. 317-326. ISSN 0925-1022

Our Full Text Deposits

Full text access: Open


Links to Copies of this Item Held Elsewhere


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 tocombat 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 frameproof codes and l-dynamic-frameproof codes. We also give bounds on the number of users supported by such schemes.

Information about this Version

This is a Draft version
This version's date is: 03/02/2007
This item is peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/64f087c4-70dc-a381-cb26-2d94b8aaad37/1/

Item TypeJournal Article
TitleSequential and Dynamic Frameproof Codes
AuthorsPaterson, Maura
DepartmentsFaculty of Science\Mathematics

Identifiers

doi10.1007/s10623-006-9037-2

Deposited by () on 22-Feb-2010 in Royal Holloway Research Online.Last modified on 09-Jul-2010

Notes

(C) 2007 Springer Verlag LTD, whose permission to mount this version for private study and research is acknowledged.  The repository version is the author's final draft.

Keywords: frameproof codes, dynamic traitor tracing, cryptography

References

[1] S.R. Blackburn, Combinatorial schemes for protecting digital content, Sur-
veys in Combinatorics 2003, LMS lecture notes series, Vol. 307 (2003) pp.
43-78.

[2] S.R. Blackburn. Frameproof codes. SIAM Journal on Discrete Mathematics,
16(3):499-510, 2003.

[3] D. Boneh and J. Shaw, Collusion-secure ngerprinting for digital data, IEEE
Transactions on Information Theory, Vol. 44, No.5 (1998) pp. 1897-1905.

[4] B. Chor, A. Fiat, and M. Naor, Tracing traitors, Advances in Cryptology
-Crypto '94, Lecture Notes in Computer Science, Vol. 839 (1994) pp. 257-
270.

[5] G.D. Cohen and S.B. Encheva. Ecient constructions of frameproof codes.
Electronics Letters, 36:1849{1842, 2000.

[6] A. Fiat and T. Tassa, Dynamic traitor tracing, Advances in Cryptol-
ogy -Crypto '99, Lecture Notes in Computer Science, Vol. 1666 (1999)
pp. 354-371.

[7] R. Safavi-Naini and Y. Wang, Sequential traitor tracing, IEEE Transactions
on Information Theory, Vol. 49, No. 5 (2003) pp. 1319-1326.

[8] J.N. Staddon, D.R. Stinson and R. Wei. Combinatorial properties of frame-
proof and traceability codes. IEEE Transactions on Information Theory,
47:1024-1049, 2001.

[9] M.D. Swanson, M. Kobayashi, and A.H. Tew k, Multimedia data-
embedding and watermarking technologies, Proceedings of the IEEE, Vol.
86 (1998) pp. 1064-1087.

[10] T. Tassa. Low bandwidth dynamic traitor tracing schemes. J. Cryptology,
18(2):167-183, 2005.


Details