scientific article; zbMATH DE number 1341882

MaRDI QIDQ4263442zbMATH OpenFDO

Authors Helena Handschuh, Yiannis Tsiounis, Moti Yung

Publication date 1 February 2000

zbMATH Keywords

complexitypublic-key encryptionoraclecryptosystemsuniform reductionsdecision Diffie-Hellmanrandomized reductionsrandom self-reducibilityDiffie-Hellman variantshomomorphic encryption functionsmatching Diffie-Hellmanuniversal malleability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Security in Communication Networks
• Diffie-Hellman Oracles
• The Twin Diffie-Hellman Problem and Applications
• The twin Diffie-Hellman problem and applications
• scientific article; zbMATH DE number 1775406

Cited in

(1)

• On the complexity of the discrete logarithm and Diffie-Hellman problems

This page was built for publication:

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