New Paradigm to Construct Public Key Cryptographic Schemes for Lightweight Devices with Provable Security against Quantum Attackers

为轻量级设备构建公钥加密方案的新范式，具有可证明的安全性，可抵御量子攻击者

基本信息

批准号：
18K11292
负责人：
SANTOSO BAGUS
金额：
$ 2.75万
依托单位：
The University of Electro-Communications
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (C)
财政年份：
2018
资助国家：
日本
起止时间：
2018-04-01 至 2024-03-31
项目状态：
已结题

项目摘要

In FY 2022, we successfully completed our proposed construction of the post-quantum interactive public-key identification (ID) scheme whose security is based on the hardness of MinRank problem. Since MinRank problem is a computational problem based on binary field, our ID scheme is directly representable in binary field. This makes our scheme to be easily implementable in today's real-world hardwares as most of them are constructed based on electronic circuits which execute binary field operation.We also successfully invented a new computational problem based on multivariate quadratic (MQ) polynomials which is proven to be NP-hard. Based on the new computational problem, we constructed a new post-quantum public-key ID scheme which is proven to be secure as long as the new computational problem is hard. Moreover, since the computational problem can be represented directly in binary field, the new ID scheme is also fully representable directly in binary field.In the other line of research, we successfully derived the capacity region for secure symmetric-key encryption under real-time side-channel attacks where the adversary obtains side-channel information on the secret key used during the encryption process.Finally, as a preparation for constructing post-quantum multi-signatures for blockchains, we also proposed a new framework to construct a tightly secure two-round multi-signature scheme. Based on the framework, we built a multi-signature scheme which is easy to implement securely using the standard elliptic curves.

在2022财年，我们成功地完成了拟议的量化后交互式公开标识（ID）方案的构建，其安全性是基于微小的问题的硬度。由于Minrank问题是基于二进制字段的计算问题，因此我们的ID方案在二进制字段中直接表示。这使得我们的方案在当今的现实世界硬件中可以轻松实现，因为它们中的大多数是基于执行二进制野外操作的电子电路来构建的。我们还成功地发明了基于多元二次（MQ）多项式的新计算问题，证明是NP-HARD。基于新的计算问题，我们构建了一种新的Quantum Public-Key ID方案，只要新的计算问题很难，该方案就被证明是安全的。此外，由于计算问题可以直接在二进制字段中表示，因此新的ID方案也可以直接在二进制领域中完全表示。区块链，我们还提出了一个新框架，以构建一个紧密安全的两轮多签名方案。基于框架，我们构建了一个多签名方案，该方案易于使用标准椭圆曲线安全地实现。

项目成果

期刊论文数量（44）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

事前通信モデルにおけるペアリングを用いない集約署名

预通信模型中无需配对的聚合签名

DOI：
发表时间：
2020
期刊：
影响因子：
0
作者：
竹牟禮薫;坂井祐介;Bagus Santoso;花岡悟一郎;太田和夫
通讯作者：
太田和夫

Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption

DOI：
10.1007/978-3-030-44223-1_19
发表时间：
2020-04
期刊：
影响因子：
0
作者：
Bagus Santoso
通讯作者：
Bagus Santoso

Achieving Pairing-Free Aggregate Signatures using Pre-Communication between Signers

使用签名者之间的预通信实现免配对聚合签名

DOI：
10.1587/transfun.2020dmp0023
发表时间：
2021
期刊：
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
影响因子：
0
作者：
K. Takemure;Y. Sakai;B. Santoso;G. Hanaoka;K. Ohta
通讯作者：
K. Ohta

Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher System