Improvement of collusion secure convolutional fingerprinting information codes

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents, analyzes and improves the false positive problem detected in Convolutional Fingerprinting Information Codes presented by Zhu et al. The codes are a concatenation of a convolutional code and a Boneh-Shaw code. In their paper Zhu et al. present a code construction that is not necessarily c-secure with ε-error because in their modified detection algorithm the standard Viterbi error probability analysis cannot be directly applied. In this case we show that false positives appear, that is to say, the problem of accusing an innocent and legal user of an illegal redistribution. In this paper, we give a bound on the probability of false positives and justify it analytically and by simulations. Moreover, some guidelines for a correct design of this family of codes is also given. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tomàs-Buliart, J., Fernandez, M., & Soriano, M. (2009). Improvement of collusion secure convolutional fingerprinting information codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4883 LNCS, pp. 76–88). https://doi.org/10.1007/978-3-642-10230-1_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free