The post-quantum future of web privacy

The piece explains why web privacy systems need protection against quantum computers before such machines exist. Attackers can collect encrypted traffic today and store it for later decryption, while a sufficiently powerful quantum computer could break public-key cryptography based on elliptic curves. That threat matters for privacy tools that use cryptographic tokens to prove something about a user without revealing their identity or activity. The central challenge is replacing vulnerable cryptography without making these tools too slow or costly to use at internet scale.

Vole-Mole is presented as a post-quantum approach to oblivious pseudorandom functions, a building block that lets a client obtain a cryptographic token from a server without disclosing the underlying input. Rather than relying on quantum-vulnerable public-key assumptions, it uses vector oblivious linear evaluation, a technique designed to support efficient protocols from assumptions believed to withstand quantum attacks. The design aims to make privacy-preserving services, including systems that issue anonymous tokens, viable in a post-quantum environment. Its significance is practical as well as theoretical: moving to quantum-resistant cryptography can preserve the privacy properties of existing web services, but adoption depends on protocols that keep communication and computation manageable.