scientific article; zbMATH DE number 2009970
From MaRDI portal
Publication:4434889
Recommendations
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- A constant-size signature scheme with tighter reduction from CDH assumption
- A provably secure short signature scheme based on discrete logarithms
- scientific article; zbMATH DE number 1962145
Cited in
(52)- Zero-knowledge argument for simultaneous discrete logarithms
- Provably secure proxy-protected signature schemes based on factoring
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Optimal tightness for chain-based unique signatures
- Efficient traceable ring signature scheme without pairings
- A signature scheme from the finite field isomorphism problem
- Tight security for the generic construction of identity-based signature (in the multi-instance setting)
- Identity-based signatures in standard model
- A provably secure short signature scheme based on discrete logarithms
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Proxy signature scheme using self-certified public keys
- An efficient IBE scheme with tight security reduction in the random oracle model
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- On tightly-secure (linkable) ring signatures
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- Towards tightly secure lattice short signature and id-based encryption
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Signcryption schemes based on the Diffie-Hellman problem
- A signature scheme with efficient proof of validity
- Identity-based deterministic signature scheme without forking-lemma
- Tightly secure signatures from lossy identification schemes
- scientific article; zbMATH DE number 2134166 (Why is no real title available?)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- scientific article; zbMATH DE number 1031000 (Why is no real title available?)
- scientific article; zbMATH DE number 1962145 (Why is no real title available?)
- scientific article; zbMATH DE number 1504563 (Why is no real title available?)
- Practical signatures from standard assumptions
- scientific article; zbMATH DE number 1440056 (Why is no real title available?)
- scientific article; zbMATH DE number 1440063 (Why is no real title available?)
- A constant-size signature scheme with tighter reduction from CDH assumption
- Digital signatures
- Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Advances in Cryptology - CRYPTO 2003
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- scientific article; zbMATH DE number 2222194 (Why is no real title available?)
- scientific article; zbMATH DE number 2243635 (Why is no real title available?)
- Boneh et al.'s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption
- Learning strikes again: the case of the DRS signature scheme
- Universally composable -protocols in the global random-oracle model
- A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation
- Pairing-free blind signatures from CDH assumptions
- Oblivious issuance of proofs
- Generic security-amplifying methods of ordinary digital signatures
- Anamorphic signatures with dictator and recipient unforgeability for long messages
- Short signatures from DDH without pairings or random oracles
- Generic construction for tightly-secure signatures from discrete log
- Signed Diffie-Hellman key exchange with tight security
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434889)
