Efficient multiparty computations secure against an adaptive adversary

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

Volumn 1592, Issue , 1999, Pages 311-326

  Cramer, Ronald ^a   Damgård, Ivan ^b   Dziembowski, Stefan ^b   Hirt, Martin ^a   Rabin, Tal ^c  

^a ETH ZURICH   (Switzerland)

^b AARHUS UNIVERSITY   (Denmark)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ADAPTIVE ADVERSARY; BROADCAST CHANNELS; MULTIPARTY COMPUTATION; SECRET SHARING; SECURE CHANNELS; SECURE PROTOCOLS; ZERO ERRORS;

CRYPTOGRAPHY;

EID: 84957717648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_22     Document Type: Conference Paper

References (20)

1. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 4:75-122, 1991.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC, pp. 1-10. ACM, 1988.
3. D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic dversaries. Eurocrypt '92, pp. 307-323. Springer LNCS 658, 1992.
4. R. Canetti. Security and composition of multiparty cryptographic protocols. Manuscript, to appear, 1998.
5. D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th STOC, pp. 11-19. ACM, 1988.
6. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Veriffiable secret sharing and achieving simultaneity in the presence of faults. In 26th FOCS, pp. 383-395. IEEE, 1985.
7. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. Manuscript, 1999.
8. Ran Canetti, Uri Feige, Oded Goldreich, andMoni Naor. Adaptively secure multi-party computation. In 28th STOC, pp. 639-648. ACM, 1996.
9. P. Feldman and S. Micali. An optimal algorithm for synchronous Byzantine agreement. In 20th STOC, pp. 148-161. ACM, 1988.
10. S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. Crypto '90, pp. 77-93. Springer LNCS 537, 1990.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th STOC, pp. 218-229. ACM, 1987.
12. R. Gennaro, M. Rabin, and T Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th PODC, pp. 101-111. ACM, 1998.
13. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in general multiparty computations. In 16th PODC, pp. 25-34. ACM, 1998.
14. M. Karchmer and A. Wigderson. On span programs. In Proc. of Structure in Complexity, pp. 383-395, 1993.
15. S. Micali and P. Rogaway. Secure computation. Crypto '91, pp. 392-404. Springer LNCS 576, 1991.
16. S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, to appear, 1998.
17. T. Rabin. Robust sharing of secrets when the dealer is honest or faulty. Journal of the ACM, 41(6):1089-1109, 1994.
18. T. Rabin and M. Ben-Or. Veriffiable secret sharing and multiparty protocols with honest majority. In 21st STOC, pp. 73-85. ACM, 1989.
19. 2 adversary structures. Manuscript, 1998.
20. A.C. Yao. Protocols for secure computations. In 23rd FOCS, pp. 160-164. IEEE, 1982.