NAXOS

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 AXOS. The new protocol achieves the efficiency of HMQV and admits a natural one-pass variant. Moreover, we present a relatively simple and intuitive proof that CMQV is secure in the LaMacchia-Lauter-Mityagin model.


References in zbMATH (referenced in 73 articles , 1 standard article )

Showing results 41 to 60 of 73.
Sorted by year (citations)
  1. Fujioka, Atsushi: Characterization of strongly secure authenticated key exchanges without NAXOS technique (2011)
  2. Fujioka, Atsushi; Suzuki, Koutarou: Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys (2011)
  3. Huang, Hai: Strongly secure one round authenticated key exchange protocol with perfect forward security (2011)
  4. Huang, Hai; Cao, Zhenfu: Blake-Wilson, Johnson & Menezes protocol revisited (2011)
  5. Ioannou, Lawrence M.; Mosca, Michele: A new spin on quantum cryptography: avoiding trapdoors and embracing public keys (2011)
  6. Ni, Liang; Chen, Gongliang; Li, Jianhua; Hao, Yanyan: Strongly secure identity-based authenticated key agreement protocols (2011)
  7. Pan, Jiaxin; Wang, Libin: TMQV: a strongly eck-secure Diffie-Hellman protocol without gap assumption (2011)
  8. Stebila, Douglas; Kuppusamy, Lakshmi; Rangasamy, Jothi; Boyd, Colin; Gonzalez Nieto, Juan: Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols (2011)
  9. Struik, René: Batch computations revisited: combining key computations and batch verifications (2011)
  10. Yoneyama, Kazuki; Zhao, Yunlei: Taxonomical security consideration of authenticated key exchange resilient to intermediate computation leakage (2011)
  11. Abdalla, Michel; Chevalier, Céline; Manulis, Mark; Pointcheval, David: Flexible group key exchange with on-demand computation of subgroup keys (2010)
  12. Basin, David; Cremers, Cas: Degrees of security: protocol guarantees in the face of compromising adversaries (2010)
  13. Chatterjee, Sanjit; Menezes, Alfred; Ustaoglu, Berkant: Combined security analysis of the one- and three-pass unified model key agreement protocols (2010)
  14. Cremers, Cas J. F.: Session-StateReveal is stronger than eCKs EphemeralKeyReveal: using automatic analysis to attack the NAXOS protocol (2010)
  15. Fujioka, Atsushi; Suzuki, Koutarou; Ustaoğlu, Berkant: Ephemeral key leakage resilient and efficient ID-AKEs that can share identities, private and master keys (2010)
  16. Jager, Tibor; Kohlar, Florian; Schäge, Sven; Schwenk, Jörg: Generic compilers for authenticated key exchange (2010)
  17. Sarr, Augustin P.; Elbaz-Vincent, Philippe; Bajard, Jean-Claude: A new security model for authenticated key agreement (2010)
  18. Yoneyama, Kazuki: Strongly secure two-pass attribute-based authenticated key exchange (2010)
  19. Chatterjee, Sanjit; Menezes, Alfred; Ustaoglu, Berkant: Reusing static keys in key agreement protocols (2009)
  20. Gorantla, M. Choudary; Boyd, Colin; González Nieto, Juan Manuel: Modeling key compromise impersonation attacks on group key exchange protocols (2009)