J. Katz. Efficient and non-malleable proofs of plaintext knowledge and applications. Cryptology ePrint Archive (http://eprint.iacr.org/), 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....A ZK protocol that does not suffer from this problem is said to achieve one time non malleability (since the adversary only interacts with one prover) Dolev, Dwork and Naor give a construction of a one time non malleable ZK protocol that uses a polylogarithmic number of communication rounds. Katz [37] describes efficient protocols for one time non malleable proofs of plaintext knowledge for several encryption schemes. His protocols work in the common reference string model, and consist of three rounds and constant number of exponentiations. However, since the witness extractor uses ....

....both Omega Gammah 458 cols and NMZK protocols still receives the full witness w. Also note that if f is the identity function, we have the normal definitions of an Omega Gamma 2155 col and an NMZK protocol. One application of these generalized definitions is in proving plaintext knowledge. See [37] for some applications of proof of plaintext knowledge. Consider a semantically secure encryption scheme. This scheme naturally induces a relation R = f(e; x; r) g, where e is the encryption of plaintext x using random bits r. Then consider a function f defined as x f(x; r) It is easy to see ....

J. Katz. Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. In ePrint Archive, Report 2002.

No context found.

J. Katz. Efficient and non-malleable proofs of plaintext knowledge and applications. Cryptology ePrint Archive (http://eprint.iacr.org/), 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC