R. Cramer, I. Damgard, S. Dziembowski, M. Hirt and T. Rabin: E#cient Multiparty Computations with Dishonest Minority, Proceedings of EuroCrypt 99. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Secure Multi-party Quantum Computation - Crépeau, Gottesman, Smith (2002) (4 citations) (Correct)
....if and only if t . If one assumes pairwise secure channels but no computational assumptions, then one can compute any function securely if and only if t n 3 [5, 8] If one further assumes the availability of a secure broadcast channel, then one can in fact tolerate t n 2, and no more ([21, 3, 11]) All of these protocols rely on verifiable secret sharing as a basic tool. Our solution draws most heavily on the techniques of Chaum, Crepeau and Damgard [8] Beyond these basic protocols, much work has focused on finding proper definitions of security, e.g. 15, 4, 18, 20, 6] We adopt a ....
....unjammable, secret) quantum and classical channels, and that there is a classical authenticated broadcast channel to which all players have access. Because we will always consider settings where t 2 , we can also assume that players can perform classical multi party computations securely [11] . The adversary is an arbitrary quantum algorithm (or family of circuits) A (not necessarily polynomial time) and so the security of our protocols does not rely on computational assumptions. The real and ideal models, as well as the notion of security, are specified more carefully in [22] ....
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt, and T. Rabin. E#cient multiparty computations with dishonest minority. In J. Stern, editor, Proc. of EUROCRYPT 99, volume 1592 of LNCS. IACR, Springer-Verlag, 1999.
Statistical Multiparty Computation Based on - Random Walks On (2005) (Correct)
No context found.
R. Cramer, I. Damgard, S. Dziembowski, M. Hirt and T. Rabin: E#cient Multiparty Computations with Dishonest Minority, Proceedings of EuroCrypt 99.
Multiparty computation unconditionally secure against Q - Adversary Structures Adam (Correct)
No context found.
Ronald Cramer, Ivan Damgrd, Stefan Dziembowski, Martin Hirt, and Tal Rabin. E cient multiparty computations with dishonest minority. Submitted to EUROCRYPT '99, October 1998.
Multiparty computation unconditionally secure against Q² .. - Smith, Stiglic (1998) (3 citations) (Correct)
No context found.
Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin. E cient multiparty computations with dishonest minority. Submitted to EUROCRYPT '99, October 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC