A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we unveil basic properties of a code Γq for digital fingerprinting based on a projective plane of order q. We consider a situation where a coalition of malicious users generates a pirated digital content in which a binary sequence w is embedded subject to the marking assumption. Here, the size of the coalition is assumed to be less than or equal to a known constant c ≥ 2. We evaluate the number of candidates of the coalition that can also generate w subject to the marking assumption. It is shown that the number of such candidates is completely determined as a function of w for the case of c=2. In addition, we give a sufficient condition under which all the malicious users are correctly identified from w for the case of c &;ge 3. Relationships between Γq and other existing classes of codes are discussed as well.
- (社)電子情報通信学会の論文
- 2011-01-01
著者
-
MINAMI Yusuke
Graduate School of Systems and Information Engineering, University of Tsukuba
-
Koga Hiroki
Graduate School Of Systems And Information Engineering University Of Tsukuba
-
Minami Yusuke
Graduate School Of Systems And Information Engineering University Of Tsukuba
-
KOGA Hiroki
Graduate School of Engineering, The University of Tokyo
関連論文
- A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
- On the Asymptotic Behaviors of the Recurrence Time with Fidelity Criterion for Discrete Memoryless Sources and Memoryless Gaussian Sources
- A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
- The Optimal (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels
- New Results on Optimistic Source Coding(Information Theory)(Information Theory and Its Applications)
- Four Limits in Probability and Their Roles in Source Coding
- Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes