scientific article; zbMATH DE number 2009970
From MaRDI portal
Publication:4434889
zbMath1038.94556MaRDI QIDQ4434889
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560401.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
securitysignature schemesdiscrete logarithmcomputational Diffie-Hellmanrandom oracle modeltight reductionscomputational Diffie-Hellman assumptionexact security
Related Items (25)
An efficient IBE scheme with tight security reduction in the random oracle model ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ Tightly secure signatures from lossy identification schemes ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Optimal tightness for chain-based unique signatures ⋮ Key regeneration-free ciphertext-policy attribute-based encryption and its application ⋮ Efficient traceable ring signature scheme without pairings ⋮ On tightly-secure (linkable) ring signatures ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Tight security for the generic construction of identity-based signature (in the multi-instance setting) ⋮ A provably secure short signature scheme based on discrete logarithms ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Zero-knowledge argument for simultaneous discrete logarithms ⋮ Provably secure proxy-protected signature schemes based on factoring ⋮ Generic security-amplifying methods of ordinary digital signatures ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ Identity-Based Deterministic Signature Scheme without Forking-Lemma ⋮ Identity-based signatures in standard model ⋮ Proxy signature scheme using self-certified public keys ⋮ Digital Signatures
This page was built for publication:
