Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Strengthening the security of key exchange protocols

Michèle Feltz

Published Jan 1, 2014• 0 citations
Publisher
DOI
10.3929/ethz-a-010164543

Related papers

Strengthening the security of authenticated key exchange against bad randomness

Michèle Feltz, Cas J. F. Cremers

Designs Codes and Cryptography•Feb 13, 2017•12 citations

Designing secure key exchange protocols

Colin Boyd, Wenbo Mao

Lecture notes in computer science•Jan 1, 1994•18 citations

Innovative Approaches to Strengthening PAKE Protocols and Quantum-Secure Key Exchange

Naeim Rahmani, Taoufik Serraj

Lecture notes in networks and systems•Jan 1, 2026•0 citations

Analysis and Improvement of an Authenticated Key Exchange Protocol

Jiaxin Pan, Libin Wang, Changshe Ma

Lecture notes in computer science•Jan 1, 2011•3 citations

Authenticated Key Exchange under Bad Randomness ⋆

Guomin Yang, Shanshan Duan, Duncan S. Wong +2 more

Abstract. We initiate the formal study on authenticated key exchange (AKE) under bad randomness. This could happen when (1) an adversary compromises the randomness source and hence directly controls the randomness of each AKE session; and (2) the randomness repeats in different AKE sessions due to reset attacks. We construct two formal security models, Reset-1 and Reset-2, to capture these two bad randomness situations respectively, and investigate the security of some widely used AKE protocols in these models by showing that they become insecure when the adversary is able to manipulate the randomness. On the positive side, we propose simple but generic methods to make AKE protocols secure in Reset-1 and Reset-2 models. The methods work in a modular way: first, we strengthen a widely used AKE protocol to achieve Reset-2 security, then we show how to transform any Reset-2 secure AKE protocol to a new one which also satisfies Reset-1 security.

•Jan 1, 2011•0 citations

Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels

Ran Canetti, Hugo Krawczyk

Lecture notes in computer science•Jan 1, 2001•1,710 citations
Abstract. We initiate the formal study on authenticated key exchange (AKE) under bad randomness. This could happen when (1) an adversary compromises the randomness source and hence directly controls the randomness of each AKE session; and (2) the randomness repeats in different AKE sessions due to reset attacks. We construct two formal security models, Reset-1 and Reset-2, to capture these two bad randomness situations respectively, and investigate the security of some widely used AKE protocols in these models by showing that they become insecure when the adversary is able to manipulate the randomness. On the positive side, we propose simple but generic methods to make AKE protocols secure in Reset-1 and Reset-2 models. The methods work in a modular way: first, we strengthen a widely used AKE protocol to achieve Reset-2 security, then we show how to transform any Reset-2 secure AKE protocol to a new one which also satisfies Reset-1 security.