Loading...
Loading...

Go to the content (press return)

A family of asymptotically good binary fingerprinting codes

Author
Cotrina, J.; Fernandez, M.
Type of activity
Journal article
Journal
IEEE transactions on information theory
Date of publication
2010-10
Volume
56
Number
10
First page
5335
Last page
5343
DOI
https://doi.org/10.1109/TIT.2010.2059470 Open in new window
Repository
http://hdl.handle.net/2117/10990 Open in new window
Abstract
A fingerprinting code is a set of codewords that are embedded in each copy of a digital object with the purpose of making each copy unique. If the fingerprinting code is c-secure with error, then the decoding of a pirate word created by a coalition of at most c dishonest users, will expose at least one of the guilty parties with probability 1-ϵ. The Boneh-Shaw fingerprinting codes are n-secure codes with ϵB error, where n also denotes the number of authorized users. Unfortunately, the length t...
Citation
Cotrina, J.; Fernandez, M. A family of asymptotically good binary fingerprinting codes. "IEEE transactions on information theory", Octubre 2010, vol. 56, núm. 10, p. 5335-5343.
Group of research
ISG - Information Security Group
WNG - Wireless Networks Group

Participants