| Project/Area Number |
18K11292
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 60070:Information security-related
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
SANTOSO Bagus 電気通信大学, 大学院情報理工学研究科, 准教授 (40571956)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
太田 和夫 電気通信大学, 大学院情報理工学研究科, 特任教授 (80333491)
|
|---|
| Project Period (FY) |
2018-04-01 – 2024-03-31
|
| Project Status |
Completed (Fiscal Year 2023)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2021: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2020: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | quantum adversaries / encryption / authentication / digital signatures / privacy amplification / BKW Algorithm / Tensor Rank Problem / LPN Problem / Multi-Signature / Zero-Knowledge / post-quantum / identification scheme / MQ polynomials / MinRank problem / encryption scheme / NP-hard / multivariate polynomials / aggregate signatures / Quantum Adversary / Unbounded Adversary / Encryption / Quantum Random Oracle / Binary Structure / Identification Scheme / Secrecy Amplification / Post Encryption / Public key Cryptography / Provable Security / Lightweight Cryptography |
|---|
| Outline of Final Research Achievements |
The research to construct practical quantum computers is making dramatic progress. However, the ability of quantum computers to efficiently solve prime factorization and discrete logarithm problems poses a threat to standard cryptography schemes, which rely on the difficulty of these problems for their security. Several cryptographic schemes have been designed to withstand attacks from quantum computers, but most of them suffer from issues related to theoretical security guarantees and implementation feasibility. In this research project, we have successfully developed cryptographic schemes that solve these problems based on the following paradigms: schemes with pure binary field representation, decision-type computational problems that are challenging even for quantum computers, and information-theoretic security. The results of this project have already been published in several journals and presented at peer-reviewed international conferences.
|
| Academic Significance and Societal Importance of the Research Achievements |
This project provided cryptographic schemes which are not only ensure security against quantum computers but are also implementable in practice. These schemes will safeguard the interconnected individuals in the next-generation network against the next-generation adversaries with quantum computers.
|
