




















Abstract:The commitment-based AKE model provides a formal security framework for key exchange protocols that avoid long-term cryptographic material, achieving authentication through a final out-of-band verification of session-derived values. Within this model, secure KA-based and KEM-based protocols were previously constructed via a commitment-based MT compiler, yielding optimized 4-pass protocols. In this work, we show that 3-pass protocols secure under this model exist for both primitives. These protocols are constructed ad hoc, following the core ideas of the commitment-based MT authenticator, and their SK security in the unauthenticated model is proved using the same game-based techniques, achieving bounds of the same form as those previously achieved. The resulting protocols provide one-way authentication in three message exchanges.
| Subjects: | Cryptography and Security (cs.CR) |
| Cite as: | arXiv:2605.23843 [cs.CR] |
| (or arXiv:2605.23843v1 [cs.CR] for this version) | |
| https://doi.org/10.48550/arXiv.2605.23843 arXiv-issued DOI via DataCite (pending registration) |
From: Rodrigo Martín Sánchez-Ledesma [view email]
[v1]
Fri, 22 May 2026 16:51:59 UTC (30 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。