Black-box constructions of two-party protocols from one-way functions

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

Volumn 5444 LNCS, Issue , 2009, Pages 403-418

  Pass, Rafael ^a   Wee, Hoeteck ^b  

^a Department of Obstetrics Gynecology   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Black box constructions; Non malleable commitments; Parallel coin tossing; Secure two party computation; Trapdoor commitments; Zero knowledge arguments

Indexed keywords

BLACK-BOX CONSTRUCTIONS; NON-MALLEABLE COMMITMENTS; PARALLEL COIN-TOSSING; SECURE TWO-PARTY COMPUTATION; TRAPDOOR COMMITMENTS; ZERO-KNOWLEDGE ARGUMENTS;

HASH FUNCTIONS; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 70350623264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_24     Document Type: Conference Paper

References (43)

1. Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106-115 (2001)
2. Beaver, D.: Adaptive zero knowledge and computational equivocation. In: STOC, pp. 629-638 (1996)
3. Blum, M.: Coin flipping by telephone. In: CRYPTO, pp.11-15 (1981)
4. Blum, M.: How to prove a theorem so no one else can claim it. In: Proc. ICM (1986)
5. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13(1), 143-202 (2000)
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
7. Canetti, R., Fischlin,M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001)
8. Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265-281. Springer, Heidelberg (2003)
9. Choi, S.G., Dachman-Soled, D., Malkin, T.G.,Wee, H.M.: Black-box construction of a nonmalleable encryption scheme from any semantically secure one. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 427-444. Springer, Heidelberg (2008)
10. Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Simple, black-box constructions of adaptively secure protocols. In: TCC (to appear, 2009)
11. Cramer, R., Damgård, I.B., Schoenmakers, B.: Proof of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
12. Damgård, I.B., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378-394. Springer, Heidelberg (2005)
13. 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)
14. Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391-437 (2000)
15. Even, S., Goldreich, O., and Lempel, A. A randomized protocol for signing contracts. In: CRYPTO 1982, pp. 205-210 (1982)
16. Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526-544. Springer, Heidelberg (1990)
17. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
18. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. II. Cambridge University Press, Cambridge (2004)
19. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology 9(3), 167-190 (1996)
20. Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169-192 (1996)
21. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229 (1987)
22. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691-729 (1991); Prelim. version in FOCS 1986
23. Goyal, V., Moriarty, R., Ostrovsky, R., Sahai, A.: Concurrent statistical zero-knowledge arguments for NP from one way functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 444-459. Springer, Heidelberg (2007)
24. Haitner, I.: Semi-honest to malicious oblivious transfer-the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 412-426. Springer, Heidelberg (2008)
25. Haitner, I., Hoch, J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: FOCS, pp. 669-679 (2007)
26. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364-1396 (1999)
27. Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44-61 (1989)
28. Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: STOC, pp. 99-108 (2006)
29. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
30. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20-31 (1988)
31. Kilian, J.: On the complexity of bounded-interaction and noninteractive zero-knowledge proofs. In: FOCS, pp. 466-477 (1994)
32. Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 571-588. Springer, Heidelberg (2008)
33. Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology 16(3), 143-184 (2003)
34. Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52-78. Springer, Heidelberg (2007)
35. Naor, M.: Bit commitment using pseudorandomness. J. Cryptology 4(2), 151-158 (1991)
36. Pass, R., Tseng,W., Venkitasubramaniam, M.: Unconditional characterizations of concurrent zero knowledge (manuscript, 2008)
37. Peikert, C.,Waters, B.: Lossy trapdoor functions and their applications. In: STOC (to appear, 2008); Cryptology ePrint Archive, Report 2007/279
38. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic roundcomplexity. In: FOCS, pp. 366-375 (2002)
39. Reingold, O., Trevisan, L., Vadhan, S.P.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1-20. Springer, Heidelberg (2004)
40. Rosen, A.: A note on constant-round zero-knowledge proofs for NP. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 191-202. Springer, Heidelberg (2004)
41. Rosen, A.: The Round-Complexity of Black-Box Concurrent Zero-Knowledge. Ph.D., Weizmann Institute of Science (May 2004)
42. Simon, D.R.: Findings collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334-345. Springer, Heidelberg (1998)
43. Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986)