Quantum Protocol for Anonymous Communication

Updated 30 December 2025

Quantum anonymous communication leverages multipartite entanglement (GHZ, W, cluster states) to ensure information-theoretic security and safeguard identities.
Protocols utilize symmetry, indistinguishability, and verification rounds to implement anonymous notification, collision detection, and entanglement generation.
Experimental implementations in photonic networks demonstrate robust key rates, high fidelity, and resilience to loss across various configurations.

A fully quantum protocol for anonymous communication enables the transmission of classical or quantum information between a sender and specified recipients such that the identities of the sender and all receivers are protected from any party—including colluding insiders and adversaries with quantum computational power. These protocols are fundamentally enabled by multipartite entanglement, exploit symmetry and indistinguishability of quantum operations, and achieve security and anonymity at the information-theoretic level. Contemporary research demonstrates that such protocols are implementable with a range of entangled resources (GHZ, W, and cluster states), and are verifiable, device-independent, and composably secure. The following presents a comprehensive account of this topic, integrating design principles, foundational models, protocol methodologies, security proofs, resource tradeoffs, scalability, and experimental realization.

1. Foundations and Security Objectives

Fully quantum anonymous communication protocols—whether for key agreement or message transmission—are built upon multipartite entanglement distributed in a quantum network. The objectives are specified as follows (Hahn et al., 2020, Thalacker et al., 2021, Grasselli et al., 2021):

Identity protection: Neither senders nor receivers reveal their identities to non-participants nor to each other. Even participating Bobs do not know the identities of other Bobs or Alice.
Information-theoretic secrecy: The shared message or key is inaccessible to any adversarial coalition not containing all intended recipients and the sender.
Robustness: Protocols tolerate up to $t \leq n - 2$ corrupted parties, and operate securely against honest-but-curious (passive), active, and even device-malicious adversaries (Das et al., 24 Dec 2025).

Anonymity Quantification

Formally, sender and receiver anonymity are defined so that any coalition learns the identity of Alice (the sender) or any Bob (receiver) with probability at most $1/(n-t)$ (Hahn et al., 2020, Grasselli et al., 2021). In device-independent settings, the probability for a coalition to guess a sender is bounded by $1/k + \sqrt{\epsilon}$ , with $k$ the number of honest agents and $\epsilon$ the Bell inequality deviation (Das et al., 24 Dec 2025).

2. Quantum Resources, State Symmetry, and Protocol Primitives

Entangled Resources

GHZ States: The $n$ -party Greenberger-Horne-Zeilinger (GHZ) state is the central resource:

$\lvert \mathrm{GHZ}_n \rangle = \frac{1}{\sqrt{2}} ( |0\rangle^{\otimes n} + |1\rangle^{\otimes n} )$

It exhibits global phase-flip symmetry and invariance under local $Z$ rotations, key properties for anonymity (Hahn et al., 2020, Rahaman et al., 2015).

W States: Alternative protocols employ $n$ -party W states, which are robust to qubit loss and exhibit permutation symmetry:

$|W_n\rangle = \frac{1}{\sqrt{n}} \sum_{j=1}^n |0\cdots 1_j \cdots 0\rangle$

W-based anonymous transmission is capable of tolerating one non-responsive node (Lipinska et al., 2018, Gong et al., 2021, Li et al., 2024).

Cluster States: Linear cluster states formed by fusion of Bell pairs allow for scalable, practical anonymous conferencing in non-centralized networks (Jong et al., 2022).

Subprotocols and Building Blocks

Key protocol primitives, often realized in a device-independent fashion (Das et al., 24 Dec 2025), include:

Anonymous Notification: Sender anonymously informs receivers of their roles, typically by applying conditional phase flips and using classical parity-announcement subprotocols, never leaking the mapping between roles and identities (Khan et al., 2020, Grasselli et al., 2021).
Collision Detection: Quantum or classical logic ensures that exactly one sender is active per round, aborting if ambiguity arises (Gong et al., 2021, Huang et al., 2020).
Anonymous Entanglement Generation: Partitioning a multipartite state by local measurements and conditional corrections, only the intended parties end up sharing an EPR or GHZ state (Hahn et al., 2020, Thalacker et al., 2021, Rahaman et al., 2015, Das et al., 24 Dec 2025).
Verification Rounds: Randomly selected rounds are dedicated to verifying the fidelity of the shared state, generally via stabilizer measurements or Bell inequalities (Hahn et al., 2020, Thalacker et al., 2021, Das et al., 24 Dec 2025).

3. Protocol Methodologies and Algorithms

The mechanics of a fully quantum protocol for anonymous communication are as follows:

GHZ-Enabled Anonymous Key Agreement (AKE)

Anonymous notification (classical): Sender Alice executes a classical subprotocol that informs exactly $m$ Bobs of their role without revealing any identities (Hahn et al., 2020, Thalacker et al., 2021). This typically exploits the Broadbent-Tapp method (Hahn et al., 2020) and incurs a one-time $O(n^3)$ communication cost.
Multipartite entanglement distillation: Nonparticipants measure their qubits in the $X$ basis, broadcasting outcomes. Alice and Bobs delay measurement. The parity of the $X$ outcomes is used to correct the phase of the remaining $(m+1)$ qubits, yielding a GHZ $_{m+1}$ state (Hahn et al., 2020).
Key generation: Alice and Bobs measure in the $Z$ basis; the joint outcomes yield raw key bits.
Verification rounds: On randomly selected rounds, all participants measure in $X$ or $Y$ bases and test for pseudotelepathy parity correlations to bound the fidelity of the underlying state.
Security assurance: Acceptance probability for a state of trace-distance $\epsilon$ from ideal is at most $(1-\epsilon^2/2)^{D-1}$ after $D-1$ verification rounds.

Device-Independent Anonymous Transmission

Protocols relying solely on observed correlations to ensure security against device-malicious adversaries proceed with:

Bell Inequality Self-Testing: Prior to any use, parties perform device-independent statistical checks, with fidelity deficit $\delta$ proportional to the observed Bell operator violation (Das et al., 24 Dec 2025).
Parity and Veto via GHZ: Quantum parity computation is realized by local $Z$ operations (encoding private input), followed by Hadamard measurement and public broadcasting. The XOR of classical outputs recovers the function value while masking individual inputs.
Anonymous Entanglement and Teleportation: At the end of authentication, a postselected GHZ partition enables robust anonymous EPR pair establishment, followed by anonymous quantum teleportation with no role linkage in the message statistics.

W protocols employ symmetric $X$ operations and measurement structures:

Collision Detection: Agents encode intent to send via Pauli- $X$ , measurement patterns determine unique sender via parity of outcomes, robust to up to one missing node (Lipinska et al., 2018, Gong et al., 2021).
Anonymous Notification: Sender applies a secret random even/odd number of $X$ operations, ensuring only the designated receiver will observe a unique parity.
Anonymous Entanglement: Conditioned measurement patterns enable only sender and receiver to share the EPR pair; all others' outcomes are independent.
Secret Sharing: Post-entanglement, the sender teleports the secret via a W-state; recovery by receivers is coordinated through announced $Z$ -measurement outcomes (Li et al., 2024).

4. Security Analysis: Mathematical and Information-Theoretic Proofs

Central security proofs exploit permutation symmetry and parity indistinguishability in both classical and quantum domains:

Information-Theoretic Anonymity

GHZ protocols: Monogamy and nonlocality of entanglement guarantee that all subsystems except the full participant set are maximally mixed (Rahaman et al., 2015).
Device-independence: The probability for a coalition to guess the sender is bounded by $1/k+\sqrt{\epsilon}$ , where $\epsilon$ is the observed Bell inequality violation (Das et al., 24 Dec 2025).
Classical cryptographic subroutines: Parity and logical OR computations are implemented such that, upon completion, no observer holds any distinguishing data regarding input participants.

Composable Secrecy and Correctness

Key secrecy: Protocols achieve an information-theoretic bound on the trace distance between the shared key distribution and uniform, independent of adversarial side-information (Grasselli et al., 2021, Webb et al., 2023).
Abort probability: Verification rounds and error correction invoke statistical bounds (Hoeffding or Chernoff) to ensure that the completeness and soundness parameters are within the chosen security budget.

5. Resource Efficiency, Scalability, and Performance Metrics

Table: Multipartite (GHZ) vs. Bipartite Key Agreement Resource Scaling (Grasselli et al., 2021, Webb et al., 2023)

Protocol variant	Entanglement cost	Classical rounds
GHZ (multiparty)	$O(n)$ per bit	$O(1)$ per round
Bipartite (Bell pairs)	$O(n^3)$ per bit	$O(n)$ per round

Key rate: For honest sources, ideal GHZ protocols yield $L$ key bits per $L$ GHZ states; verified implementations reduce rate by a factor $1/D$ due to verification overhead.
Noise and loss tolerance: W-state protocols offer improved resilience to node failure and dephasing; GHZ-based protocols have slightly higher rate but lower loss tolerance (Lipinska et al., 2018, Li et al., 2024).
Experimental implementation: Modern photonic platforms demonstrate four- and six-photon GHZ generation with fidelities $F\approx 0.81$ –$0.93$; successful key generation rates up to 0.017 bps per round in four-party setups (Hahn et al., 2020, Thalacker et al., 2021, Webb et al., 2023).

6. Generalizations, Open Directions, and Practical Deployment

Many-to-many anonymous exchanges: Simultaneous bidirectional anonymous communication among all parties with a single GHZ superposition, employing distributed phase-encoding and classical shuffling (Andronikos et al., 18 Jul 2025).
Anonymous conference key agreement in linear networks: Fusion of Bell pairs into cluster states supports anonymous multi-party key establishment without central entanglement sources, extending practicality to repeater architectures (Jong et al., 2022).
Quantum routing and onion protocols: Quantum key distribution–protected onion routing can be achieved with no trusted relays, extending classical Tor anonymity to quantum-resistant scenarios (Rahman et al., 2024, Sun et al., 2016).

7. Experimental Realization and Comparative Metrics

Quantum anonymous communication protocols have been experimentally validated in metropolitan networks and table-top demonstrations, with operational rates, error metrics, and anonymity guarantees tabulated as follows:

Network size	Key rate / round	Fidelity	Adversary guessing bound	Reference
4-photon GHZ	0.006–0.017 bps	$0.81$	$\leq 1/3$	(Hahn et al., 2020)
8-user QKD net	40–45 Hz (parity)	$>0.99$	$1/(n-t)$	(Huang et al., 2020)
6-photon GHZ	0.67 Hz	$0.825$	$1/(n-m)$ perfe. anon.	(Webb et al., 2023)
W-state protocols	$2/N$ success	–	$1/(n-\|\mathcal D\|)$	(Lipinska et al., 2018)

These implementations confirm the compressive resource advantage, information-theoretic anonymity, and high-fidelity entanglement required for scalable, secure quantum anonymous communication.

In summary, fully quantum protocols for anonymous communication leverage multipartite entanglement (GHZ, W, cluster states) and protocol symmetry to achieve information-theoretic security for both identity and message confidentiality. Approaches range from device-independent Bell self-testing frameworks to explicit multipartite key agreement in both star and linear network topologies. Modern experiments confirm theoretical predictions on resource and security scaling, and open directions include many-to-many parallel exchanges, high-loss tolerant coding, and integration with quantum onion-routing architectures (Hahn et al., 2020, 2024.06126, Das et al., 24 Dec 2025, Lipinska et al., 2018, Thalacker et al., 2021, Webb et al., 2023, Grasselli et al., 2021, Li et al., 2024, Andronikos et al., 18 Jul 2025, Jong et al., 2022, Sun et al., 2016).