Def: Resettably Secure ID schemes

Let I impersonating adversary be an PPT algorithm,

Concurrent-Reset-2(CR2): I, while trying to impersonate

Alice to verifier V, runs concurrent and interleaved ID

sessions re-setting Alice to same random tape.

ID-Scheme is CR2 secure if for all I,

prob( I succeeds with new session id) < neg.

Rule out Adversary running a woman-in-middle

attack by adding session-idís and defining success for I only

if he impersonates establishing a different

session-ID then past session IDís.

Diapositive prÈcÈdente Diapositive suivante Revenir ý la premiËre diapositive Afficher la version graphique