Limitations of the Meta-Reduction Technique: The Case of Schnorr Signatures

Provided by: Saarixx Labs
Topic: Security
Format: PDF
The authors revisit the security of fiat-shamir signatures in the non-programmable random oracle model. The well-known proof by pointcheval and stern for such signature schemes (Journal of Cryptology, 2000) relies on the ability to re-program the random oracle, and it has been unknown if this property is inherent. The researchers (Asiacrypt 2005) gave some first evidence of the hardness by showing via meta-reduction techniques that algebraic reductions cannot succeed in reducing key-only attacks against unforgeability to the discrete-log assumptions.

Find By Topic