liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Codes for digital fingerprinting
Linköping University, Department of Electrical Engineering. Linköping University, The Institute of Technology.
2001 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Illegal, copying of data is a problem in many areas. Despite various efforts in copy protection and copyright enforcement the problem still exists, and with the growing use of digital means of storing and distributing data the problem seems to be getting worse.

Storing a unique, invisible marking in each distributed object is a possible way of dealing with the problem of illegal copying. That way, if an illegal copy is found somewhere, it is possible to find the original holder of the object. This type of scheme is called fingerprinting.

The thesis deals with codes for fingerprinting of digital data in the context of several users colluding to create an untraceable, illegal copy. Some theoretical bounds on the performance of such codes are presented. A general method to statistically test whether certain users have taken part in the creation of a particular illegal copy is presented, and pirate strategies that prevent this kind of testing are derived. A simple testing method is presented that tests whether a certain, proposed group of users should be considered guilty of having created a specific illegal fingerprint. The set of possible pirate strategies

is derived and a compact representation is presented. It is shown that the fingerprinting problem is fundamentally a game theoretical problem. Finally, a combinatorial performance measure for binary fingerprinting codes is presented, and several code constructions are analyzed using this measure.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2001. , p. 160
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 722
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-143519ISBN: 9173731307 (print)OAI: oai:DiVA.org:liu-143519DiVA, id: diva2:1164618
Public defence
2001-12-14, Key 1, Keyhuset, Campus Valla, Linköping, 15:15 (English)
Opponent
Available from: 2017-12-11 Created: 2017-12-11 Last updated: 2018-01-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

By organisation
Department of Electrical EngineeringThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 4 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf