Skip to main content
SpringerLink
Log in

Sequential and dynamic frameproof codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blackburn SR (2003) Combinatorial schemes for protecting digital content. Surveys in combinatorics 2003. LMS lecture notes series, vol 307. pp 43–78

  2. Blackburn SR (2003) Frameproof codes. SIAM J Discrete Math 16(3):499–510

    Article  MATH  MathSciNet  Google Scholar 

  3. Boneh D, Shaw J (1998) Collusion-secure fingerprinting for digital data. IEEE Trans Inf Theory 44(5):1897–1905

    Article  MATH  MathSciNet  Google Scholar 

  4. Chor B, Fiat A, Naor M (1994) Tracing traitors. Advances in cryptology—crypto ’94. Lecture notes in computer science, vol 839. pp 257–270

  5. Cohen GD, Encheva SB (2000) Efficient constructions of frameproof codes. Electron Lett 36:1849–1842

    Article  Google Scholar 

  6. Fiat A, Tassa T (1999) Dynamic traitor tracing. Advances in cryptology—crypto ’99. Lecture notes in computer science, vol 1666. pp 354–371

  7. Safavi-Naini R, Wang Y (2003) Sequential traitor tracing. IEEE Trans Inf Theory 49(5):1319–1326

    Article  MATH  MathSciNet  Google Scholar 

  8. Staddon JN, Stinson DR, Wei R (2001) Combinatorial properties of frameproof and traceability codes. IEEE Trans Inf Theory 47:1024–1049

    Article  MathSciNet  Google Scholar 

  9. Swanson MD, Kobayashi M, Tewfik AH (1998) Multimedia data-embedding and watermarking technologies. Proc IEEE 86:1064–1087

    Article  Google Scholar 

  10. Tassa T (2005) Low bandwidth dynamic traitor tracing schemes. J. Cryptol 18(2):167–183

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, UK

    Maura Paterson

Authors
  1. Maura Paterson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maura Paterson.

Additional information

Communicated by D. Jungnickel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paterson, M. Sequential and dynamic frameproof codes. Des Codes Crypt 42, 317–326 (2007). https://doi.org/10.1007/s10623-006-9037-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-9037-2

Keywords

AMS Classifications

Search

Navigation