Highly Efficient Key Exchange Protocols with Optimal Tightness
Journal article, Peer reviewed
MetadataShow full item record
Original versionLecture Notes in Computer Science (LNCS). 2019, 11694 LNCS 767-797. 10.1007/978-3-030-26954-8_25
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, i.e., according to the bounds of the reductions. Specifically, our reductions have a security loss which is only linear in the number of users µ and constant in the number of sessions per user `. This is much better than most other key exchange proofs which are typically quadratic in the product µ`. Combined with the simplicity of our protocols, this implies that our protocols are more efficient than the state of the art when soundly instantiated. 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.