Efficient multi-party computation with dispute control

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

Volumn 3876 LNCS, Issue , 2006, Pages 305-328

  Beerliova Trubiniova, Zuzana ^a   Hirt, Martin ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; DISPUTE CONTROLS; MULTI-PARTY COMPUTATION (MPC); PLAYER-ELIMINATION FRAMEWORKS;

DATA REDUCTION; DATABASE SYSTEMS; FUNCTIONS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

COMPUTATIONAL COMPLEXITY;

EID: 33745570603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11681878_16     Document Type: Conference Paper

References (19)

1. [Bea91a] D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO '91, LNCS 576, pp. 420-432, 1991.
2. [Bea91b] D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pp. 75-122, 1991.
3. [BGP92] P. Berman, J. A. Garay, and K. J. Perry. Bit optimal distributed consensus. Computer Science Research, pp. 313-322, 1992. Preliminary version in Proc. 21st STOC, 1989.
4. [BGW88] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th STOC, pp. 1-10, 1988.
5. [CCD88] D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th STOC, pp. 11-19, 1988.
6. +99] R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT '99, LNCS 1592, pp. 311-326, 1999.
7. [CDG87] D. Chaum, I. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In CRYPTO '87, LNCS 293, pp. 87-119, 1987.
8. [CW79] L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(4):143-154, 1979. Preliminary version in Proc. 9st STOC, 1977.
9. [CW92] B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, 1992. Preliminary version in Proc. 8th PODC, 1989.
10. [DS82] D. Dolev and H. R. Strong. Polynomial algorithms for multiple processor agreement. In Proc. 14th STOC, pp. 401-407, 1982.
11. [GHY87] Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure fault-tolerant protocols and the public-key model. In CRYPTO '87, LNCS 293, pp. 135-155, 1987.
12. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. 19th STOC, pp. 218-229, 1987.
13. [HM01] M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO '01, LNCS 2139, pp. 101-118, 2001.
14. [HMP00] M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In ASIACRYPT '00, LNCS 1976, pp. 143-161, 2000.
15. [PSL80] M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, Apr. 1980.
16. [PW92] B. Pfitzmann and M. Waidner. Unconditional Byzantine agreement for any number of faulty processors. In Proc. 9th STAGS, LNCS 577, 1992.
17. [RB89] T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st STOC, pp. 73-85, 1989.
18. [Sha79] A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
19. [Yao82] A. C. Yao. Protocols for secure computations. In Proc. 23rd FOCS, pp. 160-164, 1982.