| 研究課題/領域番号 |
21K13830
|
|---|
| 研究機関 | 九州大学 |
|---|
研究代表者 |
顧 玉杰 九州大学, システム情報科学研究院, 助教 (50898731)
|
|---|
| 研究期間 (年度) |
2021-04-01 – 2025-03-31
|
| キーワード | secure code / list decoding / probabilistic method / dynamic traitor tracing / fingerprinting / copyright protection |
|---|
| 研究実績の概要 |
Traitor tracing is a mathematical approach for protecting the copyright of digital content against collusion attacks. This project studies combinatorial secure codes for traitor tracing, with a particular focus on exploring their largest code rate and efficient identification algorithms. The obtained results are as follows: 1) A new unified concept of secure codes with list decoding (SCLDs) is proposed by integrating the idea of list decoding into secure codes with complete traceability; 2) Bounds on the largest code rate of SCLDs are derived via the probabilistic method; 3) A two-step decoding algorithm is established for SCLDs, which outperforms known fingerprinting codes in efficiency; 4) A two-stage dynamic framework is proposed for dynamic traitor tracing; 5) New bounds on the largest code rate of binary multimedia IPP codes are established; 6) Several combinatorial and algebraic constructions are developed for SCLDs.
|
| 現在までの達成度 (区分) |
現在までの達成度 (区分)
2: おおむね順調に進展している
理由
The project is being conducted as planned and is progressing smoothly. New results on the largest code rate, explicit constructions, and decoding algorithms for secure codes with list decoding have been established as desired. These results have been summarized for publication in domestic and international conferences and journals.
|
| 今後の研究の推進方策 |
Based on the obtained results, we will further explore the trade-off between the code rate and decoding efficiency of secure codes for traitor tracing using combinatorial and information-theoretical techniques.
|
| 次年度使用額が生じた理由 |
We will further conduct experimental evaluations and attend domestic and international conferences to present the results obtained from this project.
|
