Abstract
Codes with traceability properties are used in schemes where the identification of users that illegally redistribute content is required. For any code with traceability properties, the Identifiable Parent Property (c-IPP) seems to be less restrictive than the Traceability (c-TA) property. In this paper, we show that for Reed-Solomon codes both properties are in many cases equivalent. More precisely, we show that for an [n,k,d] Reed-Solomon code, defined over a field that contains the n - d roots of unity, both properties are equivalent. This answers a question posted by Silverberg et al. in [10,11], for a large family of Reed-Solomon codes.
Original language | English |
---|---|
Title of host publication | Emerging Challenges for Security, Privacy and Trust - 24th IFIP TC 11 International Information Security Conference, SEC 2009, Proceedings |
Editors | Dimitris Gritzalis, Javier Lopez |
Publisher | Springer New York LLC |
Pages | 87-97 |
Number of pages | 11 |
ISBN (Print) | 9783642012433 |
DOIs | |
State | Published - 2009 |
Externally published | Yes |
Event | 24th IFIP TC11 International Information Security Conference, SEC 2009 - Pafos, Cyprus Duration: May 18 2009 → May 20 2009 |
Publication series
Name | IFIP Advances in Information and Communication Technology |
---|---|
Volume | 297 |
ISSN (Print) | 1868-4238 |
Conference
Conference | 24th IFIP TC11 International Information Security Conference, SEC 2009 |
---|---|
Country/Territory | Cyprus |
City | Pafos |
Period | 05/18/09 → 05/20/09 |
Funding
This work has been supported in part by the Spanish Research Council (CICYT) Project TSI2005-07293-C02-01 (SECONNET), by CICYT Project TEC2006-04504, TEC2008-06663-C03-0 P2PSEC and by CONSOLIDER CSD2007-00004 “ARES”, funded by the Spanish Ministry of Science and Education.