Generic construction for tightly-secure signatures from discrete log
From MaRDI portal
(Redirected from Publication:820557)
Recommendations
- A generic construction of tightly secure signatures in the multi-user setting
- Signatures with Tight Multi-user Security from Search Assumptions
- More efficient digital signatures with tight multi-user security
- Tightly-secure signatures from the decisional composite residuosity assumption
- Tightly-Secure Signatures from Chameleon Hash Functions
Cites work
- scientific article; zbMATH DE number 2009970 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A generic construction of tightly secure signatures in the multi-user setting
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient signature generation by smart cards
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- On the exact security of Schnorr-type signatures in the random oracle model
- On the impossibility of tight cryptographic reductions
- On tight security proofs for Schnorr signatures
- Optimal security proofs for signatures from identification schemes
- Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
- Practical Identity-Based Encryption Without Random Oracles
- Practical and tightly-secure digital signatures and authenticated key exchange
- Programmable Hash Functions and Their Applications
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Security of signature schemes in a multi-user setting
- Security proofs for signature schemes
- Short tightly secure signatures for signing a vector of group elements: a new approach
- Short unique signatures from RSA with a tight security reduction (in the random oracle model)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Tightly-secure authenticated key exchange
- Tightly-secure signatures from five-move identification protocols
- Waters signatures with optimal security reduction
Cited in
(5)- Practical and robust secure logging from fault-tolerant sequential aggregate signatures
- A generic construction of tightly secure signatures in the multi-user setting
- Construction of strongly aperiodic logarithmic signatures
- Generalized public-key cryptography with tight security
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
This page was built for publication: Generic construction for tightly-secure signatures from discrete log
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820557)
