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

DOI10.1007/978-3-642-38348-9_27zbMath1306.94103OpenAlexW2149096890MaRDI QIDQ4924426

Nils Fleischhacker, Marc Fischlin

Publication date: 31 May 2013

Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_27

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ Optimal tightness for chain-based unique signatures ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ On tight security proofs for Schnorr signatures ⋮ The power of undirected rewindings for adaptive security ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Signatures from sequential-OR proofs ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures