[1]

B. Barak, M. Prabhakaran, A. Sahai, Concurrent non-malleable zero knowledge, in *FOCS’06* (2006), pp. 345–354

[2]

M. Bellare, O. Goldreich, On defining proofs of knowledge, in *CRYPTO ’92* (1992), pp. 390–420

[3]

M. Blum, How to prove a theorem so no one else can claim it, in *Proc. of the International Congress of Mathematicians* (1986), pp. 1444–1451

[4]

R. Canetti, O. Goldreich, S. Goldwasser, S. Micali, Resettable zero-knowledge (extended abstract), in

*STOC ’00* (2000), pp. 235–244

CrossRef[5]

R. Canetti, J. Kilian, E. Petrank, A. Rosen, Black-box concurrent zero-knowledge requires

\(\tilde{\omega}(\log n)\) rounds, in

*STOC ’01* (2001), pp. 570–579

CrossRef[6]

R. Cramer, I. Damgård, B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in *CRYPTO ’94* (1994), pp. 174–187

[7]

I. Damgård, Efficient concurrent zero-knowledge in the auxiliary string model, in *EUROCRYPT ’00* (2000), pp. 418–430

[8]

D. Dolev, C. Dwork, M. Naor, Nonmalleable cryptography.

*SIAM J. Comput.*
**30**(2), 391–437 (2000)

CrossRefMATHMathSciNet[9]

C. Dwork, A. Sahai, Concurrent zero-knowledge: Reducing the need for timing constraints, in *CRYPTO ’98* (1998), pp. 177–190

[10]

C. Dwork, M. Naor, A. Sahai, Concurrent zero-knowledge.

*J. ACM*
**51**(6), 851–898 (2004)

CrossRefMATHMathSciNet[11]

U. Feige, A. Shamir, Witness indistinguishable and witness hiding protocols, in

*STOC ’90* (1990), pp. 416–426

CrossRef[12]

O. Goldreich,

*Foundations of Cryptography—Basic Tools* (Cambridge University Press, Cambridge, 2001)

CrossRefMATH[13]

O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP.

*J. Cryptol.*
**9**(3), 167–190 (1996)

CrossRefMATHMathSciNet[14]

O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems.

*J. ACM*
**38**(3), 691–729 (1991)

CrossRefMATHMathSciNet[15]

S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems.

*SIAM J. Comput.*
**18**(1), 186–208 (1989)

CrossRefMATHMathSciNet[16]

V. Goyal, R. Moriarty, R. Ostrovsky, A. Sahai, Concurrent statistical zero-knowledge arguments for NP from one way functions, in *ASIACRYPT ’07* (2007), pp. 444–459

[17]

I. Haitner, M.-H. Nguyen, S.J. Ong, O. Reingold, S.P. Vadhan, Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function.

*SIAM J. Comput.*
**39**(3), 1153–1218 (2009)

CrossRefMATHMathSciNet[18]

J. Håstad, R. Impagliazzo, L. Levin, M. Luby, A pseudorandom generator from any one-way function.

*SIAM J. Comput.*
**28**, 12–24 (1999)

CrossRef[19]

J. Kilian, E. Petrank, Concurrent and resettable zero-knowledge in poly-logarithm rounds, in

*STOC ’01* (2001), pp. 560–569

CrossRef[20]

J. Kilian, E. Petrank, C. Rackoff, Lower bounds for zero knowledge on the internet, in *FOCS ’98* (1998), pp. 484–492

[21]

H. Lin, R. Pass, W.-L. Dustin Tseng, M. Venkitasubramaniam, Concurrent non-malleable zero knowledge proofs, in *CRYPTO* (2010), pp. 429–446

[22]

S. Micali, R. Pass, Local zero knowledge, in

*STOC ’06* (2006), pp. 306–315

CrossRef[23]

M. Naor, Bit commitment using pseudorandomness.

*J. Cryptol.*
**4**(2), 151–158 (1991)

CrossRefMATH[24]

O. Pandey, R. Pass, A. Sahai, W.-L. Dustin Tseng, M. Venkitasubramaniam, Precise concurrent zero knowledge, in *EUROCRYPT ’08* (2008), pp. 397–414

[25]

R. Pass, M. Venkitasubramaniam, On constant-round concurrent zero-knowledge, in *TCC ’08* (2008), pp. 553–570

[26]

M. Prabhakaran, A. Sahai, Concurrent zero knowledge proofs with logarithmic round complexity, Cryptology ePrint Archive, Report 2002/055 (2002).

http://eprint.iacr.org/2002/055
[27]

M. Prabhakaran, A. Rosen, A. Sahai, Concurrent zero knowledge with logarithmic round-complexity, in *FOCS ’02* (2002), pp. 366–375

[28]

R. Richardson, J. Kilian, On the concurrent composition of zero-knowledge proofs, in *Eurocrypt ’99* (1999), pp. 415–432

[29]

A. Rosen, A note on the round-complexity of concurrent zero-knowledge, in *CRYPTO ’00* (2000), pp. 451–468

[30]

A. Rosen, The round-complexity of black-box concurrent zero-knowledge, Ph.D. thesis, Weizmann Institute of Science, 2003