Tighter Reductions for Forward-Secure Signature Schemes
From MaRDI portal
Recommendations
- On the tightness of forward-secure signature reductions
- Improving signature schemes with tight security reductions
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- scientific article; zbMATH DE number 1842500
- An efficient forward secure signature scheme
- More efficient (almost) tightly secure structure-preserving signatures
- On tight security proofs for Schnorr signatures
- On tight security proofs for Schnorr signatures
- Improved (almost) tightly-secure structure-preserving signatures
- Tightly secure signature schemes from the LWE and subset sum assumptions
Cites work
- A “Paradoxical” Solution to The Signature Problem
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient cryptographic schemes provably as secure as subset sum
- Generalized Compact Knapsacks Are Collision Resistant
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4172376 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 177053 (Why is no real title available?)
- scientific article; zbMATH DE number 1302855 (Why is no real title available?)
- scientific article; zbMATH DE number 1304086 (Why is no real title available?)
- scientific article; zbMATH DE number 1489843 (Why is no real title available?)
- scientific article; zbMATH DE number 2086721 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- scientific article; zbMATH DE number 1842500 (Why is no real title available?)
- scientific article; zbMATH DE number 1418310 (Why is no real title available?)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Improving the exact security of digital signature schemes
- On Diffie-Hellman Key Agreement with Short Exponents
- On the exact security of Schnorr-type signatures in the random oracle model
- Optimal security proofs for full domain hash, revisited
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Short and Stateless Signatures from the RSA Assumption
- Theory of Cryptography
- Tighter Reductions for Forward-Secure Signature Schemes
- Tightly-secure signatures from lossy identification schemes
- Zero-knowledge proofs of identity
Cited in
(13)- On the tightness of forward-secure signature reductions
- Two-party adaptor signatures from identification schemes
- More efficient digital signatures with tight multi-user security
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Optimal security proofs for signatures from identification schemes
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Iterated random oracle: a universal approach for finding loss in security reduction
- How to prove security of a signature with a tighter security reduction
- Tighter Reductions for Forward-Secure Signature Schemes
- On methods of shortening ElGamal-type signatures
- Lossy identification schemes from decisional RSA
- Half-aggregation of Schnorr signatures with tight reductions
- Anamorphic signatures with dictator and recipient unforgeability for long messages
This page was built for publication: Tighter Reductions for Forward-Secure Signature Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916016)
