Skip to main content
SpringerLink
Log in

Equidistant Binary Fingerprinting Codes Existence and Identification Algorithms

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3481))

Included in the following conference series:

  • 1631 Accesses

Abstract

The fingerprinting technique consists in making the copies of a digital object unique by embedding a different set of marks in each copy. However, a coalition of dishonest users can create pirate copies that try to disguise their identities. We show how equidistant, binary codes that can be used as fingerprinting codes.

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

Access this chapter

Log in via an institution
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. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  4. Wagner, N.: Fingerprinting. In: Proceedings of the 1983 IEEE Symposium on Security and Privacy, April 1983, pp. 18–22 (1983)

    Google Scholar 

  5. 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

  1. Department of Telematics Engineering, Universitat Politècnica de Catalunya, C/ Jordi Girona 1 i 3, Campus Nord, Mod C3, UPC, 08034, Barcelona, Spain

    Marcel Fernandez, Miguel Soriano & Josep Cotrina

Authors
  1. Marcel Fernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel Soriano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josep Cotrina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernandez, M., Soriano, M., Cotrina, J. (2005). Equidistant Binary Fingerprinting Codes Existence and Identification Algorithms. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424826_56

Download citation

  • DOI: https://doi.org/10.1007/11424826_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25861-2

  • Online ISBN: 978-3-540-32044-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation