Round-optimal secure two-party computation

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

Volumn 3152, Issue , 2004, Pages 335-354

  Katz, Jonathan ^a   Ostrovsky, Rafail ^b  

^a University of Maryland ^*  (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DDH ASSUMPTIONS; HOMOMORPHIC ENCRYPTION SCHEMES; MALICIOUS ADVERSARIES; MALICIOUS BEHAVIOR; ROUND COMPLEXITY; RSA ASSUMPTION; SECURE TWO-PARTY COMPUTATIONS; TRAPDOOR PERMUTATIONS;

MOBILE SECURITY;

EID: 35048822047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_21     Document Type: Article

References (43)

1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 106-115, 2001.
2. B. Barak. Constant-Round Coin-Tossing with a Man-in-the-Middle or Realizing the Shared Random String Model. 43rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 345-355, 2002.
3. B. Barak, and Y. Lindell. Strict Polynomial Time in Simulation and Extraction. 34th ACM Symposium on Theory of Computing (STOC), ACM, pp. 484-493, 2002.
4. J. Bar-Ilan and D. Beaver. Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. Principles of Distributed Computing, ACM, pp. 201-209, 1989.
5. D. Beaver, S. Micali, and P. Rogaway. The Round Complexity of Secure Protocols. 22nd ACM Symposium on Theory of Computing (STOC), ACM, pp. 503-513, 1990.
6. M. Bellare, S. Micali, R. Ostrovsky. Perfect Zero-Knowledge in Constant Rounds STOC 1990: 482-493.
7. M. Bellare, S. Micali, R. Ostrovsky. The (True) Complexity of Statistical Zero Knowledge STOC 1990: 494-502
8. M. Blum. Coin Flipping by Phone. IEEE COMPCOM, pp. 133-137, 1982.
9. R. Canetti. Security and Composition of Multi-Party Cryptographic Protocols. J. Cryptology 13(1): 143-202, 2000.
10. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai. Universally composable two-party and multi-party secure computation. STOC 2002: 494-503
11. R. Canetti, E. Kushilevitz, R. Ostrovsky, A. Rosen: Randomness versus Fault-Tolerance. J. Cryptology 13(1): 107-142 (2000)
12. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively-Secure Multiparty Computation. 28th ACM Symposium on Theory of Computing (STOC), ACM, pp. 639-648, 1996.
13. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Concurrent Zero-Knowledge Requires Ω̃ (logn) Rounds. 33rd ACM Symp. on Theory of Comp. (STOC), ACM, pp. 570-579, 2001.
14. R. Cramer and I. Damgård. Secure Distributed Linear Algebra in a Constant Number of Rounds. Adv. in Cryptology - Crypto '01, LNCS 2139, Springer-Verlag, pp. 119-136, 2001.
15. G. Di Crescenzo and R. Ostrovsky. On Concurrent Zero-Knowledge with Preprocessing. In CRYPTO 1999: pp. 485-502.
16. I. Damgård and J.B. Nielsen. Improved Non-Committing Encryption Schemes. Adv. in Cryptology - Crypto 2000, LNCS vol. 1880, Springer-Verlag, pp. 432-450, 2000.
17. A. De Santis, G. DiCrescenzo, R. Ostrovsky, G. Persiano, A. Sahai: Robust Non-interactive Zero Knowledge. CRYPTO 2001: 566-598
18. U. Feige. Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, Weizmann Institute of Science, 1990.
19. U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. Adv. in Cryptology - Crypto 1989, LNCS vol. 435, Springer-Verlag, pp. 526-544, 1989.
20. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. 22nd ACM Symposium on Theory of Computing (STOC), ACM, pp. 416-426, 1990.
21. M. Fitzi, J. Garay, U. Maurer, R. Ostrovsky: Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100
22. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. 33rd ACM Symposium on Theory of Computing (STOC), ACM, pp. 580-589, 2001.
23. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. On 2-Round Secure Multiparty Computation. Adv. in Cryptology - Crypto 2002, LNCS vol. 2442, Springer-Verlag, pp. 178-193, 2002.
24. O. Goldreich. Foundations of Cryptography, vol. 1: Basic Tools. Cambridge University Press, Cambridge, UK, 2001.
25. O. Goldreich. Draft of a Chapter on Cryptographic Protocols, June 2003. Available at http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html.
26. O. Goldreich. Draft of an Appendix Regarding Corrections and Additions, June 2003. Available at http://www.wisdom.weizmann.ac.il/~oded/foc-vol2.html.
27. O. Goldreich and A. Kalian. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology 9(3): 167-190, 1996.
28. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM J. Computing 25(1): 169-192, 1996.
29. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game: a Completeness Theorem for Protocols with Honest Majority. 19th ACM Symposium on Theory of Computing (STOC), ACM, pp. 218-229, 1987.
30. R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-Way Permutations. 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 44-61, 1989.
31. J.. Kilian, E. Kushilevitz, S. Micali, R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000)
32. Y. Ishai and E. Kushilevitz. Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. 41st IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 294-304, 2000.
33. J. Katz, R. Ostrovsky, and A. Smith. Round Efficiency of Multi-Party Computation with a Dishonest Majority. Adv. in Cryptology - Eurocrypt 2003, LNCS vol. 2656, Springer-Verlag, pp. 578-595, 2003.
34. E. Kushilevitz, R. Ostrovsky, A. Rosén: Amortizing Randomness in Private Multiparty Computations. SIAM J. Discrete Math. 16(4): 533-544 (2003)
35. J. Kilian and E. Petrank. Concurrent and Resettable Zero-Knowledge in Polylogarithmic Rounds. 31st ACM Symposium on Theory of Computing (STOC), ACM, pp. 560-569, 2001.
36. D. Lapidot and A. Shamir. Publicly-Verifiable Non-Interactive Zero-Knowledge Proofs. Adv. in Cryptology - Crypto 1990, LNCS vol. 537, Springer-Verlag, pp. 353-365, 1991.
37. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Adv. in Cryptology - Crypto 2001, LNCS vol. 2139, Springer-Verlag, pp. 171-189, 2001.
38. Y. Lindell. Personal communication, 2001.
39. S. Micali and P. Rogaway. Secure Computation. Adv. in Cryptology - Crypto 1991, LNCS vol. 576, Springer-Verlag, pp. 392-404, 1991.
40. M. Naor, R. Ostrovsky, R. Venkatesan, M.Yung. Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. CRYPTO 1992: 196-214
41. M. Prabhakaran, A. Rosen, and A. Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. 43rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 366-375, 2002.
42. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. Adv. in Cryptology - Eurocrypt 1999, LNCS vol. 1592, Springer-Verlag, pp. 415-431, 1999.
43. A.C. Yao. How to Generate and Exchange Secrets. 27th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 162-167, 1986.