Efficient secure multi-party computation

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

Volumn 1976, Issue , 2000, Pages 143-161

  Hirt, Martin ^a   Maurer, Ueli ^a   Przydatek, Bartosz ^b  

^a ETH ZURICH   (Switzerland)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

COMMUNICATION COMPLEXITY; DISTRIBUTED COMPUTATIONS; MULTI-PARTY PROTOCOLS; SECURE MULTI-PARTY COMPUTATION; UNCONDITIONALLY SECURE;

COMPUTATION THEORY;

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

References (33)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC), pp. 201–210, 1989.
2. D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology — CRYPTO ’91, vol. 576 of LNCS, pp. 420–432, 1991.
3. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pp. 75–122, 1991.
4. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Advances in Cryptology — CRYPTO ’90, pp. 62–76, 1990.
5. P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In Proc. 21st IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 410–415, 1989. Expanded version: Bit optimal distributed consensus. In Computer Science Research, 1992.
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 1–10, 1988.
7. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. 22nd ACM Symposium on the Theory of Computing (STOC), pp. 503–513, 1990.
8. R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143–202, 2000.
9. D. Chaum, C. Cr´epeau, and I. Damg˚ard. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11–19, 1988.
10. R. Cramer, I. Damg˚ard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology — EUROCRYPT ’99, vol. 1592 of LNCS, p p. 311–326, 1999.
11. R. Cramer, I. Damg˚ard, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. In Advances in Cryptology — EUROCRYPT ’00, vol. 1807 of LNCS, pp. 316–334, 2000.
12. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. Manuscript, 2000.
13. R. Canetti and A. Herzberg. Maintaining security in the presence of transient faults. In Advances in Cryptology — CRYPTO ’94, vol. 839 of LNCS, pp. 425–438, 1994.
14. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. In Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123–132, 2000.
15. B. A. Coan and J. L. Welch. Modular construction of nearly optimal Byzantine agreement protocols. In Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC), pp. 295–305, 1989. Expanded version: Modular construction of a Byzantine agreement protocol with optimal message bit complexity. In Information and Computation, 97(1):61- 85, 1992.
16. D. Dolev, M. J. Fischer, R. Fowler, N. A. Lynch, and H. R. Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257–274, 1982.
17. D. Dolev and R. Reischuk. Bounds on information exchange for Byzantine agreement. Journal of the ACM, 32(1):191–204, 1985.
18. D. Dolev, R. Reischuk, and H. R. Strong. ‘Eventual’ is earlier than ‘Immediate’. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 196–203, 1982. Final version: Early Stopping in Byzantine Agreement. In Journal of the ACM, 37(4):720-741, October 1990.
19. M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Advances in Cryptology — CRYPTO ’98, vol. 1462 of LNCS, pp. 121–136, 1998.
20. P. Feldman and S. Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 148–161, 1988. Expanded version in SIAM Journal on Computing 26(4):873–933, August 1997.
21. M. K. Franklin and M. Yung. Communication complexity of secure computation. In Proc. 24th ACM Symposium on the Theory of Computing (STOC), pp. 699–710, 1992.
22. Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure faulttolerant protocols and the public-key model. In Advances in Cryptology — CRYPTO ’87, vol. 293 of LNCS, pp. 135–155. Springer-Verlag, 1987.
23. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game — a completeness theorem for protocols with honest majority. In Proc. 19th ACM Symposium on the Theory of Computing (STOC), p p. 218–229, 1987.
24. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
25. V. Hadzilacos and J. Y. Halpern. Message-optimal protocols for byzantine agreement. In Proc. 10th ACM Symposium on Principles of Distributed Computing (PODC), pp. 309–324, 1991. Final version in Mathematical Systems Theory, 26:41-102, October 1993.
26. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, 2000. Extended abstract in Proc. 16th of ACM PODC ’97.
27. S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, 1998. Former version: Secure computation, In Ad vances in Cryptology — CRYPTO ’91, volume 576 of LNCS, pp. 392–404, Springer-Verlag, 1991.
28. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks (extended abstract). In Proc. 10th ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–59, 1991.
29. B. Przydatek. Efficiency in multi-party computation. Master’s thesis, ETH Zurich, 1999.
30. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, 1980.
31. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pp. 73–85, 1989.
32. A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, 1979.
33. A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 160–164. IEEE, 1982.