Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A family of asymptotically good binary fingerprinting codes

Autor
Cotrina, J.; Fernandez, M.
Tipus d'activitat
Article en revista
Revista
IEEE transactions on information theory
Data de publicació
2010-10
Volum
56
Número
10
Pàgina inicial
5335
Pàgina final
5343
DOI
https://doi.org/10.1109/TIT.2010.2059470 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/10990 Obrir en finestra nova
Resum
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...
Citació
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.
Grup de recerca
ISG - Grup de Seguretat de la Informació
WNG - Grup de xarxes sense fils

Participants