(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6597 LNCS, Issue , 2011, Pages 541-558

  Xiao, David ^a,b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

black box lower bounds; commitments; concurrent composition; parallel composition; selective opening attacks; zero knowledge

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMITMENTS; CONCURRENT COMPOSITION; LOWER BOUNDS; PARALLEL COMPOSITION; SELECTIVE OPENING ATTACKS; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 79953198928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19571-6_33     Document Type: Conference Paper

References (26)

1. Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd FOCS, pp. 106-115. IEEE, Los Alamitos (2001)
2. Beaver, D.: Adaptive zero knowledge and computational equivocation (extended abstract). In: Proc. STOC 1996, pp. 629-638. ACM, New York (1996)
3. Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 1-35. Springer, Heidelberg (2009)
4. Brassard, G., Crépeau, C.: Zero-knowledge simulation of boolean circuits. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 223-233. Springer, Heidelberg (1987)
5. Brassard, G., Chaum, D., Crépeau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156-189 (1988)
6. Brassard, G., Crépeau, C., Yung, M.: Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 192-195. Springer, Heidelberg (1990)
7. Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAMJ. Comput. 32(1), 1-47 (2003)
8. Di Crescenzo, G., Ostrovsky, R.:On concurrent zero-knowledge with pre-processing (Extended abstract). In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 485-502. Springer, Heidelberg (1999)
9. Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proc. STOC 1998, pp. 141-150. ACM, New York (1998)
10. Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.:Magic functions. J. ACM50(6), 852-921 (2003)
11. Fischlin, M.: Trapdoor Commitment Schemes and Their Applications. Ph.D. Thesis (Doktorarbeit), Department of Mathematics, Goethe-University, Frankfurt, Germany (2001)
12. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology 9(3), 167-189 (1996)
13. Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAMJ. of Com. 25(1), 169-192 (1996);
14. Preliminary version appeared In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443. Springer, Heidelberg (1990)
15. 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(3), 691-729 (1991); Preliminary version in FOCS 1986
16. Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: Proc. FOCS 2007, pp. 669-679 (2007)
17. Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible entropy. In: Proc. STOC 2009, pp. 611-620. ACM, New York (2009)
18. Katz, J.: Which languages have 4-round zero-knowledge proofs? In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 73-88. Springer, Heidelberg (2008)
19. Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4(2), 151-158 (1991);
20. Preliminary version In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 128-136. Springer, Heidelberg (1990)
21. Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403-418. Springer, Heidelberg (2009)
22. Pass, R., Tseng, W.-L.D., Wikström, D.: On the composition of public-coin zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 160-176. Springer, Heidelberg (2009)
23. Prabhakaran, M., Rosen, A., Sahai, A.:Concurrent zero knowledge with logarithmic round-complexity. In: Proc. 43rd FOCS, pp. 366-375. IEEE, Los Alamitos (2002)
24. Rosen, A.: Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich. Information Security and Cryptography. Springer, Heidelberg (2006)
25. Wee, H.: On statistically binding trapdoor commitments from one-way functions (2008) (manuscript)
26. Zhang, Z., Cao, Z., Zhu, H.: Constant-round adaptive zero knowledge proofs for NP (2009) (manuscript)