A tightly secure ID-based signature scheme under DL assumption in AGM
From MaRDI portal
Publication:6535485
Recommendations
- Toward tight security of the Galindo-Garcia identity-based signature
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- A Tightly Secure Identity-Based Signature Scheme from Isogenies
- Identity-based signatures in standard model
- Galindo-Garcia identity-based signature revisited
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1951619 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- A generic construction of tightly secure signatures in the multi-user setting
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- An efficient identity-based signature scheme with provable security
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Breaking RSA may not be equivalent to factoring
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Identity-Based Signatures Secure in the Standard Model
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Galindo-Garcia identity-based signature revisited
- Identity-based cryptosystems and signature schemes
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- MuSig2: simple two-round Schnorr multi-signatures
- New directions in cryptography
- On pairing-free blind signature schemes in the algebraic group model
- Optimal security proofs for signatures from identification schemes
- Public Key Cryptography – PKC 2004
- Security arguments for digital signatures and blind signatures
- Security proofs for identity-based identification and signature schemes
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- Separation Results on the “One-More” Computational Problems
- Short signatures from the Weil pairing
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- The algebraic group model and its applications
- Two-round trip Schnorr multi-signatures via delinearized witnesses
Cited in
(2)
This page was built for publication: A tightly secure ID-based signature scheme under DL assumption in AGM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535485)
