More efficient digital signatures with tight multi-user security

DOI10.1007/978-3-030-75248-4_1zbMath1479.94309OpenAlexW3126477196MaRDI QIDQ2061945

Kai Gellert, Tibor Jager, Denis Diemert, Lin Lyu

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_1

zbMATH Keywords

strong existential unforgeabilitytightly-secure AKE protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

Signed Diffie-Hellman key exchange with tight security ⋮ Authenticated key exchange and signatures with tight security in the standard model ⋮ Optimal tightness for chain-based unique signatures ⋮ On the concrete security of TLS 1.3 PSK mode ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ On optimal tightness for key exchange with full forward secrecy via key confirmation ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Signed (group) Diffie-Hellman key exchange with tight security ⋮ Short identity-based signatures with tight security from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tightly secure signatures from lossy identification schemes
• Practical and tightly-secure digital signatures and authenticated key exchange
• On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
• Signatures from sequential-OR proofs
• Tightly-secure authenticated key exchange, revisited
• Highly efficient key exchange protocols with optimal tightness
• On tight security proofs for Schnorr signatures
• Two-pass authenticated key exchange with explicit authentication and tight security
• Optimal Security Proofs for Signatures from Identification Schemes
• 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
• On Tight Security Proofs for Schnorr Signatures
• Random Oracles with(out) Programmability
• Instantiability of RSA-OAEP under Chosen-Plaintext Attack
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• 1-out-of-n Signatures from a Variety of Keys
• Tighter Reductions for Forward-Secure Signature Schemes
• Lossy Identification Schemes from Decisional RSA
• Tightly-Secure Authenticated Key Exchange
• Advances in Cryptology - CRYPTO 2003
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• On the Impossibility of Tight Cryptographic Reductions

This page was built for publication: More efficient digital signatures with tight multi-user security