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

Chapman & Hall/CRC eBooks

Key Management and the Public-Key Revolution

Jonathan I. Katz, Yehuda Lindell

Published May 14, 2025• 0 citations
Publisher

Abstract

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?

DOI
10.1201/9781003398134-11

Related papers

Secret Key Generation through the Multipath Fading of Reciprocal Channels in Multiple Domains.

Michael A. Forman, D. Young

Methods to generate private keys based on wireless channel characteristics have been proposed as an alternative to standard key-management schemes.In this paper, we discuss past work in the field and offer a generalized scheme for the generation of private keys using uncorrelated channels in multiple domains.Proposed cognitive enhancements measure channel coherence, to dynamically change transmission and reception parameters as well as estimate private key strength and expiration time.We evaluate a proof-of-concept implementation of this system in software using a channel model that provides variation in multiple domains. I. INTRODUCTIONFor a wireless communications link to be secure, it must provide data confidentiality and integrity during transmission.The principal method through which this is achieved is the use of cryptography, of which there are generally two types, public key [1] and private key [2].Public-key cryptography is a method for secret communication between two parties without the requirement of an initial exchange of secret keys.It employs a pair of keys, one private, which is held secret, and one public, which is distributed.Messages are encrypted with the recipient's public key and decrypted with the recipient's corresponding private key.Public-key cryptography is thus relatively unencumbered with key-exchange difficulties and key-interception vulnerabilities, however it is computationally intensive.Private-key cryptography is a method for secret communication between two parties that requires an initial exchange of a single shared secret key.Messages are encrypted by the sender and decrypted by the recipient using this same shared key.Private-key cryptography is less computationally intensive than public-key cryptography, however key distribution and management are problematic.Key distribution risks that the secret key will be intercepted during transmission.Key management requires the generation and transport of a different key for each communicating party [3].

•Mar 1, 2009•0 citations

Characterization of the secrecy of a common key constructed via data transmission over the two-way AND channel

Vladimir B. Balakirsky, A. Barbé, E. van der Meulen +1 more

•Jan 1, 1999•0 citations

An Analysis of a Cryptographic Communication Protocol

Maria Strand

We have considered a cryptographic communication protocol and given a proof for its security.

66•Jan 1, 2010•0 citations

Private Classical Communication

Mark M. Wilde

We have now seen in Chapters 19–21 how Alice can communicate classical or quantum information to Bob, perhaps even with the help of shared entanglement. One might argue that these communication tasks are the most fundamental tasks in quantum Shannon theory, given that they have furthered our understanding of the nature of information transmission over quantum channels. Though, when discussing the communication of classical information, we made no stipulation as to whether this classical information should be public, so that any third party might have partial or full access to it, or private, so that any third party does not have access. This chapter introduces the private classical capacity theorem, which gives the maximum rate at which Alice can communicate classical information privately to Bob without anyone else in the universe knowing what she sent to him. The information-processing task corresponding to this theorem was one of the earliest studied in quantum information theory, with the Bennett–Brassard-84 quantum key distribution protocol being the first proposed protocol for exploiting quantum mechanics to establish a shared secret key between two parties. The private classical capacity theorem is important for quantum key distribution because it establishes the maximum rate at which two parties can generate a shared secret key.

Cambridge University Press eBooks•Apr 18, 2013•0 citations

Key Establishment Protocols

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

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 .

CRC Press eBooks•Dec 7, 2018•0 citations

Secure Signature Protocol

Shundong Li, Daoshun WANG, Yiqi DAI

This paper studies how to take advantage of other's computing ability to sign a message with one's private key without disclosing the private key.A protocol to this problem is presented, and it is proven, by well known simulation paradigm, that this protocol is private.

Intelligent Information Management•Jan 1, 2009•0 citations
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?
Methods to generate private keys based on wireless channel characteristics have been proposed as an alternative to standard key-management schemes.In this paper, we discuss past work in the field and offer a generalized scheme for the generation of private keys using uncorrelated channels in multiple domains.Proposed cognitive enhancements measure channel coherence, to dynamically change transmission and reception parameters as well as estimate private key strength and expiration time.We evaluate a proof-of-concept implementation of this system in software using a channel model that provides variation in multiple domains. I. INTRODUCTIONFor a wireless communications link to be secure, it must provide data confidentiality and integrity during transmission.The principal method through which this is achieved is the use of cryptography, of which there are generally two types, public key [1] and private key [2].Public-key cryptography is a method for secret communication between two parties without the requirement of an initial exchange of secret keys.It employs a pair of keys, one private, which is held secret, and one public, which is distributed.Messages are encrypted with the recipient's public key and decrypted with the recipient's corresponding private key.Public-key cryptography is thus relatively unencumbered with key-exchange difficulties and key-interception vulnerabilities, however it is computationally intensive.Private-key cryptography is a method for secret communication between two parties that requires an initial exchange of a single shared secret key.Messages are encrypted by the sender and decrypted by the recipient using this same shared key.Private-key cryptography is less computationally intensive than public-key cryptography, however key distribution and management are problematic.Key distribution risks that the secret key will be intercepted during transmission.Key management requires the generation and transport of a different key for each communicating party [3].
We have now seen in Chapters 19–21 how Alice can communicate classical or quantum information to Bob, perhaps even with the help of shared entanglement. One might argue that these communication tasks are the most fundamental tasks in quantum Shannon theory, given that they have furthered our understanding of the nature of information transmission over quantum channels. Though, when discussing the communication of classical information, we made no stipulation as to whether this classical information should be public, so that any third party might have partial or full access to it, or private, so that any third party does not have access. This chapter introduces the private classical capacity theorem, which gives the maximum rate at which Alice can communicate classical information privately to Bob without anyone else in the universe knowing what she sent to him. The information-processing task corresponding to this theorem was one of the earliest studied in quantum information theory, with the Bennett–Brassard-84 quantum key distribution protocol being the first proposed protocol for exploiting quantum mechanics to establish a shared secret key between two parties. The private classical capacity theorem is important for quantum key distribution because it establishes the maximum rate at which two parties can generate a shared secret key.
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 .