Okamoto identification protocol ⇒ Non-trivial canonical ID

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

If the Okamoto identification protocol is secure against impersonation under active attack, it is a non-trivial canonical identification scheme secure against impersonation under passive attack, with the same advantage. It is canonical: the prover sends , the verifier replies with a uniform , and acceptance is the deterministic check . It is perfectly correct, since — standard. It is non-trivial, since is uniform in the group of prime order already for uniform , so its min-entropy is for a challenge space with negligible — standard. It is secure against impersonation under passive attack with the same advantage, since active security implies passive security — standard.

Sketch

An active attacker simulates the passive attacker’s transcript oracle by running prover sessions one at a time as the honest verifier, with uniform challenges, and then forwards the impersonation phase unchanged.