For fingerprinting for digital data and traitor tracing, several collusion secure codes have been proposed to enhance resilience against collusion attacks. Although the combinatorial relationships among some codes have already been discussed, there are still unrevealed relationships because of the inconsistency of the marking assumptions for the fingerprinting systems for which the codes are proposed. In this paper, we show systematic treatment of collusion secure codes. Namely, we formally define various marking assumptions suitable for most of the fingerprinting systems. Also, we show new relationships among the combined notions of codes and the assumptions. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Yoshioka, K., Shikata, J., & Matsumoto, T. (2003). Systematic treatment of collusion secure codes: Security definitions and their relations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2851, 408–421. https://doi.org/10.1007/10958513_31
Mendeley helps you to discover research relevant for your work.