噪声环境下的最优密钥一致性
Optimal Key Consensus in Presence of Noise
摘要:
在这项工作中,我们通过引入和形式化构建工具(称为密钥共识(KC)及其非对称变体AKC),抽象了之前基于LWE和RLWE的密钥交换协议中的一些关键成分。KC和AKC允许通信双方从通过某种安全信息交换获得的接近值中达成共识。然后,我们发现任何KC和AKC的参数上界。KC和AKC是基于格的密码学的基础,在这个意义上,基于LWR,LWE和RLWE的密码原语列表(包括密钥交换,公钥加密等)可以从它们模块化地构建。作为一个概念上的贡献,这大大简化了这些密码系统的设计和分析在未来。然后,我们设计和分析一般和高度实用的KC和AKC计划,这是被称为OKCN和AKCN分别为演示简单。在KC和AKC的基础上,给出了LWR、LWE和RLWE密钥交换的一般构造。通用的构造允许我们的OKCN和AKCN计划,我们详细说明评估和选择的具体参数,以实现安全性,计算成本,带宽效率,出错率和操作简单性之间的最佳平衡的性能通用的实例。
英文摘要:
In this work, we abstract some key ingredients in previous LWE- and RLWE-based key exchange protocols, by introducing and formalizing the building tool, referred to as key consensus (KC) and its asymmetric variant AKC. KC and AKC allow two communicating parties to reach consensus from close values obtained by some secure information exchange. We then discover upper bounds on parameters for any KC and AKC. KC and AKC are fundamental to lattice based cryptography, in the sense that a list of cryptographic primitives based on LWR, LWE and RLWE (including key exchange, public-key encryption, and more) can be modularly constructed from them. As a conceptual contribution, this much simplifies the design and analysis of these cryptosystems in the future. We then design and analyze both general and highly practical KC and AKC schemes, which are referred to as OKCN and AKCN respectively for presentation simplicity. Based on KC and AKC, we present generic constructions of key exchange (KE) from LWR, LWE and RLWE. The generic construction allows versatile instantiations with our OKCN and AKCN schemes, for which we elaborate on evaluating and choosing the concrete parameters in order to achieve an optimally-balanced performance among security, computational cost, bandwidth efficiency, error rate, and operation simplicity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。