2018 Fiscal Year Research-status Report
New Paradigm to Construct Public Key Cryptographic Schemes for Lightweight Devices with Provable Security against Quantum Attackers
| Project/Area Number |
18K11292
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
SANTOSO BAGUS 電気通信大学, 大学院情報理工学研究科, 助教 (40571956)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
太田 和夫 電気通信大学, 大学院情報理工学研究科, 教授 (80333491)
|
|---|
| Project Period (FY) |
2018-04-01 – 2022-03-31
|
| Keywords | Quantum Random Oracle / Quantum Adversary / Binary Structure / Identification Scheme / Secrecy Amplification / Post Encryption |
|---|
| Outline of Annual Research Achievements |
In FY 2018, we have achieved several important results. As the first step of the plan, we have successfully construct a new computational problem with binary structure which is also estimated to be secure against quantum adversaries. Our new computational problem is an extension of the Isomorphism of Polynomials problem. One interesting feature of the new computational problem is that it enables us to perform Diffie-Hellman like operation. Its worst case is proven to be at least as hard as the original Isomorphism of Polynomials.
As another result, we also have successfully constructed a novel code-based signature scheme. We constructed the scheme with orientation on implementation, by taking into account the potential problem which may occur when we need to convert the output of hash function into a different basis. Since the scheme is proven secure based on the hardness assumption on a code-based computational problem with binary structure, the new signature scheme also has binary structure and thus is easy to implement on variety of devices.Furthermore, the signature scheme is also ready to be transformed into the one with security against quantum computers, since the security of the signature scheme is proven based on decisional computational problem which is proven to be NP complete.
Finally, we also have proposed a new secrecy amplification method for one-time-pad encryption using affine encoders in the following cases: (1)two nodes of encryption with correlated secret keys, or (2)a single node of encryption with leakage of keys due to side-channel attack.
|
| Current Status of Research Progress |
Current Status of Research Progress
2: Research has progressed on the whole more than it was originally planned.
Reason
During FY 2018, we used Kakenhi to purchase new computers, literature references, and to fund trips to conferences to gain the latest information about the related research and to have research discussion with other researchers. Thanks to the funding, during FY 2018 we were able to make our research to progress smoothly.
We have successfully published one article in a top-tier journal IEEE and four papers at two peer-reviewed international conferences. We also have published three papers at the technical reports of a major research society in Japan. Moreover, we have done five oral presentations on our results in two domestic symposiums.
|
| Strategy for Future Research Activity |
For FY 2019, we plan to carry out the following tasks:
(1) Construct a concrete cryptographic scheme based on the new computational
problem with binary structure that we have invented in FY 2018. If we can not construct any secure cryptographic scheme based on the new problem, we will go back to the computational problem to find an appropriate modification (without lessening the hardness) such that we can construct a cryptographic scheme and prove its security based on the hardness of the problem.
(2) Convert the security proof for the implementation oriented signature scheme which we have constructed in FY 2018 into security proof against quantum adversaries. First we will prove the security of the scheme against quantum adversaries with no-message attack and then we will prove that any quantum adversary with chosen message attack can be converted into a quantum adversary with no-message attack in our scheme.
(3) Extend the secrecy amplification method into the case where the adversary can launch side-channel attacks on two nodes of encryption. We expect that we need to apply the strong converse theorem in order to prove the security in the sense of strong secrecy.
|
| Causes of Carryover |
出張の費用が思ったより値段が低かったので、96,536円が残りました。次年度に更に出張が多くなるので、その旅費のために使うよていである。
|
