| Project/Area Number |
21K13830
|
|---|
| Research Category |
Grant-in-Aid for Early-Career Scientists
|
| Allocation Type | Multi-year Fund |
|---|
| Review Section |
Basic Section 12030:Basic mathematics-related
|
|---|
| Research Institution | Kyushu University |
|---|
Principal Investigator |
顧 玉杰 九州大学, システム情報科学研究院, 助教 (50898731)
|
|---|
| Project Period (FY) |
2021-04-01 – 2025-03-31
|
| Project Status |
Granted (Fiscal Year 2023)
|
| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2023: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2022: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2021: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | secure code / list decoding / probabilistic method / dynamic traitor tracing / fingerprinting / copyright protection / traitor tracing / code rate / decoding algorithm / fingerprinting code / multimedia IPP code / collusion attack / dynamic tracing / Broadcast Encryption / Traitor Tracing / Key Assignment Scheme / Combinatorial Method / Identifying Algorithm |
|---|
| Outline of Research at the Start |
Digital media plays a key role in our daily life. Protection against digital content copyright violation is an important but difficult challenge. The traitor tracing method provides an effective way to resist collusion attacks of illegal key redistribution for broadcast encryption. The objective of this project is to analyze and construct traitor tracing key assignment schemes using combinatorial methods, and to build efficient tracing algorithms by virtue of coding-theoretic techniques.
|
| Outline of Annual Research Achievements |
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.
|
| Current Status of Research Progress |
Current Status of Research Progress
2: Research has progressed on the whole more than it was originally planned.
Reason
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.
|
| Strategy for Future Research Activity |
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.
|
