On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding

DOI10.1007/978-3-030-75248-4_14OpenAlexW3164531381MaRDI QIDQ2061963

Hugo Krawczyk, Stanislaw Jarecki, Jiayu Xu

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_14

Mathematics Subject Classification ID

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

Related Items (3)

Asymmetric PAKE with low computation \textit{and} communication ⋮ A fast and simple partially oblivious PRF, with applications ⋮ On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding

Cites Work

• Unnamed Item
• Unnamed Item
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Fast Secure Computation of Set Intersection
• HPAKE : Password Authentication Secure against Cross-Site User Impersonation
• Advances in Cryptology - CRYPTO 2003
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• Theory of Cryptography

This page was built for publication: On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding