Diffie-Hellman Oracles

DOI10.1007/3-540-68697-5_21zbMath1329.94072OpenAlexW2096832922MaRDI QIDQ3452357

Stefan Wolf, Ueli M. Maurer

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_21

zbMATH Keywords

elliptic curvespublic-key cryptographyDiffie-Hellman protocoldiscrete logarithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (17)

An observation on associative one-way functions in complexity theory ⋮ Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ On the security of functional encryption in the generic group model ⋮ A more complete analysis of the signal double ratchet algorithm ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ The square root Diffie-Hellman problem ⋮ On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem ⋮ The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem ⋮ Vector Commitments and Their Applications ⋮ An efficient ring signature scheme from pairings ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ The twin Diffie-Hellman problem and applications ⋮ A secure and scalable group key exchange system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Primality testing and Abelian varieties over finite fields
• Algorithms for Black-Box Fields and their Application to Cryptography
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• Factoring with Cyclotomic Polynomials
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

This page was built for publication: Diffie-Hellman Oracles