Questions tagged [hash-signature]

Hash-based digital signatures, such as Lamport one-time signatures, are digital signature schemes based on a (non-trapdoor) one-way function such as a cryptographic hash. Such schemes are expected to remain secure even against attacks using quantum computers.

10 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3
votes
0answers
42 views

Are there any hash-based multisignature schemes?

Are there any hash-based signature schemes which would let two (or more) people sign the same message without increasing the size of the signature linearly? For my purposes, it is fine if the scheme ...
2
votes
0answers
153 views

Using digital signature to reduce storage requirement

Below question is a part of my assignment and I was completely clueless about where to start from. So, I am posting it here for the purpose of getting hints/resources to help me get started. $ \ '' $...
2
votes
0answers
126 views

Can this hash-based, short signature scheme work, given a decentralized log of messages as a primitive?

Suppose we had a decentralized log of messages, i.e., an ever-growing array of information on which anyone could append arbitrary data to. Given such primitive, could a party broadcast authenticated ...
1
vote
0answers
42 views

Exploiting weak hash functions in RSA-PSS

I'm just trying to understand how a Weak/broken hash can break RSA-PSS or any other signature/encryption that uses it. I know you can forge another message that has the same hash but that message ...
1
vote
0answers
51 views

Best practice to hash multiple attributes

I have to generate a signature for concatenation of multiple independent values say A | B | C. Two options are : concatenate all attributes and generate the hash. Then Sign hash. $$ signature = Sign\...
1
vote
0answers
82 views

Are there any hash functions that are commutative yet secure for ordered lists?

I'm looking for a hashing function that can combine random numbers together in any order yet still find the same value. But it needs to be secure against hackers. The idea is if I'm hashing together: ...
1
vote
0answers
43 views

Tuning the signature size of Sphincs+

If I only need a small number of signatures (perhaps $2^{10}$) for the lifetime of my key pair, how would I calculate the consequent signature size? Unfortunately managing state for an LMS or XMSS ...
1
vote
0answers
29 views

How does the KeyGen of Merkle's improvement of Lamport's OTS work?

In his paper [1] on page 17 and 18, Merkle proposes an improvement on Lamport's OTS by only signing the 1's in the message in combination with a checksum of the amount of 0's in the message. I get the ...
0
votes
0answers
18 views

Digital signature from hashing encrypted webpage

I'm studying for the Security+ exam with the help of Total Seminars' Udemy course and in one video they claim that a digital signature is generated by encrypting a message with the sender's private ...
0
votes
1answer
32 views

Is Lamport OTS improved by using HMAC?

One problem with Lamport OTS is that the attacker can repeatedly try random inputs and there is a chance that a hash of a random input will match one of a large set of public keys, reducing the ...