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

DOI10.1007/978-3-030-75248-4_14MaRDI QIDQ2061963zbMATH OpenOpenAlexFDO

Authors Stanislaw Jarecki, Hugo Krawczyk, 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

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

Recommendations

• Extending oblivious transfer with low communication via key-homomorphic PRFs
• A fast and simple partially oblivious PRF, with applications
• Defeating RSA multiply-always and message blinding countermeasures
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• scientific article; zbMATH DE number 1950360
• Matrix PRFs: constructions, attacks, and applications to obfuscation
• On the bit security of the weak Diffie-Hellman problem
• Cryptanalysis of an oblivious PRF from supersingular isogenies
• Coordinate blinding over large prime fields

Cites work

• scientific article; zbMATH DE number 1304081 (Why is no real title available?)
• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Fast secure computation of set intersection
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• HPAKE : Password Authentication Secure against Cross-Site User Impersonation
• 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
• TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
• Theory of Cryptography

Cited in

(10)

• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Oblivious pseudorandom functions from isogenies
• A fast and simple partially oblivious PRF, with applications
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• PRF-ODH: relations, instantiations, and impossibility results
• Cryptanalysis of an oblivious PRF from supersingular isogenies
• Simple and more efficient PRFs with tight security from LWE and matrix-DDH
• Oblivious PRF on committed vector inputs and application to deduplication of encrypted data
• Doubly half-injective PRGs for incompressible white-box cryptography
• Asymmetric PAKE with low computation \textit{and} communication

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

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