On the tightness of forward-secure signature reductions
From MaRDI portal
Publication:1715854
DOI10.1007/s00145-018-9283-2zbMath1435.94119OpenAlexW2951074086WikidataQ56920926 ScholiaQ56920926MaRDI QIDQ1715854
Fabrice Benhamouda, Michel Abdalla, David Pointcheval
Publication date: 29 January 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9283-2
Related Items (2)
Lattice-based signatures with tight adaptive corruptions and more ⋮ New methods and abstractions for RSA-based forward secure signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tightly secure signatures from lossy identification schemes
- Security of signature schemes in a multi-user setting
- Zero-knowledge proofs of identity
- Security arguments for digital signatures and blind signatures
- Improving the exact security of digital signature schemes
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Fine-grained forward-secure signature schemes without random oracles
- Strengthening zero-knowledge protocols using signatures
- Efficient cryptographic schemes provably as secure as subset sum
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- 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
- Tightly Secure Signatures and Public-Key Encryption
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- A “Paradoxical” Solution to The Signature Problem
- Short and Stateless Signatures from the RSA Assumption
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Generalized Compact Knapsacks Are Collision Resistant
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
- Signature Schemes with Bounded Leakage Resilience
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Tighter Reductions for Forward-Secure Signature Schemes
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size
- Efficient Cryptosystems from 2 k -th Power Residue Symbols
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Advances in Cryptology – CRYPTO 2004
- Unrestricted Aggregate Signatures
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Impossibility of Tight Cryptographic Reductions
- Theory of Cryptography
This page was built for publication: On the tightness of forward-secure signature reductions
