DDH ⇒ PAKE in the CRS model (Katz–Ostrovsky–Yung)
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
- GL03 generalize the protocol to a framework built from non-malleable commitments, one-time signatures and smooth projective hash functions in the common reference string model, and instantiate it under DDH, quadratic residuosity and -th residuosity.
- Without any setup, trapdoor permutations give session-key generation from passwords alone, under a guarantee in which the effect of an adversary attacking an execution is comparable to a constant number of queries of the form “is the password?” — GL01.