Paper 2026/2899
Aker: Efficient Two-Party SLH-DSA
Abstract
Threshold signing is widely deployed to protect cryptographic keys, but extending these deployments to post-quantum signatures remains challenging. While NIST's lattice-based signatures now have efficient threshold protocols, distributed signing for SLH-DSA (FIPS 205), NIST's stateless hash-based signature standard, has been considered prohibitively expensive because it lacks the algebraic structure those protocols typically exploit. We present Aker, a maliciously secure two-party signing protocol compatible with an unmodified FIPS 205 verifier. Our approach combines generic secret-sharing MPC with four optimizations that leverage the structure of the SLH-DSA hypertree. Evaluating active layers concurrently collapses sequential hashing depth to that of a single chain. Caching public keys allows authentication paths to be computed locally, so that only the signing leaf is evaluated in MPC. Fixing path prefixes lets signers reuse entire upper-layer signatures across messages. Finally, one-time subtrees sample lower-layer signature components locally rather than deriving them from the secret key, further reducing MPC work. Some of these gains come at the cost of stateful signers and a lower limit on the total number of signatures per key. We implement and evaluate our protocols using SHAKE-based SLH-DSA in two deployment settings. For server--server deployments, we combine these techniques with a new GPU engine for maliciously secure Boolean GMW. Between two single-GPU servers in separate cloud providers over the public Internet, online signing for SLH-DSA-128f takes $2.09$ seconds, or $0.76$ seconds with a lower signature limit, while input-independent Beaver triple generation runs offline and scales horizontally across keyless CPU workers. For client--server deployments, a periodic offline session prepares a reserve of over a hundred signatures, after which online signing requires only four low-bandwidth communication rounds and local hashing. These results show that maliciously secure distributed signing for SLH-DSA is within reach today in the two-party setting, while our optimizations extend directly to more parties.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- post-quantum cryptographySLH-DSAthreshold signingsecure two-party computation
- Contact author(s)
-
yaron @ fordefi com
ben @ fordefi com
dima @ fordefi com - History
- 2026-11-19: approved
- 2026-11-15: received
- See all versions
- Short URL
- https://ia.cr/2026/2899
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2899,
author = {Yaron Salman and Ben Riva and Dimitry Kogan},
title = {Aker: Efficient Two-Party {SLH}-{DSA}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2899},
year = {2026},
url = {https://eprint.iacr.org/2026/2899}
}