TY - GEN
T1 - Short collusion-secure fingerprint codes against three pirates
AU - Nuida, Koji
PY - 2010
Y1 - 2010
N2 - In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30% to 40% of) the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009) with c∈=∈3. Some preliminary proposal for improving efficiency of our tracing algorithm is also given.
AB - In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30% to 40% of) the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009) with c∈=∈3. Some preliminary proposal for improving efficiency of our tracing algorithm is also given.
UR - http://www.scopus.com/inward/record.url?scp=78549253898&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78549253898&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-16435-4_8
DO - 10.1007/978-3-642-16435-4_8
M3 - Conference contribution
AN - SCOPUS:78549253898
SN - 364216434X
SN - 9783642164347
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 86
EP - 102
BT - Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers
T2 - 12th International Conference on Information Hiding, IH 2010
Y2 - 28 June 2010 through 30 June 2010
ER -