14.Cnf-665 Paper View Page |
Title |
Polynomial-Time Decodable Fingerprinting Codes for Multimedia |
![](Images/DownloadPaper.png) |
Authors |
, , ,
|
Abstract |
Digital fingerprinting codes to protect copyrights
of distributed contents in a multimedia distributing system are
considered. In digital fingerprinting, collusion attacks, in which
several fingerprinted copies of the same content are mixed to
create a forged content, should be deterred. In this paper, a
concatenated coding scheme, in which an error-correcting code
is concatenated with a collusion-secure code, is proposed. The new
fingerprinting codes require only polynomial-time complexity
in the overall code length for encoding and decoding, while
they guarantee the perfect detection of all the colluders in
the absence of noise. A sufficient condition on outer codes’
parameters assuring error correcting capability as well as the
perfect detection of colluders is also derived, which is important
in the presence of noise. |
Track |
MMC: Multimedia Communications |
Conference |
3rd Mosharaka International Conference on Communications, Networking and Information Technology (MIC-CNIT 2009) |
Congress |
2009 Global Congress on Communications, Networking and Information Technology (GC-CNIT 2009), 21-23 December 2009, Amman, Jordan |
Pages |
36-41 |
Topics |
Multimedia Coding and Compression Multimedia Signal Processing |
ISSN |
2227-331X |
DOI |
|
BibTeX |
@inproceedings{665CNIT2009,
title={Polynomial-Time Decodable Fingerprinting Codes for Multimedia},
author={ },
booktitle={2009 Global Congress on Communications, Networking and Information Technology (GC-CNIT 2009)},
year={2009},
pages={36-41},
doi={}},
organization={Mosharaka for Research and Studies}
}
|
Paper Views |
33 |
Paper Views Rank |
354/524 |
Paper Downloads |
41 |
Paper Downloads Rank |
36/524 |
|
|