1. Lecture Notes in Computer Science;M. Bellare,1993
2. Lecture Notes in Computer Science;C. Dwork,1993
3. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(1), 691–729 (1991); Preliminary version in 27th FOCS (1986)
4. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: ACM Symposium on Theory of Computing – STOC 2007, pp. 21–30. ACM Press, New York (2007)
5. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: IEEE Symposium on Foundations of Computer Science – FOCS 2002, pp. 366–375. IEEE Computer Society, Washington, DC (2002)