New Security Index for Digital Fingerprinting and Its Bounds
スポンサーリンク
概要
- 論文の詳細を見る
Fingerprinting is one of the digital watermarking techniques, and is becoming more important as a copyright protection technique. Fingerprinting must resist collusion attacks. As a security index, "c-secureness" has been proposed, but it has been known that there is indeed no c-secure code. In this paper, we introduce a new index to measure the resilience of fingerprinting for collusion attacks and obtain some upper bounds and a lower bound on the index.
- 社団法人電子情報通信学会の論文
- 2003-05-01
著者
-
Nishizeki T
Tohoku Univ. Sendai Jpn
-
Nishizeki Takao
Tohoku Univ. Sendai‐shi Jpn
-
MIZUKI Takaaki
Information Synergy Center, Tohoku University
-
ORIHARA Shingo
NTT Information Sharing Platform Laboratories, NTT Corporation
-
ORIHARA Shingo
Graduate School of Information Sciences, Tohoku University
-
NISHIZEKI Takao
PRESTO, JST.
-
Orihara Shingo
Ntt Information Sharing Platform Laboratories Ntt Corporation
-
Mizuki T
Information Synergy Center Tohoku University
-
Mizuki Takaaki
Information Synergy Center Tohoku University
関連論文
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Edge-Coloring Problems for Graphs
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- New Security Index for Digital Fingerprinting and Its Bounds
- Bipartition of Biconnected Graphs
- On the Average Length of Secret Key Exchange Eulerian Circuits(Special Section on Discrete Mathematics and Its Applications)