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

On Session Identifiers in Provably Secure Protocols

Kim‐Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock, Greg Maitland

Published Jan 1, 2005• 33 citations
Publisher
DOI
10.1007/978-3-540-30598-9_25

Related papers

On Session Identifiers in Provably Secure Protocols: The Bellare-Rogaway Three-Party Key Distribution Protocol Revisited

Kim‐Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock +1 more

Lecture notes in computer science•Jan 1, 2004•12 citations

On Session Key Construction in Provably-Secure Key Establishment Protocols

Kim‐Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock

Lecture notes in computer science•Jan 1, 2005•42 citations

On Session Identifiers in Provably Secure Protocols

Raymond Choo, Colin Boyd, Yvonne Hitchcock +1 more

We examine the role of session identifiers (SIDs) in security proofs for key establishment protocols. After reviewing the practical importance of SIDs we use as a case study the three-party server-based key distribution (3PKD) protocol of Bellare and Rogaway, proven secure in 1995. We show incidentally that the partnership function used in the existing security proof is flawed. There seems to be no way to define a SID for the 3PKD protocol that will preserve the proof of security. A small change to the protocol allows a natural definition for a SID and we prove that the new protocol is secure using this SID to define partnering.

•Jan 1, 2004•14 citations

On Adaptively Secure Protocols

Muthuramakrishnan Venkitasubramaniam

Lecture notes in computer science•Jan 1, 2014•13 citations

Security Analysis of Provably Secure Constant Round Dynamic Group Key Agreement

J. C. M. TEO, Chaowei Tan, J.M. Ng

Recently, Dutta and Barua proposed provably secure constant round authenticated group key agreement protocols in dynamic scenario. In this letter, we show that their Leave Protocol does not provide forward secrecy, that is, a leaving user can still obtain the new session key used in subsequent sessions.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Nov 1, 2006•6 citations

Key Agreement Protocol with Provable Security in Wireless Network

Yanxia Liu

In the distributed computing environments such as wireless network, it is critical to establish a secure session between communicators. A mutual key agreement protocol, namely Symmetrical Authenticated Key Agreement Protocol(SAKAP), is proposed to authenticate identities and establish secure session key between symmetrical users. The security of the protocol is proved in Random Oracle(RO) model, and its performances are analyzed. SAKAP has the advantages of provable security and considerable feasibility over other protocols.

Jisuanji gongcheng•Jan 1, 2008•0 citations
We examine the role of session identifiers (SIDs) in security proofs for key establishment protocols. After reviewing the practical importance of SIDs we use as a case study the three-party server-based key distribution (3PKD) protocol of Bellare and Rogaway, proven secure in 1995. We show incidentally that the partnership function used in the existing security proof is flawed. There seems to be no way to define a SID for the 3PKD protocol that will preserve the proof of security. A small change to the protocol allows a natural definition for a SID and we prove that the new protocol is secure using this SID to define partnering.
In the distributed computing environments such as wireless network, it is critical to establish a secure session between communicators. A mutual key agreement protocol, namely Symmetrical Authenticated Key Agreement Protocol(SAKAP), is proposed to authenticate identities and establish secure session key between symmetrical users. The security of the protocol is proved in Random Oracle(RO) model, and its performances are analyzed. SAKAP has the advantages of provable security and considerable feasibility over other protocols.