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

IEEE Computer Security Foundations Workshop (CSFW)

A class of flexible and efficient key management protocols

Colin Boyd

Published Dec 23, 2002• 24 citations
Publisher

Abstract

Cryptographic protocols for key establishment normally include some means to allow participants to ensure that a key is new and not replayed from an old protocol run. When the key is generated by a mutually trusted server this is usually achieved by sending with the key a quantity known to be new. A different general method for achieving freshness in this content is proposed. A number of specific example protocols are given which have some practical advantages over previous published protocols.

DOI
10.1109/csfw.1996.503685

Related papers

Comparing lower bounds on messages and rounds for two classes of key establishment protocols

Anish Mathuria

An important requirement in designing protocols for key establishment is to provide assurance to protocol participants that a session key is fresh. This paper compares lower bounds on messages and rounds for two classes of protocols based on fundamentally different methods for achieving session key freshness.

ACM SIGCOMM Computer Communication Review•Oct 1, 1998•0 citations

Security Analysis and Designing Advanced Two-Party Lattice-Based Authenticated Key Establishment and Key Transport Protocols for Mobile Communication

Mani Rajendran, Dharminder Chaudhary, S A Lakshmanan +1 more

In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.

Future Internet•Oct 16, 2025•1 citation

Anonymous Two-Party Authentication and Key Establishment With Trusted Server for Future-Proofing Security of Mobile Communication System

Dharminder Chaudhary, Uddeshaya Kumar, Saibal Kumar Pal +2 more

In cellular systems, user devices (UEs) establish secure sessions with each other through a trusted server such as the Home Subscriber Server (HSS) or Authentication Center (AuC). The proposed two-party authenticated key establishment allows two users to authenticate and exchange encrypted data with minimal involvement of the server -improving efficiency and scalability in mobile communication. Moreover, this paper presents a cryptanalysis of two post-quantum authentication and key agreement protocols proposed by Dabra et al. and Kumar et al. Our analysis identifies specific weaknesses, a design flaw in the registration phase of Dabra et al.’s protocol, and vulnerabilities to identity guessing and impersonation attacks in Kumar et al.’s scheme. Motivated by these findings, we propose a new communication framework for a two-party authenticated key establishment protocol assisted by a server. In the proposed model, user UA initiates communication by sending a request to a central server and receives a corresponding response to establish an authenticated session key with user UB. Notably, user UB does not need to interact with the server during session initiation or key derivation phases, thereby significantly reducing communication overhead and enhancing efficiency. Through extensive formal analysis and simulation, our protocol achieves 21.37% and 19.99% improvement in computational efficiency and 35.13% and 21.05% reduction in communication overhead compared to the lattice-based authenticated key agreement protocols of Dabra et al. and Kumar et al., respectively. Furthermore, the proposed scheme ensures key freshness, meaning that each session key is unique and has never been used in any prior communication session. This guarantees that every session remains protected by a distinct cryptographic key, even when the same users communicate repeatedly. Additionally, user UA can establish a secure session with user UB without revealing its identity to either UB or any intermediate server, thereby preserving user anonymity. Overall, the proposed protocol offers strong privacy guarantees while enabling secure, authenticated communication with a minimal number of message exchanges.

IEEE Open Journal of the Communications Society•Jan 1, 2026•2 citations

Design of Cryptographic Protocols Based on Trusted Freshness

Ling Dong, Kefei Chen

Springer eBooks•Jan 1, 2012•1 citation

A formal model for systematic design of key establishment protocols

Carsten Rudolph

Lecture notes in computer science•Jan 1, 1998•5 citations

Efficient Key Management Protocol for Secure RTMP Video Streaming toward Trusted Quantum Network

Montida Pattaranantakul, Kittichai Sanguannam, Paramin Sangwongngam +1 more

This paper presents an achievable secure videoconferencing system based on quantum key encryption in which key management can be directly applied and embedded in a server/client videoconferencing model using, for example, OpenMeeting. A secure key management methodology is proposed to ensure both a trusted quantum network and a secure videoconferencing system. The proposed methodology presents architecture on how to share secret keys between key management servers and distant parties in a secure domain without transmitting any secrets over insecure channels. The advantages of the proposed secure key management methodology overcome the limitations of quantum point-to-point key sharing by simultaneously distributing keys to multiple users; thus, it makes quantum cryptography a more practical and secure solution. The time required for the encryption and decryption may cause a few seconds delay in video transmission, but this proposed method protects against adversary attacks.

ETRI Journal•May 20, 2015•12 citations
Cryptographic protocols for key establishment normally include some means to allow participants to ensure that a key is new and not replayed from an old protocol run. When the key is generated by a mutually trusted server this is usually achieved by sending with the key a quantity known to be new. A different general method for achieving freshness in this content is proposed. A number of specific example protocols are given which have some practical advantages over previous published protocols.
In this paper, we have proposed a two-party authenticated key establishment (AKE), and authenticated key transport protocols based on lattice-based cryptography, aiming to provide security against quantum attacks for secure communication. This protocol enables two parties, who may share long-term public keys, to securely establish a shared session key, and transportation of the session key from the server while achieving mutual authentication. Our construction leverages the hardness of lattice problems Ring Learning With Errors (Ring-LWE), ensuring robustness against quantum and classical adversaries. Unlike traditional schemes whose security depends upon number-theoretic assumptions being vulnerable to quantum attacks, our protocol ensures security in the post-quantum era. The proposed protocol ensures forward secrecy, and provides security even if the long-term key is compromised. This protocol also provides essential property key freshness and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. On the other hand, the proposed key transport protocol provides essential property key freshness, anonymity, and resistance against man-in-the-middle attacks, impersonation attacks, replay attacks, and key mismatch attacks. A two-party key transport protocol is a cryptographic protocol in which one party (typically a trusted key distribution center or sender) securely generates and sends a session key to another party. Unlike key exchange protocols (where both parties contribute to key generation), key transport protocols rely on one party to generate the key and deliver it securely. The protocol possesses a minimum number of exchanged messages and can reduce the number of communication rounds to help minimize the communication overhead.
In cellular systems, user devices (UEs) establish secure sessions with each other through a trusted server such as the Home Subscriber Server (HSS) or Authentication Center (AuC). The proposed two-party authenticated key establishment allows two users to authenticate and exchange encrypted data with minimal involvement of the server -improving efficiency and scalability in mobile communication. Moreover, this paper presents a cryptanalysis of two post-quantum authentication and key agreement protocols proposed by Dabra et al. and Kumar et al. Our analysis identifies specific weaknesses, a design flaw in the registration phase of Dabra et al.’s protocol, and vulnerabilities to identity guessing and impersonation attacks in Kumar et al.’s scheme. Motivated by these findings, we propose a new communication framework for a two-party authenticated key establishment protocol assisted by a server. In the proposed model, user UA initiates communication by sending a request to a central server and receives a corresponding response to establish an authenticated session key with user UB. Notably, user UB does not need to interact with the server during session initiation or key derivation phases, thereby significantly reducing communication overhead and enhancing efficiency. Through extensive formal analysis and simulation, our protocol achieves 21.37% and 19.99% improvement in computational efficiency and 35.13% and 21.05% reduction in communication overhead compared to the lattice-based authenticated key agreement protocols of Dabra et al. and Kumar et al., respectively. Furthermore, the proposed scheme ensures key freshness, meaning that each session key is unique and has never been used in any prior communication session. This guarantees that every session remains protected by a distinct cryptographic key, even when the same users communicate repeatedly. Additionally, user UA can establish a secure session with user UB without revealing its identity to either UB or any intermediate server, thereby preserving user anonymity. Overall, the proposed protocol offers strong privacy guarantees while enabling secure, authenticated communication with a minimal number of message exchanges.
This paper presents an achievable secure videoconferencing system based on quantum key encryption in which key management can be directly applied and embedded in a server/client videoconferencing model using, for example, OpenMeeting. A secure key management methodology is proposed to ensure both a trusted quantum network and a secure videoconferencing system. The proposed methodology presents architecture on how to share secret keys between key management servers and distant parties in a secure domain without transmitting any secrets over insecure channels. The advantages of the proposed secure key management methodology overcome the limitations of quantum point-to-point key sharing by simultaneously distributing keys to multiple users; thus, it makes quantum cryptography a more practical and secure solution. The time required for the encryption and decryption may cause a few seconds delay in video transmission, but this proposed method protects against adversary attacks.