M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In Proceedings of ASIACRYPT, pages 232--246, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Secure Multi-Party Computation Made Simple - Ueli Maurer Department (5 citations) Self-citation (Maurer) (Correct)
No context found.
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation, Advances in Cryptology -- ASIACRYPT '99, K.Y. Lam et al. (Eds.), Lecture Notes in Computer Science, Berlin: SpringerVerlag, vol. 1716, pp. 232--246, 1999.
Linear VSS and Distributed Commitments Based on Secret Sharing .. - Fehr, Maurer (2002) (5 citations) Self-citation (Maurer) (Correct)
....implies that all accepted shares are pairwise consistent and hence consistent with respect to ae. ut To our knowledge, the condition P 62 Delta tAtA for VSS to be possible has not been stated previously in the literature, although the condition for secure multiparty computation has been given in [7]. In the threshold case, this confirms Lemma 1 of [6] If the total number of (passively) corrupted players is t and if u of them can even be actively corrupted, then VSS is possible if and only if t 2u n. The following lemma will be helpful in the next section. Lemma 1. Predicate (4) is ....
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multiparty computation. In Advances in Cryptology - ASIACRYPT '99, Lecture Notes in Computer Science. Springer, 1999.
Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (34 citations) Self-citation (Hirt Maurer) (Correct)
....in terms of quorum systems. In [CDM98] efficient and modular protocols secure against general adversaries are given for the active and passive model with unconditional and computational security. The efficiency of the protocols for the active model with broadcast is improved in [SS98] Finally, in [FHM99], a new model with general (nonthreshold) mix type (active and passive at the same time) adversaries is proposed and tight bounds on the existence of such protocols are given. 1.7 Outline of the Paper The basic technique for constructing a protocol that tolerates a given adversary structure is to ....
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. Manuscript, 1999.
Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005) (1 citation) (Correct)
No context found.
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In Proceedings of ASIACRYPT, pages 232--246, 1999.
Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005) (1 citation) (Correct)
No context found.
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multi-party computation. In Proceedings of ASIACRYPT, pages 232--246, 1999.
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
No context found.
Matthias Fitzi, Martin Hirt, and Ueli Maurer. General adversaries in unconditional multi-party computation. In Advances in Cryptology--- ASIACRYPT '99, volume 1716 of Lecture Notes in Computer Science. Springer, 1999.
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