SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost
Andreas Hülsing, Mikhail A. Kudinov, Eyal Ronen, Eylon Yogev
摘要
SPHINCS+ [CCS ’19] is one of the selected post-quantum digital signature schemes of NIST’s post-quantum standardization process. The scheme is a hash-based signature and is considered one of the most secure and robust proposals. The proposal includes a fast (but larger) variant and a small (but slower) variant for each security level. The main problem that might hinder its adoption is its large signature size. Although SPHINCS+ supports a trade-off between signature size and the computational cost of signing, further reducing the signature size (below the small variants) results in a prohibitively high computational cost for the signer.This paper presents several novel methods for further compressing the signature size while requiring negligible added computational costs for the signer and further reducing verification time. Moreover, our approach enables a much more efficient trade-off curve between signature size and the computational costs of the signer. In many parameter settings, we achieve small signatures and faster running times simultaneously. For example, for 128-bit (classical) security, the small signature variant of SPHINCS+ is 7856 bytes long, while our variant is only 6304 bytes long: a compression of approximately 20% while still reducing the signer’s running time. However, other trade-offs that focus, e.g., on verification speed, are possible.The main insight behind our scheme is that there are predefined specific subsets of messages for which the WOTS+ and FORS signatures (that SPHINCS+ uses) can be compressed, and generation can be made faster while maintaining the same security guarantees. Although most messages will not come from these subsets, we can search for suitable hashed values to sign. We sign a hash of the message concatenated with a counter that was chosen such that the hashed value is in the subset. The resulting signature is both smaller and faster to sign and verify.Our schemes are simple to describe and implement. We provide an implementation, a theoretical analysis of speed and security, as well as benchmark results.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper2
相关 Paper
- Shorter Hash-Based Signatures Using Forced PruningMehdi Abri, Jonathan KatzCRYPTO 2026
- Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to SPHINCS+ and XMSSKaiyi Zhang, Hongrui Cui, Yu YuCRYPTO 2023 · 被引用 7 次
- At the Top of the Hypercube - Better Size-Time Tradeoffs for Hash-Based SignaturesDmitry Khovratovich, Mikhail A. Kudinov, Benedikt WagnerCRYPTO 2025 · 被引用 5 次
- HERO-Sign: Hierarchical Tuning and Efficient Compiler-Time GPU Optimizations for SPHINCS+ Signature GenerationYaoyun Zhou, Qian WangHPCA 2026
- TACHYON: Fast Signatures from Compact KnapsackRouzbeh Behnia, Muslum Ozgur Ozmen, Attila A. Yavuz, Mike RosulekCCS 2018 · 被引用 12 次
