DDH ⇒ PAKE in the CRS model (Katz–Ostrovsky–Yung)

CRS model · KOY01

Statement

If DDH is hard, there is a three-round PAKE protocol with public parameters generated by a trusted party that is secure in the model of BPR00 without random oracles: for passwords drawn uniformly from a dictionary and all efficient admissible making queries to , the advantage of is at most plus a negligible function — KOY01.

Notes