Multi-party computation with hybrid security

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

Volumn 3027, Issue , 2004, Pages 419-438

  Fitzi, Matthias ^a   Holenstein, Thomas ^b   Wullschleger, Jürg ^c  

^a University of California   (United States)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BROADCASTING; COMPUTERS;

ACHIEVABILITY; ACTIVE ADVERSARY; COMPUTATIONAL SECURITY; GENERAL MODEL; HYBRID SECURITIES; MULTIPARTY COMPUTATION; SECURE CHANNELS; UNCONDITIONAL SECURITY;

COMPUTATION THEORY;

EID: 35048830996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_25     Document Type: Article

References (32)

1. [Bea89] Donald Beaver. Multiparty protocols tolerating half faulty processors. In Advances in Cryptology: CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 560-572. Springer-Verlag, 1989.
2. [Bea91] Donald Beaver. Foundations of secure interactive computation. In Advances in Cryptology: CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 377-391. Springer-Verlag, 1991.
3. [BG89] Donald Beaver and Shaft Goldwasser. Multiparty computation with faulty majority. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS '89), pages 468-473, 1989.
4. [BGP89] Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Towards optimal distributed consensus (extended abstract). In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS '89), pages 410-415, 1989.
5. [BGW88] Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pages 1-10. Springer-Verlag, 1988.
6. [Can00] Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
7. [CCD88] David Chaum, Claude Cŕpeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pages 11-19. ACM Press, 1988.
8. [CDD+99] Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology: EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, 1999.
9. [Cha89] David Chaum. The spymasters double-agent problem. In Advances in Cryptology: CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 591-602. Springer-Verlag, 1989.
10. [Cle86] Richard Cleve. Limits on the security of coin flips when half the processors are faulty. In ACM Symposium on Theory of Computing (STOC '86), pages 364-369, Baltimore, USA, May 1986. ACM Press.
11. [DFF+82] Danny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, and H. Raymond Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257-274, March 1982.
12. [Dol82] Danny Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14-30, 1982.
13. [DS82] Danny Dolev and H. Raymond Strong. Polynomial algorithms for multiple processor agreement. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '82), pages 401-407, 1982.
14. [DS83] Danny Dolev and H. Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983.
15. [FGH+02] Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith. Detectable Byzantine agreement secure against faulty majorities. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), pages 118-126, 2002.
16. [FHHW03] Matthias Fitzi, Martin Hirt, Thomas Holenstein, and Jurg Wullschleger. Two-threshold broadcast and detectable multi-party computation. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT '03, Lecture Notes in Computer Science. Springer-Verlag, May 2003.
17. [FLM86] Michael J. Fischer, Nancy A. Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-39, 1986.
18. [FM97] Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM Journal on Computing, 26(4):873-933, August 1997.
19. [FM00] Matthias Fitzi and Ueli Maurer. From partial consistency to global broadcast. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC '00), pages 494-503, 2000.
20. [GHY87] Zvi Galil, Stuart Haber, and Moti 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, pages 135-155. Springer-Verlag, 1987.
21. [GL90] Shafi Goldwasser and Leonid Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology: CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 11-15. Springer-Verlag, 1990.
22. [GL02] Shafi Goldwasser and Yehuda Lindell. Secure computation without agreement. 16th International Symposium on Distributed Computing (DISC '02). Preliminary version on http://www.research.ibm.com/people/l/lindell, 2002.
23. [GLR95] Li Gong, Patrick Lincoln, and John Rushby. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults. In Proceedings of the 5th Conference on Dependable Computing for Critical Applications (DCCA-5), pages 79-90, 1995.
24. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC '87), pages 218-229. ACM Press, 1987.
25. [Gol0l] Oded Goldreich. Secure multi-party computation, working draft, version 1.3, June 2001.
26. [LLR02] Yehuda Lindell, Anna Lysyanskaya, and Tal Rabin. On the composition of authenticated Byzantine agreement. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02), pages 514-523. ACM Press, 2002.
27. [LSP82] Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
28. [PW96] Birgit Pfitzmann and Michael Waidner. Information-theoretic pseudosignatures and Byzantine agreement for t >= n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
29. [RB89] Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), pages 73-85, 1989.
30. [TC84] Russell Turpin and Brian A. Coan. Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters, 18(2):73-76, February 1984.
31. [WP89] Michael Waidner and Birgit Pfitzmann. Unconditional sender and recipient untraceability in spite of active attacks -some remarks. Technical Report 5/89, Universität Karlsruhe, Institut für Rechnerentwurf und Fehlertoleranz, 1989.
32. [Yao82] Andrew C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOGS '82), pages 160-164, 1982.