22 Nov 2026, Sun

Researchers Break Post-Quantum Cryptography Barrier with "Aker," the First Efficient Two-Party SLH-DSA Protocol

The landscape of cryptographic key protection and digital security is undergoing a seismic shift as institutions prepare for a post-quantum future. Threshold signing—a method widely deployed across the cybersecurity and blockchain sectors to safeguard critical cryptographic keys by splitting them among multiple parties—has long been considered standard practice for preventing single points of failure. However, extending these robust deployments to post-quantum signature standards has presented an immense engineering and mathematical hurdle. While the National Institute of Standards and Technology’s (NIST) lattice-based signatures have successfully birthed efficient threshold protocols, distributed signing for SLH-DSA (FIPS 205), NIST’s stateless hash-based signature standard, has historically been dismissed as prohibitively expensive. Because hash-based signatures lack the neat algebraic structures that lattice-based protocols routinely exploit, generating them collaboratively across multiple servers or devices required staggering amounts of computation and communication.

That computational roadblock may finally be clearing. A team of researchers from Fordefi and Mysten Labs has unveiled a breakthrough protocol dubbed Aker, marking a major milestone in applied cryptography. Detailed in a newly released research paper titled "Aker: Efficient Two-Party SLH-DSA" (Paper 2026/2899) authored by Yaron Salman, Ben Riva, and Dmitry Kogan, the innovation introduces a maliciously secure two-party signing protocol that remains fully compatible with an unmodified FIPS 205 verifier. This development proves that secure, distributed signing for stateless hash-based signatures is not a distant theoretical goal, but a practical reality that can be implemented using today’s technology.

The core difficulty of distributing SLH-DSA signatures lies in the intricate architecture of the scheme itself. Unlike signatures built on algebraic assumptions, SLH-DSA relies on a massive hypertree of hash functions. In a standard single-party setting, computing these hashes is straightforward, but doing so securely across two parties who do not trust one another—using generic secure multiparty computation (MPC)—typically bogs down systems with heavy sequential bottlenecks.

To overcome this fundamental challenge, the research team behind Aker developed an innovative approach that combines generic secret-sharing MPC with four distinct optimization techniques, each designed to dismantle the structural complexities of the SLH-DSA hypertree.

The first of these optimizations involves evaluating active layers concurrently. By running these layers in parallel rather than sequentially, the protocol collapses the traditional, deep sequential hashing depth down to the equivalent of a single chain, radically accelerating processing times.

The second optimization introduces a smart public key caching mechanism. This allows authentication paths to be computed locally by the participating parties, ensuring that only the specific signing leaf needs to be evaluated within the heavy MPC environment.

Third, the protocol utilizes path-prefix fixing. This clever technique allows signers to reuse entire upper-layer signatures across multiple messages, drastically trimming down the repetitive mathematical labor required for successive signatures.

Finally, Aker introduces one-time subtrees that sample lower-layer signature components locally, bypassing the need to constantly derive them from the master secret key and further reducing the workload inside the MPC framework.

The authors note, however, that these performance gains do not come entirely without trade-offs. Some of these optimizations require stateful signers and impose a controlled lower limit on the total number of signatures that can be generated per key. Nevertheless, for high-security enterprise and institutional environments, this compromise is an exceptionally modest price to pay for dramatic performance improvements.

To demonstrate the real-world viability of their theoretical work, the researchers implemented and evaluated their protocols using SHAKE-based SLH-DSA across two distinct deployment scenarios. The results underscore just how far distributed post-quantum cryptography has advanced.

In the first scenario, tailored for server-to-server deployments, the team combined their novel cryptographic techniques with a cutting-edge GPU engine designed specifically for maliciously secure Boolean GMW (Goldreich-Micali-Wigderson) protocols. Testing the system between two single-GPU servers hosted by separate cloud providers over the public Internet, the researchers recorded online signing times for SLH-DSA-128f of just 2.09 seconds. When configured with a lower signature limit to maximize efficiency, that online signing time plummeted to an astonishing 0.76 seconds. Meanwhile, the input-independent Beaver triple generation—a notoriously heavy computational phase—was pushed entirely offline, where it scaled horizontally across keyless CPU workers, keeping the live network unburdened.

In the second scenario, designed for client-server architectures, the workflow is even more streamlined for end-users. A periodic offline session quietly prepares a robust reserve of over a hundred pre-computed signatures in the background. Once this reserve is established, subsequent online signing operations require a mere four low-bandwidth communication rounds and straightforward local hashing, making post-quantum security feasible even for resource-constrained client applications.

The implications of the Aker protocol extend well beyond the immediate scope of two-party architectures. While the research paper focuses primarily on the two-party setting—a crucial configuration for institutional custody, enterprise security, and co-signed digital asset wallets—the underlying optimizations are modular enough to scale directly to environments involving a greater number of parties.

By proving that maliciously secure distributed signing for SLH-DSA is entirely achievable today, Salman, Riva, and Kogan have provided the cryptographic community with an essential tool for the post-quantum era. As organizations worldwide look toward a future where quantum computers could potentially compromise traditional digital signatures, protocols like Aker ensure that high-security distributed systems can adopt NIST’s hash-based standards without sacrificing performance, usability, or security.

Leave a Reply

Your email address will not be published. Required fields are marked *