Improving Stateless Hash-Based Signatures

Aumasson, Jean-Philippe; Endignoux, Guillaume

doi:10.1007/978-3-319-76953-0_12

Cited by 27 publications

(20 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The PORS [19] scheme is very close to the HORS scheme however, offers stronger security than HORS at a very marginal computational overhead. The key and signature sizes of PORS are exactly same as HORS.…”

Section: ) Hash-based Ots/fts Schemesmentioning

confidence: 92%

“…The popular OTS/FTS schemes proposed to-date include, Lamport-Diffie OTS (LD-OTS) [13], Winternitz OTS (WOTS) [14], WOTS PRF [15], WOTS + [16], HORS [17], HORS with Tree (HORST) [18], and PRNG to obtain a random subset (PORS) [19].…”

Section: Literature Reviewmentioning

confidence: 99%

“…SPHINCS uses HORST FTS and WOTS + as its base schemes. Gravity-SPHINCS [19] is a compact version of SPHINCS which uses PORS and WOTS as its core schemes. SPHINCS-Simpira [21] is an efficient version of SPHINCS which have replaced simple hash functions (SHA256 and SHA512) by AES-based hash permutations Simpira [22].…”

Section: Literature Reviewmentioning

confidence: 99%

“…Other type of OTS/FTS schemes (except WOTS and its variants) are not capable for allowing computation of the public key from the signatures unless a huge additional set of information is provided to the verifier. This additional set of information may either be as large as the original signatures (like in case of LD-OTS scheme [13]) or it may be exponentially larger than the original signatures (like, in case of HORS [17], HORST [18], and PORS [19]). Our proposed schemes (NOTS) is a WOTS like scheme in which the signatures are intelligent enough to allow the verifier for computation of the corresponding public key without any additional set of information.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Novel One Time Signatures (NOTS): A Compact Post-Quantum Digital Signature Scheme

et al. 2020

View full text Add to dashboard Cite

The future of the hash based digital signature schemes appears to be very bright in the upcoming quantum era because of the quantum threats to the number theory based digital signature schemes. The Shor's algorithm is available to allow a sufficiently powerful quantum computer to break the building blocks of the number theory based signature schemes in a polynomial time. The hash based signature schemes being quite efficient and provably secure can fill in the gap effectively. However, a draw back of the hash based signature schemes is the larger key and signature sizes which can prove a barrier in their adoption by the space critical applications, like the blockchain. A hash based signature scheme is constructed using a one time signature (OTS) scheme. The underlying OTS scheme plays an important role in determining key and signature sizes of a hash based signature scheme. In this article, we have proposed a novel OTS scheme with minimized key and signature sizes as compared to all of the existing OTS schemes. Our proposed OTS scheme offers an 88% reduction in both key and signature sizes as compared to the popular Winternitz OTS scheme. Furthermore, our proposed OTS scheme offers an 84% and an 86% reductions in the signature and the key sizes respectively as compared to an existing compact variant of the WOTS scheme, i.e. WOTS +. INDEX TERMS Hash-based digital signatures, post-quantum cryptography, Blockchain, one-time signatures.

show abstract

Section: ) Hash-based Ots/fts Schemesmentioning

confidence: 92%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Novel One Time Signatures (NOTS): A Compact Post-Quantum Digital Signature Scheme

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Signature schemes based on zero-knowledge proofs tend to exchange tiny public keys for prohibitively large signatures [38,7,23,18], and moreover require complicated and expansive non-interactivity transforms to retain security against quantum attackers [40]. Although provable security in the case of hash-based signature schemes is much more straightforward, this family of constructions follows the same pattern: tiny public keys but huge signatures [5,4].…”

Section: Introductionmentioning

confidence: 99%

Public Key Compression for Constrained Linear Signature Schemes

Beullens

Preneel

Szepieniec

2019

Selected Areas in Cryptography – SAC 2018

View full text Add to dashboard Cite

We formalize the notion of a constrained linear trapdoor as an abstract strategy for the generation of signature schemes, concrete instantiations of which can be found in MQ-based, code-based, and latticebased cryptography. Moreover, we revisit and expand on a transformation by Szepieniec et al. [39] to shrink the public key at the cost of a larger signature while reducing their combined size. This transformation can be used in a way that is provably secure in the random oracle model, and in a more aggressive variant whose security remained unproven. In this paper we show that this transformation applies to any constrained linear trapdoor signature scheme, and prove the security of the first mode in the quantum random oracle model. Moreover, we identify a property of constrained linear trapdoors that is sufficient (and necessary) for the more aggressive variant to be secure in the quantum random oracle model. We apply the transformation to an MQ-based scheme, a code-based scheme and a lattice-based scheme targeting 128-bits of post quantum security, and we show that in some cases the combined size of a signature and a public key can be reduced by more than a factor 300.

show abstract