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

Journal of Physics A Mathematical and Theoretical

Privacy amplification for quantum key distribution

Yodai Watanabe

Published Dec 20, 2006• 18 citations
Publisher

Abstract

This paper examines classical privacy amplification using a universal family of hash functions. In quantum key distribution, the adversary's measurement can wait until the choice of hash functions is announced, and so the adversary's information may depend on the choice. Therefore the existing result on classical privacy amplification, which assumes the independence of the choice from the other random variables, is not applicable to this case. This paper provides a security proof of privacy amplification which is valid even when the adversary's information may depend on the choice of hash functions. The compression rate of the proposed privacy amplification can be taken to be the same as that of the existing one with an exponentially small loss in secrecy of a final key.

DOI
10.1088/1751-8113/40/3/f03

Related papers

Privacy amplification scheme based on composite coding

Wei Li, Shengmei Zhao

Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.

arXiv:2109.07139•Sep 15, 2021•1 citation

Combining Error Verification and Privacy Amplification in Quantum Key Distribution

Devashish Tupkary, Zhiyao Wang, Ernest Y. -Z. Tan

Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.

quant-pharXiv:2610.10702•Oct 9, 2026•0 citations

Privacy amplification secure against an adversary with selectable knowledge

Robert König, Ueli M. Maurer, Renato Renner

We introduce the concept of selectable knowledge, which models the information stored in an arbitrary (e.g., quantum mechanical) device. We then analyze a situation where an entity A holds selectable knowledge about some random variable X and quantify the information A has about the output H(X) of a randomly chosen function H applied to X. This generalizes the setting of privacy amplification by universal hashing. In particular, our result can be used to prove that privacy amplification remains secure even if the enemy possesses quantum instead of classical information.

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•2 citations

Privacy amplification using hash functions

Gilles Van Assche

In this chapter, I will discuss some important aspects of universal families of hash functions. I will not remain completely general, however, as we are only interested in universal families of hash functions for the purpose of privacy amplification of QKD-produced bits. In the first section, I explain my motivations, detailing the requirements for families of hash functions in the scope of privacy amplification. I then give some definitions of families and show how they fit our needs. Finally, I discuss their implementation. Defined in Section 6.3.1, the essential property of an ∈/| B |-almost universal family of hash function is recalled in Fig. 7.1. Requirements For the purpose of privacy amplification, families of hash functions should meet some important requirements. They are listed below: The family should be universal (∈ = 1) or very close to it (∈ ≈ 1). The number of bits necessary to represent a particular hash function within its family should be reasonably low. The family should have large input and large output sizes. The evaluation of a hash function within the family should be efficient. The first requirement directly affects the quality of the produced secret key. The closer to universality, the better the secrecy of the resulting key – see Section 6.3.1. The second requirement results from the fact that the hash function will be chosen randomly within its family and such a choice has to be transmitted between Claude and Dominique. It is not critical, however, because the choice of the hash function need not be secret. A number of bits proportional to the input size is acceptable.

Cambridge University Press eBooks•Jun 29, 2006•2 citations

Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

Yu‐Guang Yang, Peng Xu, Rui Zhe Yang +2 more

Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

Scientific Reports•Jan 29, 2016•109 citations

An Efficient Privacy Amplification Scheme Based on SQH-L

Weigang Li, Yucheng Qiao

In Quantum Key Distribution (QKD) systems, the privacy amplification phase plays a crucial role in ensuring secure communications. However, existing privacy amplification schemes often suffer from computational challenges. This article proposes a high-speed privacy amplification scheme SQH-L based on the SQH (Square Hash) hash function family, which supports variable output length. The scheme significantly improves computational efficiency through the introduction of Number Theoretic Transform (NTT). Experimental results show that the SQH-L scheme outperforms the SQH-MH scheme, MMH-MH scheme, and FFT-based Toeplitz scheme across various parameter settings, especially when the output key has a high retention ratio. This research not only optimizes existing privacy amplification technologies but also provides an efficient solution for quantum key distribution systems, significantly increasing privacy amplification throughput while ensuring information security.

International Academic Symposium on Electronic Information and Signal Processing (EISP)•Nov 1, 2025•0 citations
This paper examines classical privacy amplification using a universal family of hash functions. In quantum key distribution, the adversary's measurement can wait until the choice of hash functions is announced, and so the adversary's information may depend on the choice. Therefore the existing result on classical privacy amplification, which assumes the independence of the choice from the other random variables, is not applicable to this case. This paper provides a security proof of privacy amplification which is valid even when the adversary's information may depend on the choice of hash functions. The compression rate of the proposed privacy amplification can be taken to be the same as that of the existing one with an exponentially small loss in secrecy of a final key.
Privacy amplification is an indispensable step in the post-processing of quantum key distribution, which can be used to compress the redundancy of shared key and improve the security level of the key. The commonly used privacy amplification is based on the random selection of universal hash functions, which needs the help of an additional random source, while it does not exist in general. In this paper, we propose a privacy amplification scheme based on composite coding, which is an extension of quantum CSS codes to classical linear codes. Compared with the universal hashing function, the proposed scheme does not need other random sources, and the randomness can be completely provided by the qubit string. Furthermore, the information-theoretic bound for the extraction of the key is obvious in composite coding.
Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, announce and compare a fixed number of bits of its output for error-verification, and retain the remaining bits as the final output key. This reduces the complexity of classical postprocessing, the amount of classical communication, and the amount of randomness needed in the protocol. While this construction has appeared in the literature, a suitable mathematical justification is lacking. In this work, we show that the security of such protocols, under certain simple conditions, follows from a slightly modified notion of secrecy of the protocol without the final error-verification step. In particular, we show that for most entropy-based proofs, the combined protocol can be implemented with no change to the key rate, and a minor change to the security parameter.
We introduce the concept of selectable knowledge, which models the information stored in an arbitrary (e.g., quantum mechanical) device. We then analyze a situation where an entity A holds selectable knowledge about some random variable X and quantify the information A has about the output H(X) of a randomly chosen function H applied to X. This generalizes the setting of privacy amplification by universal hashing. In particular, our result can be used to prove that privacy amplification remains secure even if the enemy possesses quantum instead of classical information.
In this chapter, I will discuss some important aspects of universal families of hash functions. I will not remain completely general, however, as we are only interested in universal families of hash functions for the purpose of privacy amplification of QKD-produced bits. In the first section, I explain my motivations, detailing the requirements for families of hash functions in the scope of privacy amplification. I then give some definitions of families and show how they fit our needs. Finally, I discuss their implementation. Defined in Section 6.3.1, the essential property of an ∈/| B |-almost universal family of hash function is recalled in Fig. 7.1. Requirements For the purpose of privacy amplification, families of hash functions should meet some important requirements. They are listed below: The family should be universal (∈ = 1) or very close to it (∈ ≈ 1). The number of bits necessary to represent a particular hash function within its family should be reasonably low. The family should have large input and large output sizes. The evaluation of a hash function within the family should be efficient. The first requirement directly affects the quality of the produced secret key. The closer to universality, the better the secrecy of the resulting key – see Section 6.3.1. The second requirement results from the fact that the hash function will be chosen randomly within its family and such a choice has to be transmitted between Claude and Dominique. It is not critical, however, because the choice of the hash function need not be secret. A number of bits proportional to the input size is acceptable.
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
In Quantum Key Distribution (QKD) systems, the privacy amplification phase plays a crucial role in ensuring secure communications. However, existing privacy amplification schemes often suffer from computational challenges. This article proposes a high-speed privacy amplification scheme SQH-L based on the SQH (Square Hash) hash function family, which supports variable output length. The scheme significantly improves computational efficiency through the introduction of Number Theoretic Transform (NTT). Experimental results show that the SQH-L scheme outperforms the SQH-MH scheme, MMH-MH scheme, and FFT-based Toeplitz scheme across various parameter settings, especially when the output key has a high retention ratio. This research not only optimizes existing privacy amplification technologies but also provides an efficient solution for quantum key distribution systems, significantly increasing privacy amplification throughput while ensuring information security.