Highly Efficient Key Exchange Protocols with Optimal Tightness - Enabling real-world deployments with theoretically sound parameters
Highly Efficient Key Exchange Protocols with Optimal Tightness - Enabling real-world deployments with theoretically sound parameters
复制标题
DOI：
10.1007/978-3-030-26954-8_25
复制
发表时间：
2019-08
期刊：
影响因子：
--
通讯作者：
Katriel Cohn-Gordon;Cas J. F. Cremers;Kristian Gjøsteen;Håkon Jacobsen;Tibor Jager
中科院分区：
文献类型：
--
作者：
Katriel Cohn-Gordon;Cas J. F. Cremers;Kristian Gjøsteen;Håkon Jacobsen;Tibor Jager
在本文中，我们以信号和噪声协议的风格对现代隐式认证的 Diffie-Hellman 协议进行了近乎严格的简化，这些协议非常简单且高效。与以前的方法不同，近乎严格的证明和高效协议的结合实现了第一个现实世界的实例化，可以以理论上合理的方式选择参数。我们的减少仅在用户数量上产生线性损失，这意味着当使用理论上合理的参数实例化时，我们的协议比现有技术更有效。我们还证明我们的安全证明是最佳的：对于我们的协议来说，用户数量的线性损失是不可避免的，以实现大规模和自然的减少。
In this paper we give nearly-tight reductions for modern implicitly authenticated Diffie-Hellman protocols in the style of the Signal and Noise protocols, which are extremely simple and efficient. Unlike previous approaches, the combination of nearly-tight proofs and efficient protocols enables the first real-world instantiations for which the parameters can be chosen in a theoretically sound manner.Our reductions have only a linear loss in the number of users, implying that our protocols are more efficient than the state of the art when instantiated with theoretically sound parameters. We also prove that our security proofs are optimal: a linear loss in the number of users is unavoidable for our protocols for a large and natural class of reductions.