Proof of PlainText Knlowlege

2.Verifier DR decodes DR(Yi)=Xi, i=1,…,m.

Sets X={(1,X1),…,(m,Xm)}

3. Verifier (with Prover) randomly chooses

I=(i1,...,in-1) ,

S*

DR

Y=(Y1,…,Ym)

Phase I:

1.

4.

S*

DR

Xi ,…,Xi

s.t. ER(Xi )=Yi , j=1,…,n-1

5. If S* fails then DR aborts

j

j

1

n-1