| Collusion secure convolutional fingerprinting information codes |
| Full text |
Pdf
(378 KB)
|
| Source
|
ASIAN ACM Symposium on Information, Computer and Communications Security
archive
Proceedings of the 2006 ACM Symposium on Information, computer and communications security
table of contents
Taipei, Taiwan
SESSION: Authentication and biometrics
table of contents
Pages: 266 - 274
Year of Publication: 2006
ISBN:1-59593-272-0
|
|
Authors
|
|
Yan Zhu
|
Peking University, Beijing, China
|
|
Wei Zou
|
Peking University, Beijing, China
|
|
Xinshan Zhu
|
Peking University, Beijing, China
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 9, Downloads (12 Months): 59, Citation Count: 0
|
|
|
ABSTRACT
Digital Fingerprinting is a technique for the merchant who can embed unique buyer identity marks into digital media copy, and also makes it possible to identify "traitors" who redistribute their illegal copies. At present, the fingerprinting scheme generally have many difficulties and disadvantages for large-size uses problems involve in the code construction with shorter length and effective traitor tracing. To resolve these problems, this paper presents the definition of Fingerprinting Information Code and a practical construction method by composing of convolutional codes and generally fingerprinting codes based on Boneh-Shaw model. Its decoding algorithm is presented by introducing the ideal of 'Optional Code Subset' and improving Viterbi algorithm. The security properties and performance are proved and analyzed by theory and example. As the results, the proposed scheme has shorter information encoding length and achieves optimal traitor searching in larger number of buyers.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
A. Barg, G.R. Blakly, and G. Kabatiansky. Digital Fingerprinting Codes: Problem Statements, Constructions, Identification of Traitors. Technical report, DIMACS2001-52, 2001
|
| |
3
|
Y. Wang, S.-W. Lu, H.-L. Xu. A Digital Fingerprinting Algorithm Based on Binary Codes. Journal of software, 2003, 14(06): 1172--1177. (in Chinese)
|
| |
4
|
F. Ergun, J. Kilian, and R. Kumar, A note on the limits of collusion-resistant watermarks, in Eurocrypt '99, Lecture Notes in Computer Science 1592, Berlin: Springer--Verlag, 1999: 140--149.
|
| |
5
|
|
| |
6
|
M. Fernandez and M. Soriano. Identification of Traitors in Algebraic-Geometric Traceability Codes. in IEEE Trans. on Signal Processing. Supplement on Secure Media, 2004, 52(10): 3073--3077
|
| |
7
|
J. Kilian, F. T. Leighton, L. R. Matheson, T. G. Shamoon, R. E. Tarjan, and F. Zane. Resistance of Digital Watermarks to Collusive Attacks. Technical Report TR-585-98, Princeton University, Computer Science Department, July 1998. http://citeseer.ist.psu.edu/kilian98 resistance.html
|
| |
8
|
F. Chan and D. Haccoun. Adaptive Viterbi Decoding of Convolutional Codes over Memoryless Channels. IEEE Transactions on Communications, 1997, 45(11): 1389--1400.
|
| |
9
|
GD Forney Jr. Convolutional Codes I: Algebraic Structure, IEEE Trans. on Information Theory, IT-16(6), November, 1970: 720--738
|
| |
10
|
G. Cohen, S. Encheva, S. Litsyn. Intersecting codes and partially identifying codes. In International Workshop on Coding and Cryptography. Paris: Elsevier Press, 2001:139--147.
|
| |
11
|
|
| |
12
|
V. Guruswami and M. Sudan. Improved decoding of reed-solomon and algebraic-geometry codes. IEEE Trans. on Information Theory, 1999, 45(6):1757--1767.
|
| |
13
|
|
|