The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
SPHINCS: Practical Stateless Hash-Based Signatures
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Constructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 649
Lattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557
The Salsa20 Family of Stream Ciphers
Bernstein, D. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_8 · Cited by 429
Self-citationA construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1997) · Journal of Cryptology · doi:10.1007/s001459900025 · Cited by 351
XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Buchmann, J., Dahmen, E., & Hülsing, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_8 · Cited by 312
Self-citationBLAKE2: Simpler, Smaller, Fast as MD5
Aumasson, J.-P., Neves, S., Wilcox-O’Hearn, Z., & Winnerlein, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38980-1_8 · Cited by 303
Self-citation
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Self-citationFernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
The impact of quantum computing on present cryptography
Mavroeidis, V., Vishi, K., D., M., & Jøsang, A. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090354 · Cited by 361
The SPHINCS + Signature Framework
Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363229 · Cited by 306
Self-citationTransitioning organizations to post-quantum cryptography
Joseph, D., Misoczki, R., Manzano, M., Tricot, J., Pinuaga, F. D., Lacombe, O., Leichenauer, S., Hidary, J., Venables, P., & Hansen, R. (2022) · Nature · doi:10.1038/s41586-022-04623-2 · Cited by 281
Metadata
- Authors
- Bernstein, D. J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., & Wilcox-O’Hearn, Z.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2015
- Pages
- 368-397
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2172273481
- Cited by
- 374
- References
- 23
- FWCI
- 17.04
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SPHINCS: Practical Stateless Hash-Based Signatures. https://app.cochat.ai/papers/10.1007/978-3-662-46800-5_15
- The paper
- Bernstein, D. J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., & Wilcox-O’Hearn, Z. (2015). SPHINCS: Practical Stateless Hash-Based Signatures. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-46800-5_15
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.