Robustness for free in unconditional multi-party computation

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

Volumn 2139 LNCS, Issue , 2001, Pages 101-118

  Hirt, Martin ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTIVE ADVERSARY; COMMUNICATION COMPLEXITY; FINITE FIELDS; MULTI-PARTY COMPUTATION PROTOCOLS; MULTIPARTY COMPUTATION; OVERHEAD COSTS; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 84880854377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_6     Document Type: Conference Paper

References (25)

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, Aug. 1989.
2. M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computation. In Proc. 25th ACM Symposium on the Theory of Computing (STOC), pp. 52-61, 1993.
3. D. Beaver. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pp. 420-432, 1991.
4. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pp. 75-122, 1991.
5. E. R. Berlekamp and L. Welch. Error correction of algebraic block codes. US Patent Number 4,633,470, 1986.
6. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology - CRYPTO '90, volume 537 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
7. P. Berman, J. A. Garay, and K. J. Perry. Towards optimal distributed consensus (extended abstract). In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pp. 410-415, 1989.
8. 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.
9. R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
10. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 11-19, 1988.
11. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pp. 311-326, 1999.
12. R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Advances in Cryptology - EUROCRYPT '01, volume 2045 of Lecture Notes in Computer Science, pp. 280-300, 2001.
13. I. Damgård and J. B. Nielsen. An efficient pseudo-random generator with applications to public-key encryption and constant-round multiparty computation. Manuscript, May 2001.
14. Serge Fehr. Personal communications, 2000.
15. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. 26th ACM Symposium on the Theory of Computing (STOC), pp. 554-563, 1994.
16. 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.
17. 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.
18. 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), pp. 218-229, 1987.
19. 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), pp. 101-111, 1998.
20. M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, editor, Advances in Cryptology - ASI-ACRYPT '00, volume 1976 of Lecture Notes in Computer Science, pp. 143-161. Springer-Verlag, Dec. 2000.
21. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. 41st IEEE Symposium on the Foundations of Computer Science (FOCS), Oct. 2000.
22. 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.
23. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
24. K. Srinathan and C. P. Rangan. Efficient asynchronous secure multiparty distributed computation. In Indocrypt 2000, volume 1977 of Lecture Notes in Computer Science, Dec. 2000.
25. A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 160-164. IEEE, 1982.