Corpus ID: 7480867

Optimization of Memory Usage in Tardos's Fingerprinting Codes

  title={Optimization of Memory Usage in Tardos's Fingerprinting Codes},
  author={K. Nuida and M. Hagiwara and H. Watanabe and H. Imai},
  journal={arXiv: Cryptography and Security},
It is known that Tardos's collusion-secure probabilistic fingerprinting code (Tardos code; STOC'03) has length of theoretically minimal order with respect to the number of colluding users. However, Tardos code uses certain continuous probability distribution in codeword generation, which creates some problems for practical use, in particular, it requires large extra memory. A solution proposed so far is to use some finite probability distributions instead. In this paper, we determine the… Expand
6 Citations

Figures, Tables, and Topics from this paper

An improvement of discrete Tardos fingerprinting codes
  • 90
  • PDF
On the systematic generation of Tardos’s fingerprinting codes
  • 14
Hierarchical construction of Tardos code
  • 6
Two-level Tardos fingerprinting code
  • 1
High rate fingerprinting codes and the fingerprinting capacity
  • 85
  • Highly Influenced
  • PDF
Random Codes and Graphs for Secure Communication
  • 3


Tardos Fingerprinting is Better Than We Thought
  • 100
  • PDF
A Short Random Fingerprinting Code Against a Small Number of Pirates
  • 21
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
  • 136
  • PDF
A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users
  • 7
Collusion-Secure Fingerprinting for Digital Data
  • 485
  • PDF
Collusion-Secure Fingerprinting for Digital Data
  • 760
  • PDF
  • 3,999
  • PDF
Orthogonal Polynomials
  • 5,504
  • Highly Influential
  • PDF
  • Hanaoka and H. Imai, “A short random finger printing code against a small number of pirates,” in Proc. AAECC
  • 2006