The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
The SPHINCS + Signature Framework
Open accessAbstract
We introduce SPHINCS+, a stateless hash-based signature framework. SPHINCS+ has significant advantages over the state of the art in terms of speed, signature size, and security, and is among the nine remaining signature schemes in the second round of the NIST PQC standardization project. One of our main contributions in this context is a new few-time signature scheme that we call FORS. Our second main contribution is the introduction of tweakable hash functions and a demonstration how they allow for a unified security analysis of hash-based signature schemes. We give a security reduction for SPHINCS+ using this abstraction and derive secure parameters in accordance with the resulting bound. Finally, we present speed results for our optimized implementation of SPHINCS+ and compare to SPHINCS-256, Gravity-SPHINCS, and Picnic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
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. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
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
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Ducas, L., Kiltz, E., Lepoint, T., et al. (2018) · IACR Trans. Cryptogr. Hardw. Embed. Syst. · doi:10.13154/tches.v2018.i1.238-268 · Cited by 917
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., & Stehlé, D. (2018) · IACR Transactions on Cryptographic Hardware and Embedded Systems · doi:10.46586/tches.v2018.i1.238-268 · Cited by 713
Self-citationConstructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 649
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
SPHINCS: Practical Stateless Hash-Based Signatures
Bernstein, D. J., Hopwood, D., Hülsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., & Wilcox-O’Hearn, Z. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_15 · Cited by 374
Self-citationStatus report on the first round of the NIST post-quantum cryptography standardization process
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang, Q., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., et al. (2019) · doi:10.6028/nist.ir.8240 · Cited by 364
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-citationBetter than BiBa: Short One-Time Signatures with Fast Signing and Verifying
Reyzin, L., & Reyzin, N. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45450-0_11 · Cited by 295
Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_17 · Cited by 290
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D., & Zaverucha, G. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133997 · Cited by 251
MDx-MAC and Building Fast MACs from Hash Functions
Preneel, B., & van Oorschot, P. C. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_1 · Cited by 213
XMSS: eXtended Merkle Signature Scheme
Huelsing, A., Butin, D., Gazdag, S., Rijneveld, J., & Mohaisen, A. (2018) · doi:10.17487/rfc8391 · Cited by 199
Self-citationW-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
Hülsing, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38553-7_10 · Cited by 195
Self-citationNon-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
Unruh, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_25 · Cited by 160
Unruh, D. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_10 · Cited by 151
Mitigating Multi-target Attacks in Hash-Based Signatures
Hülsing, A., Rijneveld, J., & Song, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49384-7_15 · Cited by 130
Self-citationComputationally Binding Quantum Commitments
Unruh, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5_18 · Cited by 122
Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
Goldreich, O. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_8 · Cited by 116
On the Security of the Winternitz One-Time Signature Scheme
Buchmann, J. A., Dahmen, E., Ereth, S., Hülsing, A., & Rückert, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21969-6_23 · Cited by 109
Self-citationLeighton-Micali Hash-Based Signatures
McGrew, D. A., Curcio, M., & Fluhrer, S. R. (2019) · doi:10.17487/rfc8554 · Cited by 101
The Lattice-Based Digital Signature Scheme qTESLA
Alkım, E., Barreto, P. S. L. M., Bindel, N., Krämer, J., Longa, P., & Ricardini, J. E. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-57808-4_22 · Cited by 95
Optimal Parameters for XMSS MT
Hülsing, A., Rausch, L., & Buchmann, J. A. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40588-4_14 · Cited by 86
Self-citationOptimized Interpolation Attacks on LowMC
Dinur, I., Liu, Y., Meier, W., & Wang, Q. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48800-3_22 · Cited by 81
Haraka v2 – Efficient Short-Input Hashing for Post-Quantum Applications
Kölbl, S., Lauridsen, M. M., Mendel, F., & Rechberger, C. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2016.i2.1-29 · Cited by 65
Self-citationDigital Signatures Out of Second-Preimage Resistant Hash Functions
Dahmen, E., Okeya, K., Takagi, T., & Vuillaume, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88403-3_8 · Cited by 54
Cryptanalysis of Low-Data Instances of Full LowMCv2
Rechberger, C., Soleimany, H., & Tiessen, T. (2018) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2018.i3.163-181 · Cited by 52
Improving Stateless Hash-Based Signatures
Aumasson, J.-P., & Endignoux, G. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76953-0_12 · Cited by 45
Decisional Second-Preimage Resistance: When Does SPR Imply PRE?
Bernstein, D. J., & Hülsing, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34618-8_2 · Cited by 20
Self-citationPractical Forward Secure Signatures using Minimal Security Assumptions
Hülsing, A. (2013) · Technischen Universität Darmstadt · doi:10.26083/tuprints-00003651 · Cited by 12
Self-citation
Cited by
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Understand-Before-Talk (UBT): A Semantic Communication Approach to 6G Networks
Pokhrel, S. R., & Choi, J. (2023) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3219363 · Cited by 55
On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials
Flamini, A., Sciarretta, G., Scuro, M., Sharif, A., Tomasi, A., & Ranise, S. (2024) · arXiv · Cited by 24
“A SPHINCS + -128 [BHK + 19] public key is 32 bytes: two 128-bit numbers, a seed and a tree root.”
BackgroundMethod
Metadata
- Authors
- Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P.
- Venue
- Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2019-11-06
- Pages
- 2129-2146
- OpenAlex
- W2987483625
- Cited by
- 306
- References
- 34
- FWCI
- 5.31
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.