On the Security of Short Schnorr Signatures
Primary Investigator:
Jeremiah Blocki
Jeremiah M. Blocki, Seunghoon Lee
Abstract
The Schnorr signature scheme enjoys its effectiveness from a short signature length; it achieves k-bits of security with 4k-bit signatures. The folklore is that 3k-bit signatures suffice to achieve k-bits of security with shorter hash function (k-bits), but no security proof has provided so far. We provide a concrete security proof in Generic Group Model and Random Oracle Model which shows 3k-bit signatures with k-bits of security.