Authenticated Tree-Based R-LWE Group Key Exchange

Authenticated Tree-Based R-LWE Group Key Exchange
复制标题

DOI:
10.1093/comjnl/bxab165
复制
发表时间:
2021-10
期刊:
Comput. J.
影响因子:
--
通讯作者:
Hector B. Hougaard;A. Miyaji
Hector B. Hougaard;A. Miyaji
中科院分区:
其他
文献类型:
--
作者:
Hector B. Hougaard;A. Miyaji

文献摘要

相似文献

我们提出了第一个常数轮,多播,认证树为基础的R-LWE组密钥交换协议的对数通信和内存的复杂性。我们的协议实现后量子安全,通过减少到一个Diffie-Hellman类似的模拟决策R-LWE问题。我们还提出了一个连续的版本,具有恒定的内存复杂性,但对数轮数和通信复杂性。
We present the first constant round, multicast, authenticated tree-based R-LWE group key exchange protocol with logarithmic communication and memory complexity. Our protocol achieves post-quantum security through a reduction to a Diffie–Hellman-like analogue to the decisional R-LWE problem. We also present a sequential version with constant memory complexity but a logarithmic number of rounds and communication complexity.