Skip to content

B92 protocol

A two-state quantum key-distribution protocol whose security relies on the impossibility of perfectly distinguishing nonorthogonal quantum states without disturbance.

Version
v2 · 2026-09-19 · History
Domain-specific #
3380
Domain group
Natural Sciences
Origin domain
Physics
Subdomain
Quantum Cryptography → Physics

Core Idea

B92 establishes correlated secret bits from quantum signals that an interceptor cannot copy or identify perfectly. The receiver obtains only some conclusive state identifications, public sifting selects them and error and loss statistics bound information leakage before postprocessing. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of quantum cryptography. It is A two-state quantum key-distribution protocol whose security relies on the impossibility of perfectly distinguishing nonorthogonal quantum states without disturbance.

How would you explain it like I'm…

 

No faithful explanation at this level. Two of three generators judge that any child-level picture (look-alike or blurry signals, a seal that shows tampering) describes a classical object a careful spy could in principle copy or inspect, collapsing into ordinary noise or clumsy peeking and missing that security rests on the quantum impossibility of perfectly distinguishing nonorthogonal states without disturbance.

The Two-Light Secret Code

B92 is a way for two people to make a shared secret code using single particles of light. It uses a strange rule of nature: two particular quantum states can't be told apart perfectly, and trying to check them can disturb them. The sender sends light in one of two such states. The receiver can only sometimes tell for sure which one arrived, and the two people publicly agree to keep just those sure results. Then they check how many errors and losses there were to estimate how much a spy could have learned. Keeping the sure results isn't enough on its own — they still need extra clean-up steps before they have a truly safe key.

Two-State Quantum Key Distribution

B92 is a quantum key distribution protocol that uses just two quantum states that are nonorthogonal — they overlap, so no measurement can tell them apart perfectly, and an eavesdropper can neither copy them perfectly nor identify them without causing disturbance. The sender encodes random bits in these two states. The receiver makes measurements that are sometimes conclusive (definitely identifying the state) and often inconclusive; through public 'sifting', both parties keep only the conclusive results. Error and loss statistics are then used to bound how much information leaked to an eavesdropper, and postprocessing (error correction and privacy amplification) produces the final key. A key point is that successful sifting is not the same as a secure key: security and key-rate claims depend on an explicit model of the channel, the detectors, and the adversary.

 

B92 is a two-state quantum key distribution protocol whose security rests on the impossibility of perfectly distinguishing nonorthogonal quantum states without disturbance, so an interceptor can neither clone nor reliably identify the signals. The sender encodes bit values in two nonorthogonal states; the receiver performs measurements that yield conclusive state identifications only on a fraction of signals, the rest being inconclusive. Public sifting retains the conclusive events as correlated raw key. Observed error and loss statistics are then used to bound the information an eavesdropper could have obtained, after which postprocessing distills a shorter secret key. Security and key-rate claims are meaningful only under an explicit channel, detector, and adversary model. Successful sifting must not be equated with a secure final key.

Scope of Application

B92 protocol belongs to quantum cryptography and is useful where the analyst can specify sender and receiver, two nonorthogonal states, measurement choices, authenticated public discussion, conclusive outcomes, error estimation and adversary model, then evaluate security and key-rate claims use an explicit channel, detector and adversary model and do not equate successful sifting with a secure final key. The scope is broad within that domain but bounded by the need for security and key-rate claims use an explicit channel, detector and adversary model and do not equate successful sifting with a secure final key. High-level protocol identity only; no deployment parameters or interception guidance.

Clarity

The abstraction clarifies a crowded vocabulary by making security and key-rate claims use an explicit channel, detector and adversary model and do not equate successful sifting with a secure final key the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name B92 protocol can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to B92 protocol. B92 protocol compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: sender and receiver, two nonorthogonal states, measurement choices, authenticated public discussion, conclusive outcomes, error estimation and adversary model. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express security and key-rate claims use an explicit channel, detector and adversary model and do not equate successful sifting with a secure final key independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of quantum cryptography because they reuse sender and receiver, two nonorthogonal states, measurement choices, authenticated public discussion, conclusive outcomes, error estimation and adversary model, The receiver obtains only some conclusive state identifications, public sifting selects them and error and loss statistics bound information leakage before postprocessing., and type the carrier, state every parameter and convention in the definition, test that security and key-rate claims use an explicit channel, detector and adversary model and do not equate successful sifting with a secure final key, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for B92 protocolParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.B92 protocolDOMAINPrime abstraction: Uncertainty — is a kind ofUncertaintyPRIME

Current abstraction B92 protocol Domain-specific

Parents (1) — outgoing typed relations

  • B92 protocol is a kind of Uncertainty Prime

    What makes it its own entry: A two-state quantum key-distribution protocol whose security relies on the impossibility of perfectly distinguishing nonorthogonal quantum states without disturbance.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

B92 protocol sits in a crowded region of the domain-specific corpus (23rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Cryptographic Protocols & Ciphers (15 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25