The binary entropy function
plays a important role in the security analysis of the BB84 protocol, particularly in the context of eavesdropping. The BB84 protocol, proposed by Charles Bennett and Gilles Brassard in 1984, is a quantum key distribution (QKD) scheme that allows two parties, traditionally named Alice and Bob, to securely share a cryptographic key. The security of the BB84 protocol against an eavesdropper, often referred to as Eve, relies on the principles of quantum mechanics, specifically the no-cloning theorem and the entropic uncertainty relations.
The binary entropy function
is defined as:
![]()
where
represents the error rate or the probability of a bit being in error. This function quantifies the amount of uncertainty or entropy associated with a binary random variable that takes the value 1 with probability
and 0 with probability
.
In the context of the BB84 protocol, the binary entropy function is used to quantify the information gain of an eavesdropper and to establish the security bounds of the protocol. When Alice sends qubits to Bob, she randomly chooses between two bases, typically the rectilinear (Z) basis and the diagonal (X) basis. Bob also randomly chooses his measurement basis. If Bob's basis matches Alice's, he measures the qubit correctly; otherwise, he gets a random result.
Eve, attempting to intercept the qubits, introduces errors into the key. The presence of these errors is detected by comparing a subset of the shared key between Alice and Bob. The error rate
is the fraction of bits that differ between Alice's and Bob's keys in this subset.
The security of the BB84 protocol can be analyzed using the concept of entropic uncertainty relations. These relations provide a way to quantify the trade-off between the uncertainties in the outcomes of measurements in two incompatible bases. In the BB84 protocol, the relevant uncertainty relation is given by:
![]()
where
and
are the conditional entropies of the measurement outcomes in the X and Z bases, respectively, given the information available to Eve, and
is a constant that depends on the specific measurements.
The binary entropy function
is used to quantify the amount of information that Eve can gain about the key bits. If the error rate
is low, Eve's information about the key is also low. Specifically, the mutual information
between Alice's key
and Eve's information
is bounded by the binary entropy function:
![]()
This bound indicates that the higher the error rate
, the greater the uncertainty
, and hence the less information Eve can obtain about the key.
To ensure the security of the BB84 protocol, Alice and Bob perform error correction and privacy amplification. Error correction allows them to reconcile their keys by correcting discrepancies, while privacy amplification reduces the amount of information that Eve might have about the key. The amount of privacy amplification required depends on the error rate
and is determined using the binary entropy function
.
For example, if the error rate
is 0.1, the binary entropy function
is calculated as follows:
![]()
This value represents the amount of uncertainty introduced by the errors. Alice and Bob can use this value to determine how much of the raw key needs to be sacrificed during privacy amplification to ensure that the final key is secure from Eve.
The binary entropy function
is a fundamental tool in the security analysis of the BB84 protocol. It quantifies the information gain of an eavesdropper and helps establish the security bounds of the protocol. By understanding the relationship between the error rate
and the binary entropy function, Alice and Bob can effectively perform error correction and privacy amplification to ensure the security of their shared key.
Other recent questions and answers regarding Examination review:
- What is the significance of the secret key rate (K) in QKD, and how is it bounded by the entropies shared between the reference system and the eavesdropper, and the reference system and Bob's system?
- How does the conditional entropy (H(R|E)) in the entropic uncertainty relation impact the security analysis of QKD against an eavesdropper?
- What role does the overlap (C) of measurement operators play in defining the entropic uncertainty relation in the context of QKD?
- How do entropic uncertainty relations contribute to the security proof of quantum key distribution (QKD) protocols?

