Abstract
In this paper we consider c-secure fingerprinting codes for copyright protection. We construct a probabilistic fingerprint code and show that at least one colluder in a coalition of up to c users can be traced with high probability. We prove that this code is shorter than the Boneh-Shaw code. In addition, we show that it is asymptotically optimal when c is constant. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Van Le, T., Burmester, M., & Hu, J. (2003). Short c-secure fingerprinting codes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2851, 422–427. https://doi.org/10.1007/10958513_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
