On 2-round secure multiparty computation

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

Volumn 2442, Issue , 2002, Pages 178-193

  Gennaro, Rosario ^a   Ishai, Yuval ^b   Kushilevitz, Eyal ^c   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Lower bounds; Round complexity; Secure multiparty computation

Indexed keywords

INFORMATION THEORY;

LOWER BOUNDS; NON-TRIVIAL TASKS; POINT-TO-POINT CHANNELS; ROUND COMPLEXITY; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SECURITY THRESHOLDS; TIME COMPLEXITY;

CRYPTOGRAPHY;

EID: 84937440738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_12     Document Type: Conference Paper

References (32)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. 8th ACM PODC, pages 201–209. ACM, 1989.
2. D. Beaver. Minimal-Latency Secure Function Evaluation. In Eurocrypt ’00, pages 335–350, 2000. LNCS No. 1807.
3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO ’90.
4. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. 22nd STOC, pages 503–513. ACM, 1990.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations. Proc. 20th STOC88, pp. 1–10.
6. M. Ben-Or and N. Linial. Collective Coin-Flipping. In Randomness and Computation, pages 91–115, 1990.
7. P. Berman, J. Garay, and K. Perry. Bit Optimal Distributed Consensus. In R. Yaeza-Bates and U. Manber, editors, Computer Science Research, pages 313–322. Plenum Publishing Corporation, 1992.
8. C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proceedings of ICALP’00, 2000.
9. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143–202, 2000.
10. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. 20th STOC88, pages 11–19.
11. R. Cramer and I. Damgård. Secure distributed linear algebra in a constant number of rounds. In Proc. Crypto 2001.
12. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Eurocrypt ’99, pages 311–326, 1999. LNCS No. 1592.
13. Uri Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation (extended abstract). In Proc. 26th STOC, pages 554–563. ACM, 1994.
14. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM. J. Computing, 26(2):873–933, 1997.
15. F. Gavril. Manuscript, 1974.
16. R. Gennaro, S. Halevi, and T. Rabin. Round-optimal zero knowledge with distributed verifiers. www.research.ibm.com/security, 2002.
17. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. 33th STOC. ACM, 2001.
18. Rosario Gennaro. Achieving Independence Efficiently and Securely. In Proc. 14th ACM PODC, pages 130–136. ACM, 1995.
19. O. Goldreich. Secure multi-party computation (manuscript). www.wisdom.weizmann.ac.il/∼oded/pp.html, 1998.
20. O. Goldreich. Foundation of Cryptography – Fragments of a Book. ECCC 1995. Available online from http://www.eccc.uni-trier.de/eccc/.
21. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proc. 19th STOC, pages 218–229. ACM, 1987.
22. Y. Ishai and E. Kushilevitz. Private simultaneous messages protocols with applications. In ISTCS97, pages 174–184, 1997.
23. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st FOCS, 2000.
24. Y. Ishai and E. Kushilevitz. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In Proc. ICALP ’02.
25. L. Lamport, R.E. Shostack, and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. and Systems, 4(3):382–401, 1982.
26. Y. Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In Crypto ’01, pages 171–189, 2001. LNCS No. 2139.
27. N. Lynch. Distributed Algorithms. Morgan Kaufman, 1996.
28. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. 10th ACM PODC, pages 51–59. ACM, 1991.
29. M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228–234, 1980.
30. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73–85. ACM, 1989.
31. T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing For NC1. In Proc. 40th FOCS, pages 554–567. IEEE, 1999.
32. A. C-C. Yao. How to Generate and Exchange Secrets. In Proc. 27th FOCS, pages 162–167. IEEE, 1986.