Tighter Reductions for Forward-Secure Signature Schemes

DOI10.1007/978-3-642-36362-7_19zbMath1314.94098OpenAlexW1902397884WikidataQ56921011 ScholiaQ56921011MaRDI QIDQ4916016

Michel Abdalla, David Pointcheval, Fabrice Benhamouda

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_19

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ On the tightness of forward-secure signature reductions ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Two-party adaptor signatures from identification schemes ⋮ More efficient digital signatures with tight multi-user security ⋮ Optimal Security Proofs for Signatures from Identification Schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of identity
• Improving the exact security of digital signature schemes
• Efficient cryptographic schemes provably as secure as subset sum
• On Diffie-Hellman Key Agreement with Short Exponents
• Optimal Security Proofs for Full Domain Hash, Revisited
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• Tightly-Secure Signatures from Lossy Identification Schemes
• A “Paradoxical” Solution to The Signature Problem
• Short and Stateless Signatures from the RSA Assumption
• Generalized Compact Knapsacks Are Collision Resistant
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Tighter Reductions for Forward-Secure Signature Schemes
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Theory of Cryptography

This page was built for publication: Tighter Reductions for Forward-Secure Signature Schemes