• Computer Science
  • Published 2008

Optimization of Memory Usage in Tardos's Fingerprinting Codes

@inproceedings{Nuida2008OptimizationOM,
  title={Optimization of Memory Usage in Tardos's Fingerprinting Codes},
  author={Koji Nuida and Manabu Hagiwara and Hajime Watanabe and Hideki Imai},
  year={2008}
}
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… CONTINUE READING

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

An improvement of discrete Tardos fingerprinting codes

VIEW 8 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS

Hierarchical construction of Tardos code

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

On the systematic generation of Tardos’s fingerprinting codes

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

G

  • M. Hagiwara
  • Hanaoka and H. Imai, “A short random finger printing code against a small number of pirates,” in Proc. AAECC
  • 2006
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Analysis

  • N. L. Carothers, Real
  • 2000

Collusion-Secure Fingerprinting for Digital Data

VIEW 3 EXCERPTS

Una nuova disuguaglianza per gli zeri dei polinomi di Jacobi,

  • L. Gatteschi
  • Atti Accad. Sci. Torino, Cl. Sci. Fis. Mat. Nat. ,
  • 1968