MODRED：基于代码的非交互式密钥交换协议

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-10-28 DOI:10.1016/j.tcs.2024.114943

Junling Pei, Fang-Wei Fu

{"title":"MODRED：基于代码的非交互式密钥交换协议","authors":"Junling Pei, Fang-Wei Fu","doi":"10.1016/j.tcs.2024.114943","DOIUrl":null,"url":null,"abstract":"<div><div>How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interactive error reconciliation mechanism is presented and applied to MODRED, which enables the two sides of communication to “approximately agree” on the shared key. This is of great significance because it may lead to a more generic framework construction. Furthermore, our proposal is competitive and practical. We provide an initial choice of parameters for MODRED, tailored to 120-bit post-quantum security level, yielding the public keys of less than 1.2 MBs.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1021 ","pages":"Article 114943"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MODRED: A code-based non-interactive key exchange protocol\",\"authors\":\"Junling Pei, Fang-Wei Fu\",\"doi\":\"10.1016/j.tcs.2024.114943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interactive error reconciliation mechanism is presented and applied to MODRED, which enables the two sides of communication to “approximately agree” on the shared key. This is of great significance because it may lead to a more generic framework construction. Furthermore, our proposal is competitive and practical. We provide an initial choice of parameters for MODRED, tailored to 120-bit post-quantum security level, yielding the public keys of less than 1.2 MBs.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1021 \",\"pages\":\"Article 114943\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524005607\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005607","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

如何构建基于编码理论的非交互式密钥交换（NIKE）协议是一个有待解决的问题。本文提出了第一个基于编码的 NIKE 协议 MODRED，其安全性依赖于受限综合解码（R-SD）问题及其变体的硬度。我们提出了一种非交互式错误调节机制，并将其应用于 MODRED，使通信双方能够 "近似同意 "共享密钥。这一点意义重大，因为它可能会带来更通用的框架构建。此外，我们的建议具有竞争力和实用性。我们提供了 MODRED 的初始参数选择，根据 120 位后量子安全级别进行了定制，产生的公钥小于 1.2 MB。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

MODRED: A code-based non-interactive key exchange protocol

How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interactive error reconciliation mechanism is presented and applied to MODRED, which enables the two sides of communication to “approximately agree” on the shared key. This is of great significance because it may lead to a more generic framework construction. Furthermore, our proposal is competitive and practical. We provide an initial choice of parameters for MODRED, tailored to 120-bit post-quantum security level, yielding the public keys of less than 1.2 MBs.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.