Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/4786
Title: Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS (extended version)
Authors: Ustaoğlu, Berkant
Keywords: Public key cryptography
Key agreement protocols
MQV
Provable security
HMQV
Issue Date: 2009
Publisher: International Association for Cryptologic Research
Source: Ustaoğlu, B. (2009). Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS (extended version). Cryptology ePrint Archive, Report 2007/123. http://eprint.iacr.org/2007/123
Abstract: LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also described a protocol, called NAXOS, that enjoys a simple security proof in the new model. Compared to MQV and HMQV, NAXOS is less efficient and cannot be readily modified to obtain a one-pass protocol. On the other hand MQV does not have a security proof, and the HMQV security proof is extremely complicated. This paper proposes a new authenticated key agreement protocol, called CMQV (`Combined' MQV), which incorporates design principles from MQV, HMQV and NAXOS. The new protocol achieves the efficiency of HMQV and admits a natural one-pass variant. Moreover, we present a simple and intuitive proof that CMQV is secure in the LaMacchia-Lauter-Mityagin model.
Description: Updated (extended) and corrected version; see "Errata" and "Revisions" in the appendix for a summary of changes.
URI: http://eprint.iacr.org/2007/123
http://hdl.handle.net/11147/4786
Appears in Collections:Mathematics / Matematik
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
4786.pdfMakale307.72 kBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

Page view(s)

82
checked on Jan 30, 2023

Download(s)

28
checked on Jan 30, 2023

Google ScholarTM

Check


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.