Optimal security proofs for signatures from identification schemes
From MaRDI portal
(Redirected from Publication:2829210)
Recommendations
- scientific article; zbMATH DE number 1302859
- scientific article; zbMATH DE number 2086722
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Public key signatures in the multi-user setting.
Cites work
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 177023 (Why is no real title available?)
- scientific article; zbMATH DE number 177053 (Why is no real title available?)
- scientific article; zbMATH DE number 1302859 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1942419 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Another look at tightness. II: Practical issues in cryptography
- Black-box separations on Fiat-Shamir-type signatures in the non-programmable random oracle model
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient signature generation by smart cards
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- High-speed high-security signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- On the exact security of Schnorr-type signatures in the random oracle model
- On tight security proofs for Schnorr signatures
- Optimal security proofs for signatures from identification schemes
- Public key signatures in the multi-user setting.
- Random oracles with(out) programmability
- Security arguments for digital signatures and blind signatures
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Tighter Reductions for Forward-Secure Signature Schemes
- Tightly-secure signatures from lossy identification schemes
Cited in
(53)- Generic construction for tightly-secure signatures from discrete log
- Signed Diffie-Hellman key exchange with tight security
- scientific article; zbMATH DE number 4195163 (Why is no real title available?)
- From one-time to two-round reusable multi-signatures without nested forking
- Identification protocols and signature schemes based on supersingular isogeny problems
- Identification scheme and forward-secure signature in identity-based setting from isogenies
- A guide to the design of digital signatures based on cryptographic group actions
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- SoK: signatures with randomizable keys
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
- Rogue-instance security for batch knowledge proofs
- EPG-representations with Small Grid-Size
- Tightly-secure signatures from five-move identification protocols
- Optimal security proofs for signatures from identification schemes
- Security of hedged Fiat-Shamir signatures under fault attacks
- Limits in the provable security of ECDSA signatures
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
- Simple Schnorr multi-signatures with applications to bitcoin
- On tight security proofs for Schnorr signatures
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
- Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- More efficient digital signatures with tight multi-user security
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- DualRing: generic construction of ring signatures with efficient instantiations
- Public key signatures in the multi-user setting.
- Attribute-based anonymous credential: optimization for single-use and multi-use
- Lattice-based signatures with tight adaptive corruptions and more
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- On the multi-user security of short Schnorr signatures with preprocessing
- Optimal tightness for chain-based unique signatures
- Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Parameter-hiding order-revealing encryption without pairings
- Toothpicks: more efficient fork-free two-round multi-signatures
- Twinkle: threshold signatures from DDH with full adaptive security
- Extended security arguments for signature schemes
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Two-party adaptor signatures from identification schemes
- Extended security arguments for signature schemes
- Signed (group) Diffie-Hellman key exchange with tight security
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Generic construction of threshold ring signatures and lattice-based instantiations
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Toward tight security of the Galindo-Garcia identity-based signature
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Security of BLS and BGLS signatures in a multi-user setting
This page was built for publication: Optimal security proofs for signatures from identification schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829210)
