dc.contributor.author | Pan, Jiaxin | |
dc.contributor.author | Qian, Chen | |
dc.contributor.author | Ringerud, Magnus | |
dc.date.accessioned | 2021-10-28T06:36:50Z | |
dc.date.available | 2021-10-28T06:36:50Z | |
dc.date.created | 2021-07-31T12:25:58Z | |
dc.date.issued | 2021 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://hdl.handle.net/11250/2826106 | |
dc.description.abstract | We propose the first tight security proof for the ordinary two-message signed Diffie-Hellman key exchange protocol in the random oracle model. Our proof is based on the strong computational Diffie-Hellman assumption and the multi-user security of a digital signature scheme. With our security proof, the signed DH protocol can be deployed with optimal parameters, independent of the number of users or sessions, without the need to compensate any security loss. We abstract our approach with a new notion called verifiable key exchange.
In contrast to a known tight three-message variant of the signed Diffie-Hellman protocol (Gjøsteen and Jager, CRYPTO 2018), we do not require any modification to the original protocol, and our tightness result is proven in the “Single-Bit-Guess” model which we known can be tightly composed with symmetric cryptographic primitives to establish a secure channel. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.title | Signed Diffie-Hellman Key Exchange with Tight Security | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | This is the authors' accepted manuscript to an article published by Springer. | en_US |
dc.source.journal | Lecture Notes in Computer Science (LNCS) | en_US |
dc.identifier.doi | https://doi.org/10.1007/978-3-030-75539-3_9 | |
dc.identifier.cristin | 1923225 | |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |