SPHINCS: Practical Stateless Hash-Based Signatures

By Daniel J. Bernstein, Daira Hopwood, Andreas Hülsing, Tanja Lange, Ruben Niederhagen, L. Papachristodoulou, Peter Schwabe, Zooko Wilcox-O'Hearn. International Conference on the Theory and Application of Cryptographic Techniques, 2015

430 citations recorded by the source corpus.

This paper introduces a high-security post-quantum stateless hash-based signature scheme that signs hundreds of messages per second on a modern 4-core 3.5GHz Intel CPU. Signatures are 41 KB, public keys are 1 KB, and private keys are 1 KB. The signature scheme is designed to provide long-term \(2^{128}\) security even against attackers equipped with quantum computers. Unlike most hash-based designs, this signature scheme is stateless, allowing it to be a drop-in replacement for current signature schemes.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/5c829bde4d6ebdee62f38fcdb08ab9e897f3b840

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Post-quantum cryptography (2008, neutral): “For such applications stateless systems exist [55] but this feature comes”
The Impact of Quantum Computing on Present Cryptography (2018, background): “zation. Speciﬁcally, the eXtended Merkle Signature Scheme (XMSS) [76] which is a stateful signature scheme, and Stateless Practical Hash-based Incredibly Nice Collision-resilient Signatures (SPHINCS) [77] which is as the name indicates a stateless signature scheme. 4) Code-based Cryptography: Code-b”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, positive): “Currently, variants of eX-tended Merkle Signature Scheme (XMSS) [199] like XMSS-T and SPHINCS [200] are considered promising hash-based signature schemes for the post-quantum era that derive from the Merkle tree scheme described in [201].”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “As mentioned above, the core of Unruh’s argument [84, Lemma 17], says that the probability that the adversary can find a proof such that the extractor cannot extract but the proof still verifies is negligible.”
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018, background): “Instead these schemes require a hidden structure in the instance of the MQ problem, which was a weakness exploited by many attacks on prior protocols (c.f. [KS98, DFSS07, FGP + 15, TW12]).”
Post-quantum Key Exchange - A New Hope (2016, methodology): “It is not surprising that the enormous computational power of these vector instructions has been used before to implement very highspeed crypto (see, for example, [13,15,43]) and also our optimized reference implementation targeting Intel Haswell processors uses those instructions to speed up multip”