General adversaries in unconditional multi-party computation

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

Volumn 1716, Issue , 1999, Pages 232-246

  Fitzi, Matthias ^a   Hirt, Martin ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

General adversaries; Mixed model; Multi party computation; Unconditional security

Indexed keywords

POLYNOMIALS; SECURITY OF DATA;

ADVERSARY STRUCTURES; ERROR PROBABILITIES; GENERAL ADVERSARY; GENERALIZED ADVERSARY STRUCTURE; MIXED MODELING; MULTIPARTY COMPUTATION; UNCONDITIONAL SECURITY; UNCONDITIONALLY SECURE;

CRYPTOGRAPHY;

EID: 33746018016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_19     Document Type: Conference Paper

References (21)

1. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pp. 75–122, 1991.
2. 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.
3. J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology — CRYPTO’88, volume 403 of Lecture Notes in Computer Science. Springer-Verlag, 1988.
4. R. Canetti. Security and composition of multi-party cryptographic pro- tocols. Manuscript, June 1998. Former (more general) version: Modular composition of multi-party cryptographic protocols, Nov. 1997.
5. 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.
6. R. Cramer, I. Damgárd, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations with dishonest minority. In Advances in Cryp-tology — EUROCRYPT’99, Lecture Notes in Computer Science, 1999.
7. R. Cramer, I. Damgárd, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. Manuscript, 1999.
8. D. Chaum. The spymasters double-agent problem. In Advances in Cryp-tology — CRYPTO’89, volume 435 of Lecture Notes in Computer Science, pp. 591–602. Springer-Verlag, 1989.
9. I. Damgárd. An error in the mixed adversary protocol by Fitzi, Hirt and Maurer. paper 99-03, 1999.
10. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(1):17–47, Jan. 1993.
11. M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Advances in Cryptology — CRYPTO’98, volume 1462 of Lecture Notes in Computer Science, 1998.
12. M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In Distributed Computing — DISC’98, volume 1499 of Lecture Notes in Computer Science, Sept. 1998.
13. Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure fault-tolerant protocols and the public-key model. In Advances in Cryptology — CRYPTO’87, volume 293 of Lecture Notes in Computer Science, pp. 135– 155. Springer-Verlag, 1987.
14. 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.
15. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), pp. 25–34, Aug. 1997.
16. M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings IEEE Globecom’87, pp. 99–102. IEEE, 1987.
17. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.
18. S. Micali and P. Rogaway. Secure computation: The information theoretic case. Manuscript, 1998. Former version: Secure computation, In Advances in Cryptology — CRYPTO’91, volume 576 of Lecture Note in Computer Science, pp. 392–404, Springer-Verlag, 1991. 237, 238
19. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symposium on the Theory of
20. 2 adversary structures. Manuscript, July 1998. 235, 244
21. A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Sympo- sium on the Foundations of Computer Science (FOCS), pp. 160–164. IEEE, 1982. 233