Skip to main content

Identification of Traitors Using a Trellis

  • Conference paper
Information and Communications Security (ICICS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3269))

Included in the following conference series:

  • 824 Accesses

Abstract

In a fingerprinting scheme a different set of marks is embedded in each copy of a digital object, in order to deter illegal redistribution. A group of dishonest users, called traitors, collude to create a pirate copy that hides their identities, by putting together different parts of their copies. If the sets to be embedded are the codewords of an error correcting code then efficient algorithms can be used to trace the traitors. In this paper we present a tracing algorithm, that by applying the Viterbi algorithm to the trellis representation of a cyclic traceability code, finds all possibly identifiable traitors.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Forney, G.D.: The Viterbi algorithm. Proc. IEEE 61, 268–278 (1973)

    Article  MathSciNet  Google Scholar 

  3. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraicgeometry codes. IEEE Trans. Inform. Theory 45(6), 1757–1767 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Seshadri, N., Sundberg, C.-E.W.: List Viterbi decoding algorithms with applications. IEEE Trans. Comm. 42, 313–323 (1994)

    Article  Google Scholar 

  6. Silverberg, A., Staddon, J., Walker, J.: Applications of list decoding to tracing traitors. IEEE Trans. Inform. Theory 49(5), 1312–1318 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory 47(3), 1042–1049 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wolf, J.K.: Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. Inform. Theory 24, 76–80 (1978)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernandez, M., Soriano, M. (2004). Identification of Traitors Using a Trellis. In: Lopez, J., Qing, S., Okamoto, E. (eds) Information and Communications Security. ICICS 2004. Lecture Notes in Computer Science, vol 3269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30191-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30191-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23563-7

  • Online ISBN: 978-3-540-30191-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics