Background
First, while studying MinEntropy a bit, I came across an NIST paper, "DRAFT SP 800-90B (second draft)," which suggests "twice" the entropy of the underlying block of a cryptographic hash function be used as input in order to have an output hash having fully saturated entropy capacity....
A tag-merge would not have been what Squeamish was looking for though, since the "hash-signature" tag should be preserved for those questions correctly tagged for dealing with hash-based signature schemes.
@SEJPM Those 53 questions are rightly tagged hash-signature. That was the point—there was a large number of questions not about hash-based signatures for which the tag was inappropriate, but the tag is still useful because there are nevertheless a good number of questions about hash-based signatures.
I've reached 1K from first-posts. Should I continue to look at the queue or leave the points to someone else? I'll still consider editing and looking for dupes and related questions, of course.
I'm looking for a very detailed example of proof by reduction. Say we have two or three protocols (that have been proven secure) and we construct a new protocol. We want to provide a proof of security for this new protocol.
For instance, we can consider the following simple example: we have a (s...
