A new notion: Resettable ZK (rZK)
Completeness, soundness as usual.
(P,V) is rZK for language L if:
- Consider the following experiment, w.r.t some V*:
- Fix the input x (and witness w for P).
- Choose and fix the random input r of P.
- V* interacts with as many ìcopiesî of P as it wants, in an arbitrary way. (All copies have the same x,w,r and are unaware of each other.)
- For any V* there is a simulator S s.t. for any x in L and any witness w,
-
Super-View V* P(x). _ S(x).
{Coins, messages in all interactions V* and P(x,w,r)}