TY - GEN
T1 - A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure
AU - Nuida, Koji
PY - 2010
Y1 - 2010
N2 - A c-secure fingerprint code is called robust if it is secure against a limited number of bit erasure in undetectable positions in addition to usual collusion attacks. In this article, we propose the first general conversion method of (non-robust) c-secure codes to robust c-secure codes. It is also applicable to amplify robustness of given robust c-secure codes. By applying our conversion to c-secure codes given by Nuida et al. (AAECC 2007), we present robust c-secure codes with code lengths of order Θ(c2 log 2 c) with respect to c. The code length improves preceding results by Sirvent (WCC 2007) and by Boneh and Naor (ACM CCS 2008) and is close to the one by Billet and Phan (ICITS 2008), where our result is based on a weaker assumption than those preceding results. As an application, the use of the resulting code in construction by Boneh and Naor also improves their traitor tracing scheme against imperfect decoders in efficiency of key sizes and pirate tracing procedure.
AB - A c-secure fingerprint code is called robust if it is secure against a limited number of bit erasure in undetectable positions in addition to usual collusion attacks. In this article, we propose the first general conversion method of (non-robust) c-secure codes to robust c-secure codes. It is also applicable to amplify robustness of given robust c-secure codes. By applying our conversion to c-secure codes given by Nuida et al. (AAECC 2007), we present robust c-secure codes with code lengths of order Θ(c2 log 2 c) with respect to c. The code length improves preceding results by Sirvent (WCC 2007) and by Boneh and Naor (ACM CCS 2008) and is close to the one by Billet and Phan (ICITS 2008), where our result is based on a weaker assumption than those preceding results. As an application, the use of the resulting code in construction by Boneh and Naor also improves their traitor tracing scheme against imperfect decoders in efficiency of key sizes and pirate tracing procedure.
UR - http://www.scopus.com/inward/record.url?scp=78149238344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149238344&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-14496-7_16
DO - 10.1007/978-3-642-14496-7_16
M3 - Conference contribution
AN - SCOPUS:78149238344
SN - 3642144950
SN - 9783642144950
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 194
EP - 212
BT - Information Theoretic Security - 4th International Conference, ICITS 2009, Revised Selected Papers
T2 - 4th International Conference on Information Theoretic Security, ICITS 2009
Y2 - 3 December 2009 through 6 December 2009
ER -