Diffie-Hellman Oracles

DOI10.1007/3-540-68697-5_21MaRDI QIDQ3452357zbMATH OpenOpenAlexFDO

Authors Ueli M. Maurer, S. Wolf

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

Diffie-Hellman protocoldiscrete logarithmselliptic curvespublic-key cryptography

Mathematics Subject Classification ID

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

Recommendations

• The oracle Diffie-Hellman assumptions and an analysis of DHIES
• On the security of Diffie-Hellman bits
• A Diffie-Hellman Key Exchange Protocol Without Random Oracles
• Security in Communication Networks
• The Diffie-Hellman protocol
• On the bit security of the Diffie-Hellman key
• The Diffie-Hellman problem and generalization of Verheul's theorem
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms

Cites work

• Algorithms for black-box fields and their application to cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Elliptic Curve Cryptosystems
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factoring integers with elliptic curves
• Factoring with Cyclotomic Polynomials
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 799785 (Why is no real title available?)
• New directions in cryptography
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Primality testing and Abelian varieties over finite fields
• Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms

Cited in

(33)

• The twin Diffie-Hellman problem and applications
• A secure and scalable group key exchange system
• Batch Diffie-Hellman key agreement systems
• Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• Automated analysis of cryptographic assumptions in generic group models
• The oracle Diffie-Hellman assumptions and an analysis of DHIES
• Format Oracles on OpenPGP
• An observation on associative one-way functions in complexity theory
• On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
• A cryptographic primitive based on hidden-order groups
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• Decision-oracles are equivalent to matching oracles
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• The group Diffie-Hellman problems
• A tool box of cryptographic functions realted to the Diffie-Hellman function
• Vector commitments and their applications
• Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms
• An efficient ring signature scheme from pairings
• Advances in Cryptology - EUROCRYPT 2004
• Security in Communication Networks
• 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
• Full quantum equivalence of group action DLog and CDH, and more
• Cryptanalysis and improvement of ``group public key encryption scheme supporting equality test without bilinear pairings
• The square root Diffie-Hellman problem
• Full quantum equivalence of group action DLog and CDH, and more
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• Revisiting discrete logarithm reductions
• Fast generators for the Diffie-Hellman key agreement protocol and malicious standards

This page was built for publication: Diffie-Hellman Oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452357)