Generic construction for tightly-secure signatures from discrete log
From MaRDI portal
Publication:820557
DOI10.1016/J.TCS.2021.07.014OpenAlexW3184776544MaRDI QIDQ820557FDOQ820557
Authors: Jianchang Lai, Ge Wu, Peng Jiang, Zhen Zhao, Willy Susilo, Fuchun Guo 
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.014
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
- Security proofs for signature schemes
- Practical Identity-Based Encryption Without Random Oracles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient signature generation by smart cards
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- On the exact security of Schnorr-type signatures in the random oracle model
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Security of signature schemes in a multi-user setting
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Programmable Hash Functions and Their Applications
- A generic construction of tightly secure signatures in the multi-user setting
- Optimal security proofs for signatures from identification schemes
- On the impossibility of tight cryptographic reductions
- Tightly-secure authenticated key exchange
- Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
- Tightly-secure signatures from five-move identification protocols
- Practical and tightly-secure digital signatures and authenticated key exchange
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- 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)
- 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
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)
