Computer Science – Cryptography and Security
Scientific paper
2006-10-06
Computer Science
Cryptography and Security
12 pages, 1 figure; (v2) tables revised, typos corrected, comments on some recent works added; (v3) submitted version, title c
Scientific paper
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 optimal finite distribution in order to decrease extra memory amount. By our result, the extra memory is reduced to 1/32 of the original, or even becomes needless, in some practical setting. Moreover, the code length is also reduced, e.g. to about 20.6% of Tardos code asymptotically. Finally, we address some other practical issues such as approximation errors which are inevitable in any real implementation.
Hagiwara Manabu
Imai Hideki
Nuida Koji
Watanabe Hajime
No associations
LandOfFree
Optimization of Memory Usage in Tardos's Fingerprinting Codes 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 Optimization of Memory Usage in Tardos's Fingerprinting Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of Memory Usage in Tardos's Fingerprinting Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634035