Optimal Security Proofs for Signatures from Identification Schemes

DOI10.1007/978-3-662-53008-5_2zbMath1391.94768OpenAlexW2492190064WikidataQ60220895 ScholiaQ60220895MaRDI QIDQ2829210

Jia-xin Pan, Eike Kiltz, Daniel Masny

Publication date: 27 October 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_2

zbMATH Keywords

identificationtightnesssignaturesSchnorr

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (30)

Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ DualRing: generic construction of ring signatures with efficient instantiations ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ Signed Diffie-Hellman key exchange with tight security ⋮ The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ Optimal tightness for chain-based unique signatures ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ On tight security proofs for Schnorr signatures ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Identification scheme and forward-secure signature in identity-based setting from isogenies ⋮ EPG-representations with Small Grid-Size ⋮ Security of BLS and BGLS signatures in a multi-user setting ⋮ Security of hedged Fiat-Shamir signatures under fault attacks ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Two-party adaptor signatures from identification schemes ⋮ More efficient digital signatures with tight multi-user security ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Signed (group) Diffie-Hellman key exchange with tight security ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Black-box separations on Fiat-Shamir-type signatures in the non-programmable random oracle model
• Public key signatures in the multi-user setting.
• Another look at tightness. II: Practical issues in cryptography
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Optimal Security Proofs for Signatures from Identification Schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• Tightly-Secure Signatures from Lossy Identification Schemes
• On Tight Security Proofs for Schnorr Signatures
• Random Oracles with(out) Programmability
• High-Speed High-Security Signatures
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Tighter Reductions for Forward-Secure Signature Schemes
• Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

This page was built for publication: Optimal Security Proofs for Signatures from Identification Schemes