Digital Signatures with Memory-Tight Security in the Multi-challenge Setting

DOI10.1007/978-3-030-92068-5_14zbMATH Open1514.94151OpenAlexW3202828554MaRDI QIDQ6041292FDOQ6041292

Tibor Jager, Denis Diemert, Kai Gellert, Lin Lyu

Publication date: 26 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_14

Recommendations

• Memory lower bounds of reductions revisited
• Hiding in plain sight: memory-tight proofs via randomness programming
• How to prove security of a signature with a tighter security reduction
• Signatures with Tight Multi-user Security from Search Assumptions
• More efficient digital signatures with tight multi-user security

zbMATH Keywords

lower boundmemoryuniquenesstightnessblack-box reduction

Mathematics Subject Classification ID

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

Cites Work

• Short signatures from the Weil pairing
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• Tightly Secure Signatures and Public-Key Encryption
• Tight Proofs for Signature Schemes without Random Oracles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Title not available (Why is that?)
• Tightly-Secure Signatures from Lossy Identification Schemes
• Tightly secure signatures from lossy identification schemes
• Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
• On the Impossibility of Tight Cryptographic Reductions
• More efficient digital signatures with tight multi-user security
• Tightly CCA-Secure Encryption Without Pairings
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Tightly-Secure Authenticated Key Exchange
• Practical and tightly-secure digital signatures and authenticated key exchange
• Highly efficient key exchange protocols with optimal tightness
• On tight security proofs for Schnorr signatures
• Waters Signatures with Optimal Security Reduction
• On Tight Security Proofs for Schnorr Signatures
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• The Multi-user Security of Double Encryption
• On the memory-tightness of hashed ElGamal
• Memory lower bounds of reductions revisited
• Memory-tight reductions
• The memory-tightness of authenticated encryption
• Optimal Security Proofs for Full Domain Hash, Revisited
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Multi-key authenticated encryption with corruptions: reductions are lossy
• On the one-per-message unforgeability of (EC)DSA and its variants
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Optimal security proofs for full domain hash. Revisited
• Two-pass authenticated key exchange with explicit authentication and tight security

Cited In (5)

• Memory-tight multi-challenge security of public-key encryption
• Signatures with Tight Multi-user Security from Search Assumptions
• Hiding in plain sight: memory-tight proofs via randomness programming
• Optimal tightness for chain-based unique signatures
• Signatures with memory-tight security in the quantum random oracle model

This page was built for publication: Digital Signatures with Memory-Tight Security in the Multi-challenge Setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041292)