Security in Communication Networks

DOI10.1007/B105083zbMATH Open1116.94340OpenAlexW2983337624MaRDI QIDQ5491685FDOQ5491685

Authors: Adam L. Young, Moti Yung 

Publication date: 10 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105083

Recommendations

• Diffie-Hellman Oracles
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• The square root Diffie-Hellman problem

zbMATH Keywords

OraclesJDLBlack-Box ReductionsLDLPublic Key CryptographyDecision Diffie-HellmanComputational Diffie-HellmanDiffie-Hellman (DH)Discrete-Log

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• Backdoors in pseudorandom number generators: possibility and impossibility results
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• The \(l\)-th power Diffie-Hellman problem and the \(l\)-th root Diffie-Hellman problem
• Diffie-Hellman Oracles

This page was built for publication: Security in Communication Networks

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