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

CRC Press eBooks

Key Establishment Protocols

Alfred Menezes, Paul C. van Oorschot, Scott A. Vanstone

Published Dec 7, 2018• 0 citations
Publisher

Abstract

This chapter considers key establishment protocols and related cryptographic techniques which provide shared secrets between two or more parties, typically for subsequent use as symmetric keys for a variety of cryptographic purposes including encryption, message authentication, and entity authentication. The main focus is two-party key establishment, with the aid of a trusted third party in some cases. While many concepts extend naturally to multi-party key establishment including conference keying protocols, such protocols rapidly become more complex, and are considered here only briefly, as is the related area of secret sharing. Broader aspects of key management, including distribution of public keys, certificates, and key life cycle issues, are deferred to Chapter 13 .

DOI
10.1201/9780429466335-12

Related papers

Secure multi-party key establishment

Chih-Hung Li

For a secure communication through the public network, cryptographic encryption must be applied. The key establishment issue is the most important part in cryptographic encryption. Only the legitimate principals who have the key can encrypt messages and decrypt cryptograms. A secure multi-party communication held through the public network can only take place after a multi-party key establishment protocol has been executed. The multi-party key establishment protocol is designed so that the principals can receive a common key and use it to securely exchange the messages.\nIn this thesis, the secure multi-party key establishment protocols are discussed. W e start from investigating properties of two-party key establishment protocols such as motivation of using session key, adversaries in the protocols, attacks of the protocol and security analysis of the protocol. Then we give the requirements of a multi-party key establishment protocol and summarize about what should be considered in designing a multi-party key establishment protocol. After that we review some of the previous proposed multi-party key establishment protocol. The existing multi-party key establishment protocols are either impractical ( not efficient enough) or missing some important security goals such as authentication of principals. Three new protocols are proposed in this thesis. The first protocol addresses how to hold a conference for members of two hierarchical groups in an efficient way. The message broadcasting is used to reduce the cost of secure message transport.\nThe second and the third protocols manage the authentication problem by using a secret sharing scheme. We replace the principal authentication with the group authentication so that the computational overhead and communication overhead will be reduced especially in reuse of the protocol for new communication. Again, message broadcasting is used for replacing the expansive secure communication channel.\nPart of this thesis appeared in ACSC'99(Australian Computer Science Conference) and ACISP'99(Australian Conference of Information Security and Privacy).

•Jan 1, 2000•0 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

Protocols for symmetric secret key establishment: Modern approach

Meiran Galis, Tomislav Unkašević, Zoran Banjac +1 more

Introduction/purpose: The problem of efficient distribution of cryptographic keys in communication systems has existed since its first days and is especially emphasized by the emergence of mass communication systems. Defining and implementing efficient protocols for symmetric cryptographic keys establishment in such circumstances is of great importance in raising information security in cyberspace. Methods: Using the methods of Information Theory and Secure Multiparty Computation, protocols for direct establishment of cryptographic keys between communication parties have been defined. Results: The paper defines two new approaches to the problem of establishing cryptographic keys. The novelty in the protocol defined in the security model based on information theory is based on the source of common randomness, which in this case is the EEG signal of each subject participating in the communication system. Experimental results show that the amount of information leaking to the attacker is close to zero. A novelty in the second case, which provides security with keys at the level of computer security by applying Secure Multiparty Computation, is in the new application field, namely generation and distribution of symmetric cryptographic keys. It is characteristic of both approaches that within the framework of formal theories, it is possible to draw conclusions about their security characteristics in a formal way. Conclusions: The paper describes two new approaches for establishing cryptographic keys in symmetric cryptographic systems with experimental results. The significance of the proposed solutions lies in the fact that they enable the establishment of secure communication between communication parties from end to end, avoiding the influence of a trusted third party. In that way, the achieved communication level security significantly increases in relation to classical cryptographic systems.

Vojnotehnicki glasnik•Jan 1, 2022•0 citations

Key Management and the Public-Key Revolution

Jonathan I. Katz, Yehuda Lindell

In previous chapters we have seen how private-key cryptography can be used to ensure secrecy and integrity for two parties communicating over an insecure channel, if we are willing to assume those two parties hold a shared, secret key. The question we have deferred since Chapter 1 , however, is: How can the parties share a secret key in the first place?

Chapman & Hall/CRC eBooks•May 14, 2025•0 citations

Cryptographic Protocols

Richard A. Mollin

The term cryptographic protocol was briefly introduced to us in footnote 2.24 on page 101. This chapter is devoted to studying several particular such protocols including: key establishment; key agreement; identification; commitment; secret sharing; electronic voting; protocol layer analysis with SSL as an Internet protocol providing authentication and secrecy for session-based communications; and we conclude with digital cash schemes and e-commerce.

Chapman & Hall/CRC eBooks•May 24, 2005•0 citations

Trends and Development of Information-Theoretic Cryptography

Junji Shikata

This paper briefly deals with a wide range of topics in information-theoretic cryptography. First, we focus on the results on symmetric-key encryption and authentication codes, since these protocols are fundamental in the field and well studied in the frameworks by Shannon and Simmons, respectively. Secondly, we explain several existing assumptions and security criteria whose merit mainly lies in realizing cryptographic protocols with short/weak shared secret-keys, correlated weak secret-keys, or no shared secrets. Thirdly, we consider research themes by three aspects for further development of information-theoretic cryptography. Finally, we refer to trends of technical approaches in information-theoretic cryptography and explain our recent results brought by using the approach.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2015•0 citations
This chapter considers key establishment protocols and related cryptographic techniques which provide shared secrets between two or more parties, typically for subsequent use as symmetric keys for a variety of cryptographic purposes including encryption, message authentication, and entity authentication. The main focus is two-party key establishment, with the aid of a trusted third party in some cases. While many concepts extend naturally to multi-party key establishment including conference keying protocols, such protocols rapidly become more complex, and are considered here only briefly, as is the related area of secret sharing. Broader aspects of key management, including distribution of public keys, certificates, and key life cycle issues, are deferred to Chapter 13 .
For a secure communication through the public network, cryptographic encryption must be applied. The key establishment issue is the most important part in cryptographic encryption. Only the legitimate principals who have the key can encrypt messages and decrypt cryptograms. A secure multi-party communication held through the public network can only take place after a multi-party key establishment protocol has been executed. The multi-party key establishment protocol is designed so that the principals can receive a common key and use it to securely exchange the messages.\nIn this thesis, the secure multi-party key establishment protocols are discussed. W e start from investigating properties of two-party key establishment protocols such as motivation of using session key, adversaries in the protocols, attacks of the protocol and security analysis of the protocol. Then we give the requirements of a multi-party key establishment protocol and summarize about what should be considered in designing a multi-party key establishment protocol. After that we review some of the previous proposed multi-party key establishment protocol. The existing multi-party key establishment protocols are either impractical ( not efficient enough) or missing some important security goals such as authentication of principals. Three new protocols are proposed in this thesis. The first protocol addresses how to hold a conference for members of two hierarchical groups in an efficient way. The message broadcasting is used to reduce the cost of secure message transport.\nThe second and the third protocols manage the authentication problem by using a secret sharing scheme. We replace the principal authentication with the group authentication so that the computational overhead and communication overhead will be reduced especially in reuse of the protocol for new communication. Again, message broadcasting is used for replacing the expansive secure communication channel.\nPart of this thesis appeared in ACSC'99(Australian Computer Science Conference) and ACISP'99(Australian Conference of Information Security and Privacy).
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.
Introduction/purpose: The problem of efficient distribution of cryptographic keys in communication systems has existed since its first days and is especially emphasized by the emergence of mass communication systems. Defining and implementing efficient protocols for symmetric cryptographic keys establishment in such circumstances is of great importance in raising information security in cyberspace. Methods: Using the methods of Information Theory and Secure Multiparty Computation, protocols for direct establishment of cryptographic keys between communication parties have been defined. Results: The paper defines two new approaches to the problem of establishing cryptographic keys. The novelty in the protocol defined in the security model based on information theory is based on the source of common randomness, which in this case is the EEG signal of each subject participating in the communication system. Experimental results show that the amount of information leaking to the attacker is close to zero. A novelty in the second case, which provides security with keys at the level of computer security by applying Secure Multiparty Computation, is in the new application field, namely generation and distribution of symmetric cryptographic keys. It is characteristic of both approaches that within the framework of formal theories, it is possible to draw conclusions about their security characteristics in a formal way. Conclusions: The paper describes two new approaches for establishing cryptographic keys in symmetric cryptographic systems with experimental results. The significance of the proposed solutions lies in the fact that they enable the establishment of secure communication between communication parties from end to end, avoiding the influence of a trusted third party. In that way, the achieved communication level security significantly increases in relation to classical cryptographic systems.
This paper briefly deals with a wide range of topics in information-theoretic cryptography. First, we focus on the results on symmetric-key encryption and authentication codes, since these protocols are fundamental in the field and well studied in the frameworks by Shannon and Simmons, respectively. Secondly, we explain several existing assumptions and security criteria whose merit mainly lies in realizing cryptographic protocols with short/weak shared secret-keys, correlated weak secret-keys, or no shared secrets. Thirdly, we consider research themes by three aspects for further development of information-theoretic cryptography. Finally, we refer to trends of technical approaches in information-theoretic cryptography and explain our recent results brought by using the approach.