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

Lecture notes in computer science

A Provably Secure One-Pass Two-Party Key Establishment Protocol

Konstantinos Chalkias, Spyros T. Halkidis, Dimitrios Hristu‐Varsakelis, George Stephanides, Anastasios Alexiadis

Published Aug 16, 2008• 7 citations
Publisher
DOI
10.1007/978-3-540-79499-8_10

Related papers

Provably Secure Certificateless One-Way and Two-Party Authenticated Key Agreement Protocol

Lei Zhang

Lecture notes in computer science•Jan 1, 2013•9 citations

Efficient provably-secure privacy-preserving signature-based key establishment protocol

Dariush Abbasinezhad‐Mood, Arezou Ostad‐Sharif, Morteza Nikooghadam

Ad Hoc Networks•Jan 23, 2020•13 citations

Provably Secure Two-Party Authenticated Key Exchange Protocol in eCK Model

Jianjie Zhao, Dawu Gu

Chinese Journal of Computers•May 17, 2011•2 citations

Provably secure two-party authenticated key agreement protocol for post-quantum environments

SK Hafizul Islam

Journal of Information Security and Applications•Feb 23, 2020•47 citations

Key establishment --- security models, protocols and usage

Berkant Ustaoğlu

Key establishment is the process whereby two or more parties derive a shared \nsecret, typically used for subsequent confidential communication. However, \nidentifying the exact security requirements for key establishment protocols is \na non-trivial task. This thesis compares, extends and merges existing security \ndefinitions and models for key establishment protocols. \n \nThe primary focus is on two-party key agreement schemes in the public-key \nsetting. On one hand new protocols are proposed and analyzed in the existing \nCanetti-Krawzcyk model. On the other hand the thesis develops a security model \nand novel definition that capture the essential security attributes of the \nstandardized Unified Model key agreement protocol. These analyses lead to the \ndevelopment of a new security model and related definitions that combine and \nextend the Canetti-Krawzcyk pre- and post- specified peer models in terms of \nprovided security assurances. \n \nThe thesis also provides a complete analysis of a one-pass key establishment \nscheme. There are security goals that no one-pass key establishment scheme can \nachieve, and hence the two-pass security models and definitions need to be \nadapted for one-pass protocols. The analysis provided here includes \nthe description of the required modification to the underlying security model. \nFinally, a complete security argument meeting these altered conditions is \npresented as evidence supporting the security of the one-pass scheme. \n \nLastly, validation and reusing short lived key pairs are related to \nefficiency, which is a major objective in practice. The thesis considers the \nformal implication of omitting validation steps and reusing short lived key \npairs. The conclusions reached support the generally accepted cryptographic \nconventions that incoming messages should not be blindly trusted and extra \ncare should be taken when key pairs are reused.

•Jul 30, 2008•3 citations

An efficient certificateless two-party authenticated key agreement protocol

Debiao He, Sahadeo Padhye, Jianhua Chen

Computers & Mathematics with Applications•Apr 21, 2012•77 citations
Key establishment is the process whereby two or more parties derive a shared \nsecret, typically used for subsequent confidential communication. However, \nidentifying the exact security requirements for key establishment protocols is \na non-trivial task. This thesis compares, extends and merges existing security \ndefinitions and models for key establishment protocols. \n \nThe primary focus is on two-party key agreement schemes in the public-key \nsetting. On one hand new protocols are proposed and analyzed in the existing \nCanetti-Krawzcyk model. On the other hand the thesis develops a security model \nand novel definition that capture the essential security attributes of the \nstandardized Unified Model key agreement protocol. These analyses lead to the \ndevelopment of a new security model and related definitions that combine and \nextend the Canetti-Krawzcyk pre- and post- specified peer models in terms of \nprovided security assurances. \n \nThe thesis also provides a complete analysis of a one-pass key establishment \nscheme. There are security goals that no one-pass key establishment scheme can \nachieve, and hence the two-pass security models and definitions need to be \nadapted for one-pass protocols. The analysis provided here includes \nthe description of the required modification to the underlying security model. \nFinally, a complete security argument meeting these altered conditions is \npresented as evidence supporting the security of the one-pass scheme. \n \nLastly, validation and reusing short lived key pairs are related to \nefficiency, which is a major objective in practice. The thesis considers the \nformal implication of omitting validation steps and reusing short lived key \npairs. The conclusions reached support the generally accepted cryptographic \nconventions that incoming messages should not be blindly trusted and extra \ncare should be taken when key pairs are reused.