Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
From MaRDI portal
Publication:1879419
zbMath1101.14309MaRDI QIDQ1879419
Publication date: 22 September 2004
Published in: Journal of Cryptology (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
HIBE: Hierarchical Identity-Based Encryption ⋮ Predicate encryption supporting disjunctions, polynomial equations, and inner products ⋮ Fast generators for the Diffie-Hellman key agreement protocol and malicious standards ⋮ Unconditionally anonymous ring and mesh signatures ⋮ Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem ⋮ Fully leakage-resilient signatures ⋮ Simulatability and security of certificateless threshold signatures ⋮ New results and applications for multi-secret sharing schemes ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Unnamed Item ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Private key agreement and secure communication for heterogeneous sensor networks ⋮ A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols ⋮ Pairing the volcano ⋮ Efficient certificateless threshold signatures without random oracles ⋮ On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ On the bit security of the Diffie-Hellman key ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem ⋮ Fail-stop blind signature scheme design based on pairings ⋮ Still wrong use of pairings in cryptography
Uses Software
