Paper 2010/640 Original: eprint.iacr.org/2010/640 ↗
Short collusion-secure fingerprint codes against three pirates
Abstract
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 (J. ACM, 2008) 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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2013-01-21: last updated
- 2010-12-21: published
- Short URL
- https://ia.cr/2010/640
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/640,
author = {Koji Nuida},
title = {Short collusion-secure fingerprint codes against three pirates},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/640},
year = {2010},
url = {https://eprint.iacr.org/2010/640}
}