Introduction to NIZK (part I) Paper by Feige Lapidot and Shamir.
"Multiple Non-Interactive Zero Knowledge Proofs Under General Assumptions".
Read chapter 6 of Uriel Feige PhD thesis that explains it.
It can be found on Feige home page As a preliminary material, you can also look at
the original paper of
Blum, DeSantis, Micali and Persiano .
Introduction to non-malleability. Read Dolev, Dwork and Naor
paper "Non-Malleable Cryptography"
(read only definitions section and public-key encryption sections of "DDN".)
Introduction to Cramer-Shoup "light" (i.e. CCA-1).
Start reading
Ronald Cramer and Victor Shoup "A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack" . You can get it from
Shoup's page. Make sure you
read section 2.2 and understand random self-reduciblity properties. That is,
understand claim and proof of lemma 3.2 in reference [17] (you already should know how to get [17] paper on-line.)
See "Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security" by Amit Sahai and
"Robust Non-Interactive Zero Knowledge" from my web-cite. (I'll present a simpler proof, using ideas from
Eurocrypt 03 paper
by Garay, MacKenzie and and Yang.)
UCLA