On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
type: Item
instance of: scholarly article
title: On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
DOI: 10.1007/978-3-030-75248-4_14
author: Stanislaw Jarecki
author: Hugo Krawczyk
author: Jiayu Xu
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450212
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 14
OpenAlex ID: W3164531381
cites work: HPAKE : Password Authentication Secure against Cross-Site User Impersonation
cites work: Q4279677
cites work: Theory of Cryptography
cites work: Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
cites work: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
cites work: Fast Secure Computation of Set Intersection
cites work: Advances in Cryptology - CRYPTO 2003
cites work: HMQV: A High-Performance Secure Diffie-Hellman Protocol
cites work: Q4250771
cites work: TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF
Recommended article: Extending oblivious transfer with low communication via key-homomorphic PRFs
Recommended article: A fast and simple partially oblivious PRF, with applications
Recommended article: Defeating RSA Multiply-Always and Message Blinding Countermeasures
Recommended article: Simple and more efficient PRFs with tight security from LWE and matrix-DDH
Recommended article: Q4412998
Recommended article: Matrix PRFs: constructions, attacks, and applications to obfuscation
Recommended article: On the bit security of the weak Diffie-Hellman problem
Recommended article: Cryptanalysis of an oblivious PRF from supersingular isogenies
Recommended article: Coordinate Blinding over Large Prime Fields
description: scientific article; zbMATH DE number 7450212