🤖 AI Summary
To address the high storage and verification overhead caused by large long-term public keys (e.g., root certificates, secure firmware updates) in post-quantum signature schemes, this paper introduces a private verification key mechanism that replaces bulky public keys with compact private keys, enabling lightweight verification. It is the first work to achieve efficient public-key compression—while preserving provable security—within the GPV-based unstructured lattice signature framework. The method is compatible with short-signature schemes such as Wave and Squirrels: for Squirrels-I, the public key shrinks from 665 kB to 20.7 kB (32× compression); for Wave822, it reduces from 3.5 MB to 207.97 kB (16.8×). This significantly lowers storage requirements and verification latency. The core innovation lies in unifying public-key compression with key derivation, allowing verification to depend solely on a small private verification key—thereby breaking the verification-efficiency bottleneck without compromising security.
📝 Abstract
Many signature applications-such as root certificates, secure software updates, and authentication protocols-involve long-lived public keys that are transferred or installed once and then used for many verifications. This key longevity makes post-quantum signature schemes with conservative assumptions (e.g., structure-free lattices) attractive for long-term security. But many such schemes, especially those with short signatures, suffer from extremely large public keys. Even in scenarios where bandwidth is not a major concern, large keys increase storage costs and slow down verification. We address this with a method to replace large public keys in GPV-style signatures with smaller, private verification keys. This significantly reduces verifier storage and runtime while preserving security. Applied to the conservative, short-signature schemes Wave and Squirrels, our method compresses Squirrels-I keys from 665 kB to 20.7 kB and Wave822 keys from 3.5 MB to 207.97 kB.