On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
From MaRDI portal
Publication:2061963
DOI10.1007/978-3-030-75248-4_14OpenAlexW3164531381MaRDI QIDQ2061963FDOQ2061963
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
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
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Fast secure computation of set intersection
- Theory of Cryptography
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- HPAKE : Password Authentication Secure against Cross-Site User Impersonation
- 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
Cited In (10)
- 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
- Asymmetric PAKE with low computation \textit{and} communication
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- A fast and simple partially oblivious PRF, with applications
- Oblivious PRF on committed vector inputs and application to deduplication of encrypted data
- Doubly half-injective PRGs for incompressible white-box cryptography
- Oblivious pseudorandom functions from isogenies
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
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)
