Secure multiparty computation with minimal interaction

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

Volumn 6223 LNCS, Issue , 2010, Pages 577-594

  Ishai, Yuval ^a   Kushilevitz, Eyal ^b   Paskin, Anat ^b  

^a University of California   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

round complexity; Secure multiparty computation

Indexed keywords

BLACK BOXES; CLIENT SERVER; COMMUNICATION ROUNDS; CRYPTOGRAPHIC ASSUMPTIONS; MINIMAL INTERACTIONS; PSEUDORANDOM GENERATORS; ROUND COMPLEXITY; SECURE MULTIPARTY COMPUTATION; UNCONDITIONAL SECURITY;

CRYPTOGRAPHY; MODEL PREDICTIVE CONTROL; NETWORK SECURITY; SERVERS;

NETWORK PROTOCOLS;

EID: 77956991013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_31     Document Type: Conference Paper

References (53)

1. Alon, N., Merritt, M., Reingold, O., Taubenfeld, G., Wright, R.N.: Tight bounds for shared memory systems accessed by Byzantine processes. Journal of Distributed Computing 18(2), 99-109 (2005)
2. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computational Complexity 15(2), 115-162 (2006)
3. Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. In: Proc. 18th STOC, pp. 150-164 (1986)
4. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds. In: Proc. 8th ACM PODC, pp. 201-209 (1989)
5. Beaver, D.: Minimal-Latency Secure Function Evaluation. In: Preneel, B. (ed.) EURO-CRYPT 2000. LNCS, vol. 1807, pp. 335-350. Springer, Heidelberg (2000)
6. Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P.: Security with low communication overhead (extended abstract). In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 62-76. Springer, Heidelberg (1991)
7. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Proc. 22nd STOC, pp. 503-513 (1990)
8. Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. Phd. thesis. Dept. of Computer Science (1996)
9. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. In: Proc. 20th STOC 1988, pp. 1-10 (1988)
10. Cachin, C., Camenisch, J., Kilian, J., Muller, J.: One-round secure computation and secure autonomous mobile agents. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 512. Springer, Heidelberg (2000)
11. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryp-tology 13(1), 143-202 (2000)
12. Canetti, R.: Universally composable security: A new paradigm for cryptographic proto-cols.cfik03. In: FOCS, pp. 136-145 (2001)
13. Chaum, D., Crepeau, C., Damgard, I.: Multiparty Unconditionally Secure Protocols. In: Proc. 20th STOC 1988, pp. 11-19 (1988)
14. Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient Multi-party Computation over Rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596-613. Springer, Heidelberg (2003)
15. Choi, S.G., Elbaz, A., Juels, A., Malkin, T., Yung, M.: Two-Party Computing with Encrypted Data. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 298-314. Springer, Heidelberg (2007)
16. Choi, S.G., Elbaz, A., Malkin, T., Yung, M.: Secure Multi-party Computation Minimizing Online Rounds. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 268-286. Springer, Heidelberg (2009)
17. Cramer, R., Damgård, I.: Secure distributed linear algebra in a constant number of rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, p. 119. Springer, Heidelberg (2001)
18. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations with dishonest minority. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
19. Cramer, R., Damgård, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342-362. Springer, Heidelberg (2005)
20. Cramer, R., Damgård, I., Maurer, U.M.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
21. Damgård, I., Ishai, Y.: Secure multiparty computation using a black-box pseudorandom generator. In: Proc. CRYPTO 2005 (2005)
22. Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation. In: Proc. 26th STOC, pp. 554-563 (1994)
23. Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Information Processing Letters 14(4), 183-186 (1982)
24. Fitzi, M., Garay, J.A., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-Optimal and Efficient Verifiable Secret Sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
25. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: Proc. 33th STOC (2001)
26. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-Round Secure Multiparty Computation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 178-193. Springer, Heidelberg (2002)
27. Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting Data Privacy in Private Information Retrieval Schemes. In: STOC 1998, pp. 151-160 (1998)
28. Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)
29. Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: Proc. 19th STOC, pp. 218-229 (1987)
30. Goldwasser, S., Lindell, Y.: Secure Multi-Party Computation without Agreement. J. Cryptology 18(3), 247-287 (2005)
31. Horvitz, O., Katz, J.: Universally-Composable Two-Party Computation in Two Rounds. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 111-129. Springer, Heidelberg (2007)
32. Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: ISTCS 1997, pp. 174-184 (1997)
33. Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: Proc. 41st FOCS (2000)
34. Ishai, Y., Kushilevitz, E.: Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 244. Springer, Heidelberg (2002)
35. 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)
36. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electronics and Communications in Japan, Part III: Fundamental Electronic Science 72(9), 56-64
37. Jarecki, S., Shmatikov, V.: Efficient Two-Party Secure. Computation on Committed Inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 97-114. Springer, Heidelberg (2007)
38. Karchmer, M., Wigderson, A.: On Span Programs. In: Proceedings of the 8th Structures in Complexity conference, pp. 102-111 (1993)
39. Katz, J., Koo, C.-Y.: Round-Efficient Secure Computation in Point-to-Point Networks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 311-328. Springer, Heidelberg (2007)
40. Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the Round Complexity of VSS in Point-to-Point Networks. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 499-510. Springer, Heidelberg (2008)
41. Katz, J., Ostrovsky, R.: Round-Optimal Secure Two-Party Computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 335-354. Springer, Heidelberg (2004)
42. Katz, J., Ostrovsky, R., Smith, A.: Round Efficiency of Multi-party Computation with a Dishonest Majority. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 578-595. Springer, Heidelberg (2003)
43. Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC 2006, pp. 109-118 (2006), Full version: Cryptology ePrint Archive, Report 2009/630 (2009)
44. Lamport, L., Shostack, R.E., Pease, M.: The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems 4(3), 382-401 (1982)
45. Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 171-189. Springer, Heidelberg (2001)
46. 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)
47. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
48. Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proc. STOC 2004, pp. 232-241 (2004)
49. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613
50. Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The Round Complexity of Verifiable Secret Sharing Revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487-504. Springer, Heidelberg (2009)
51. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proc. 21st STOC, pp. 73-85 (1989)
52. Sander, T., Young, A., Yung, M.: Non-Interactive CryptoComputing For NC1. In: Proc. 40th FOCS, pp. 554-567. IEEE, Los Alamitos (1999)
53. Yao, A.C.-C.: How to Generate and Exchange Secrets. In: Proc. 27th FOCS, pp. 162-167. IEEE, Los Alamitos (1986)