Identity-based signatures in standard model
From MaRDI portal
Recommendations
- Efficient Identity-Based Signatures Secure in the Standard Model
- scientific article; zbMATH DE number 5669795
- Strongly unforgeable ID-based signatures without random oracles
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
Cites work
- scientific article; zbMATH DE number 1951619 (Why is no real title available?)
- scientific article; zbMATH DE number 1952889 (Why is no real title available?)
- scientific article; zbMATH DE number 2009970 (Why is no real title available?)
- scientific article; zbMATH DE number 1504563 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- A novel ID-based designated verifier signature scheme
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient ID-Based Digital Signatures with Message Recovery
- 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
- Financial Cryptography and Data Security
- Identity-based cryptosystems and signature schemes
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Improving the exact security of digital signature schemes
- On the exact security of Schnorr-type signatures in the random oracle model
- On tight security proofs for Schnorr signatures
- Proving Tight Security for Rabin-Williams Signatures
- Public Key Cryptography – PKC 2004
- Public Key Cryptography – PKC 2004
- Security arguments for digital signatures and blind signatures
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Tight proofs for signature schemes without random oracles
- Tight security for signature schemes without random oracles
- Tightly-secure signatures from lossy identification schemes
Cited in
(10)- Advances in Cryptology - EUROCRYPT 2004
- scientific article; zbMATH DE number 5669795 (Why is no real title available?)
- Short identity-based signatures with tight security from lattices
- Efficient Identity-Based Signatures Secure in the Standard Model
- An efficient identity-based signature scheme with provable security
- New Construction of Short Hierarchical ID-Based Signature in the Standard Model
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Toward tight security of the Galindo-Garcia identity-based signature
- Strongly unforgeable ID-based signatures without random oracles
This page was built for publication: Identity-based signatures in standard model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317833)
