What is a Mixnet and how does it defeat global passive traffic analysis where Tor fails?

Tor operates as a low-latency onion routing network where packets entering an ingress guard node exit an egress node within milliseconds. A global passive adversary (such as a state-level intelligence agency or major ISP observing both ends of the connection) can easily correlate traffic flows by matching packet arrival times, bursts, and sizes. A Mixnet (pioneered by David Chaum in 1981 and deployed in modern systems like Nym) breaks temporal correlation by: 1) chopping all messages into uniform-size Sphinx packets; 2) holding packets in intermediate mixing nodes for randomized intervals governed by a Poisson distribution; 3) shuffling and re-encrypting the packet order before dispatching; and 4) continuously injecting decoy cover traffic. Even an adversary observing 100% of global internet cables cannot correlate senders to receivers.

What is a Verifiable Shuffle and why is a Zero-Knowledge Proof required?

In electronic voting (e-voting) or verifiable anonymous messaging, an untrusted mixing node receives a batch of N encrypted ballots or messages, permutes them using a secret permutation π ∈ S_N, and homomorphically re-encrypts each ciphertext using fresh random blinding factors. The output ciphertexts are decrypted or tallied downstream. To ensure the mixing node did not tamper with, replace, duplicate, or drop any ballots (e.g. replacing a vote for candidate A with candidate B), the node must produce a Verifiable Shuffle Proof. Using zero-knowledge protocols (such as Bayer-Groth or Neff), the node mathematically proves that the output set is an exact permutation and re-encryption of the input set without revealing the secret permutation π.

How does the Bayer-Groth Proof of Shuffle work mathematically?

The Bayer-Groth (2012) shuffle argument reduces the permutation proof to polynomial identity checking. Given two sets of numbers {y_i} and {y’_i} = {y_π(i)}, the polynomials P(X) = ∏(X - y_i) and Q(X) = ∏(X - y’_i) are identical if and only if the multisets are identical. Under the Fiat-Shamir heuristic, the verifier samples a random challenge X. The prover computes homomorphic commitments to intermediate polynomial evaluation products and responds to challenges with multi-exponentiation arguments. Bayer-Groth achieves sub-linear communication complexity O(√N) and verification time orders of magnitude faster than naive pairwise zero-knowledge proofs.

What is the Sphinx packet format and how does it guarantee bitwise unlinkability?

Sphinx is a cryptographic packet format designed by Danezis and Goldberg (2009). Each packet consists of a fixed-size header (containing nested public-key blinding elements and HMAC integrity tags) and an encrypted payload. At each mix node hop, the node uses its private key to derive a shared symmetric secret via ECDH, validates the HMAC tag, strips off the outer header layer, and unrolls a pseudo-random padding layer. The packet maintains an identical byte length at every hop, making ingress and egress packets completely unrecognizable and bitwise unlinkable.

Verifiable Shuffle & Mixnet Architecture Studio

Verified Specification | Standardized Formulas | Instant Precision

Secure & Private (Zero Data Retention) Free Access • No Sign-Up

Verifiable Shuffle & Mixnet Architecture Studio

Model network-level metadata privacy and electronic voting verifiability. Simulate Chaumian Poisson-delay mixnets, Sphinx packet transformations, ElGamal homomorphic re-encryption, and Bayer-Groth zero-knowledge proofs of shuffle.

Chaumian Mixnet Sphinx Packets Bayer-Groth ZKP Poisson Delays

Mixnet Architecture

Mixing network topology and routing strategy

Batch Size: 8 Messages

Number of ciphertexts shuffled per mixing epoch

Poisson Mean Delay (λ)

Randomized hold interval per mix node

Mixnet Dispatch Engine

Executes ElGamal re-encryption and ZK proof

Mixnet Pipeline: Senders -> Node 1 (Shuffle) -> Node 2 (Re-Encrypt) -> Node 3 -> Output

Input Ciphertexts Re-Encrypted Packets Verified Output

Permutation State

π ∈ S_8 (Secret)

40,320 Permutations

Bayer-Groth ZKP

✓ Valid

Soundness 2^-128

Traffic Correlation

0.00%

Global Adversary Blind

Verification Time

1.84 ms

Multi-Exponentiation

Sphinx Packet Size

1,024 Bytes

Constant Across Hops

Cover Traffic Injection

25% Decoy

Poisson Background Noise

Live ElGamal Homomorphic Re-Encryption & Shuffle Trace

Slot	Input Ciphertext C_i	Secret Mapping π(i)	Blinding Scalar r'_i	Shuffled Output C'_j

Production Verifiable Shuffle Code (Rust & Python)

Verifiable Mixnet Cryptographic Foundations

1. Homomorphic Re-Encryption Given ElGamal public key \(h = g^s\), any party can re-randomize ciphertext \(C = (c_1, c_2)\) by picking random scalar \(r'\) and computing \(C' = (c_1 \cdot g^{r'}, c_2 \cdot h^{r'})\). The decrypted plaintext is identical, but the ciphertext is bitwise uncorrelated.

2. Bayer-Groth Multi-Exponentiation The prover commits to permutation matrix columns using generalized Pedersen vector commitments. Verifier challenges collapse \(N\) polynomial equations into a single multi-exponentiation, allowing an entire election of 100,000 ballots to be verified in seconds.

3. Poisson Continuous Delays Rather than releasing batches all at once (which still creates timing markers), mix nodes forward each packet after an exponentially distributed delay \(P(t) = \lambda e^{-\lambda t}\). Packets continuously weave together, defeating statistical timing correlation.

Verifiable Shuffle & Mixnet Architecture Studio

Mixnet Pipeline: Senders -> Node 1 (Shuffle) -> Node 2 (Re-Encrypt) -> Node 3 -> Output

Live ElGamal Homomorphic Re-Encryption & Shuffle Trace

Production Verifiable Shuffle Code (Rust & Python)

Verifiable Mixnet Cryptographic Foundations

🔍 Companion Workbenches & Verification Tools

Publicly Verifiable Secret Sharing (PVSS) & Schoenmakers SCRAPE Studio

Zero-Knowledge Rollups: PLONK & KZG Polynomial Commitments Studio

Bulletproofs & Zero-Knowledge Range Proofs Studio

WireGuard, Mesh Overlays & Kernel Cryptokey Routing Studio

Why Smart Users Are Switching to This Free Toolkit

The Browser Feature Most People Never Use

Stop Paying for Software You Can Get Free

File Conversion Tricks That Save Hours Every Week

This Free Tool Replaced 5 Paid Apps for Our Team

What Your Browser Can Do Without Any Extensions