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

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

Cites work

scientific article; zbMATH DE number 5009203 (Why is no real title available?)
scientific article; zbMATH DE number 2081084 (Why is no real title available?)
scientific article; zbMATH DE number 1759781 (Why is no real title available?)
scientific article; zbMATH DE number 2086712 (Why is no real title available?)
(Hierarchical) identity-based encryption from affine message authentication
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Fully, (Almost) Tightly Secure IBE and Dual System Groups
Highly efficient key exchange protocols with optimal tightness
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Memory lower bounds of reductions revisited
Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
Memory-tight reductions
More efficient digital signatures with tight multi-user security
Multi-key authenticated encryption with corruptions: reductions are lossy
On the exact security of Schnorr-type signatures in the random oracle model
On the impossibility of tight cryptographic reductions
On the memory-tightness of hashed ElGamal
On the one-per-message unforgeability of (EC)DSA and its variants
On tight security proofs for Schnorr signatures
On tight security proofs for Schnorr signatures
Optimal security proofs for full domain hash, revisited
Optimal security proofs for full domain hash. Revisited
Practical and tightly-secure digital signatures and authenticated key exchange
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
Short signatures from the Weil pairing
Simple and more efficient PRFs with tight security from LWE and matrix-DDH
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
The Multi-user Security of Double Encryption
The exact security of digital signatures -- how to sign with RSA and Rabin
The memory-tightness of authenticated encryption
Tight proofs for signature schemes without random oracles
Tightly CCA-secure encryption without pairings
Tightly Secure Signatures and Public-Key Encryption
Tightly secure signatures from lossy identification schemes
Tightly-secure authenticated key exchange
Tightly-secure signatures from lossy identification schemes
Two-pass authenticated key exchange with explicit authentication and tight security
Waters signatures with optimal security reduction

Cited in

(6)

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

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)