New Quantum-Proof Digital Signature Survives Simulated Quantum Attacks

The race to build quantum computers has long been framed as a distant threat, but cryptographers now treat it as an engineering deadline. A team at Griffith International College and Henan University of Technology in Zhengzhou, China, has unveiled FSDS-OTS+, a digital signature scheme designed to survive quantum attackers while remaining small and fast enough for blockchains, IoT devices, and decentralized finance platforms. The work, published in Cluster Computing, builds on the group’s earlier FSDS-OTS design and adds something the previous version lacked: formal security proofs, reduction robustness, and empirical validation inside the Quantum Random Oracle Model, or QROM. The result is a post-quantum signature architecture that its authors describe as secure-by-design, empirically confirmed, and deployment-ready.

Digital signatures are the trust anchors of the modern internet. They prove that a message, a transaction, or a firmware update really came from the claimed sender and was not altered in transit. Nearly every signature scheme deployed today relies on mathematical problems that quantum computers running Shor’s algorithm could solve in polynomial time, which means the entire trust framework safeguarding blockchain networks, IoT ecosystems, and decentralized finance could collapse once sufficiently powerful quantum hardware arrives. The threat is compounded by harvest-now-decrypt-later strategies, in which adversaries record encrypted traffic today and decrypt it tomorrow with quantum machines. Signatures face a subtler version of the same problem: an attacker who records a public key now could forge signatures later, invalidating past transactions on an immutable ledger.

FSDS-OTS+ is founded on the computational difficulty of two lattice problems: Learning With Errors (LWE) and Short Integer Solution (SIS). These problems are believed to resist quantum attacks because no known quantum algorithm solves them efficiently, even in principle. LWE asks an attacker to distinguish noisy linear equations from random ones, while SIS requires finding a short vector that satisfies many random modular constraints. Both problems underpin worst-case to average-case reductions in lattice cryptography, meaning that breaking the scheme in the average case would imply solving the problems in their hardest known instances. The scheme integrates AI-enhanced public key compression, zero-knowledge verifiability, and homomorphic consistency checks to provide a compact and efficient post-quantum signature solution that goes beyond raw lattice hardness.

The methodology employs a dual approach. On the theoretical side, the authors provide reduction proofs that demonstrate EUF-CMA security against quantum attackers. EUF-CMA, or existential unforgeability under chosen-message attack, is the gold standard for signature security: it guarantees that no efficient adversary, even one allowed to request signatures on messages of its choosing, can produce a valid signature on any new message. Proving this in the QROM is significantly harder than in the classical random oracle model because a quantum adversary can query the oracle in superposition, forcing the reduction to handle quantum-accessible hash functions. The authors also demonstrate reduction robustness, ensuring that the security proofs remain valid even when the underlying assumptions are perturbed or the reduction parameters shift, a property that guards against subtle proof failures that have undermined other schemes.

On the empirical side, the team ran simulation-based assessments using MATLAB, Python with NumPy and PyTorch, and SageMath, incorporating real physical datasets to calibrate adversarial modeling. These datasets are unusual for a cryptography paper: GPS satellite time-drift offsets ranging from 10^-9 to 10^-6 seconds from the US Naval Observatory, muon decay lifetimes from CERN’s muon storage ring with a Lorentz factor of 29, and discrepancies from NIST optical lattice clocks accurate to 10^-18 seconds. The authors use these empirical phenomena of time instability to model quantum-adaptive drift, in which an attacker exploits tiny timing discrepancies to erode the nominal security strength of the scheme. By anchoring adversarial simulations in measured physical data rather than synthetic noise, the team aims to capture realistic attack surfaces that purely theoretical analyses might miss.

The experimental findings are striking. FSDS-OTS+ maintains at least 90 percent of its nominal security strength under quantum-adaptive drift settings, a robustness margin that few competing schemes have demonstrated under equivalent conditions. The scheme produces compressed public keys as small as 4.2 kilobytes, signature sizes of 6.8 kilobytes, and verification latency as low as 1.8 milliseconds. These numbers matter because post-quantum signatures are notoriously bulky: lattice and hash-based schemes often produce signatures tens of kilobytes in size, which strains bandwidth-limited IoT networks and inflates blockchain storage requirements. The AI-enhanced compression pipeline appears to be the key differentiator, learning to represent public keys more efficiently without sacrificing the hardness guarantees of the underlying lattice problems.

Comparative benchmarks indicate enhanced performance compared to SPHINCS+, Picnic, and LMS/HSS, with competitive results against Dilithium, especially in resource-limited IoT applications. SPHINCS+ is a stateless hash-based signature scheme standardized by NIST, prized for its conservative security assumptions but criticized for slow signing and large signatures. Picnic relies on zero-knowledge proofs and offers small public keys but large signatures. LMS/HSS is a lightweight hash-based scheme designed for constrained devices but requires careful state management. Dilithium, the NIST-selected lattice signature, offers strong performance but produces larger keys and signatures than FSDS-OTS+ under the reported benchmarks. The new scheme’s combination of small keys, small signatures, and fast verification positions it as an attractive option for next-generation blockchains, IoT networks, and quantum-era distributed systems.

One-time signatures occupy a special niche in post-quantum cryptography. Unlike multi-time schemes, they can sign only a single message per key pair, which simplifies security proofs and reduces the attack surface but requires key management strategies such as Merkle tree aggregation to scale. The FSDS-OTS+ design embraces this constraint and turns it into an advantage: the formal reduction proofs are cleaner because the adversary has fewer signing queries to exploit, and the homomorphic consistency checks allow verifiers to confirm that a signature was generated under the correct key without revealing the key itself. Zero-knowledge verifiability ensures that the verification process leaks nothing beyond the validity of the signature, a property that becomes increasingly important as signatures are deployed in privacy-sensitive contexts such as federated learning and threshold signing.

The work arrives at a pivotal moment for post-quantum cryptography standardization. NIST has been running an additional signature standardization process, with the second round of additional digital signature schemes documented in NIST IR 8610, reflecting the community’s recognition that the initially selected schemes may not cover all deployment scenarios. Lattice-based signatures for embedded IoT systems, post-quantum blockchain frameworks, and quantum-secured distributed ledgers have proliferated in recent literature, but few have combined formal QROM proofs with dataset-calibrated adversarial simulations. The FSDS-OTS+ authors argue that this dual assurance, pairing reductionist security guarantees with empirically grounded attack modeling, is what distinguishes a deployment-ready scheme from a theoretical curiosity.

The implications extend across the digital economy. Blockchains face an existential reckoning because their immutability means that transactions signed with quantum-vulnerable schemes cannot be retroactively protected; once a quantum computer arrives, every historical transaction on a vulnerable chain becomes a potential forgery target. IoT ecosystems, with billions of constrained devices, need signatures that fit within tight memory, bandwidth, and energy budgets while resisting quantum adversaries for decades of device lifetime. Decentralized finance platforms compound both problems, requiring high-throughput verification and long-term trust in immutable ledgers. FSDS-OTS+ addresses all three domains with a scheme that its authors position as secure-by-design, empirically confirmed, and deployment-ready. Whether it will be adopted by the broader community depends on independent scrutiny of its proofs and benchmarks, but the combination of formal QROM security, reduction robustness, and real-world performance numbers makes it a serious contender in the quantum-era cryptographic landscape.

Subject of Research: FSDS-OTS+: formal security proofs, reduction robustness, and quantum-adaptive improvements in the random oracle model

Article Title: FSDS-OTS+: formal security proofs, reduction robustness, and quantum-adaptive improvements in the random oracle model

Article References: Nauman, U., Hongyue, L., & Deng, M. (2026). FSDS-OTS+: formal security proofs, reduction robustness, and quantum-adaptive improvements in the random oracle model. Cluster Computing, 29(15), Article 862. https://doi.org/10.1007/s10586-026-06697-3

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06697-3

Keywords: FSDS-OTS, formal, security, proofs, reduction, robustness, quantum-adaptive, improvements, random, oracle, model, scientific research