Short collusion-secure fingerprint codes against three pirates

Details Short collusion-secure fingerprint codes against three pirates Short collusion-secure fingerprint codes against three pirates

2010-12-15

arxiv.org/abs/1012.3340v1

Computer Science

Cryptography and Security

20 pages, a preliminary version was presented at Information Hiding 2010, Calgary, Canada, June 28-30, 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Short collusion-secure fingerprint codes against three pirates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Short collusion-secure fingerprint codes against three pirates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short collusion-secure fingerprint codes against three pirates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14022