M. Hirt, U. Maurer: Complete Characterization of Adversaries Tolerable in General Multiparty Computations, Proc. PODC '97. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Span Programs and General Secure Multi-Party Computation - Cramer, Damgård, Maurer (1997) (3 citations) (Correct)
....for the information theoretic model due to Ben Or, Goldwasser and Wigderson [4] and Chaum, Cr epeau and Damgard [8] state that every function can securely be computed if and only if less than n=2 passive or less than n=3 active cheaters are present. These result were generalized by Hirt and Maurer [15] who considered as the potential adversaries general sets of subsets of the player set, not necessarily specified by their cardinality. Using terminology from secret sharing and from [15] we call a set of subsets of the players a structure and we consider security (privacy and correctness) of a ....
....n=2 passive or less than n=3 active cheaters are present. These result were generalized by Hirt and Maurer [15] who considered as the potential adversaries general sets of subsets of the player set, not necessarily specified by their cardinality. Using terminology from secret sharing and from [15], we call a set of subsets of the players a structure and we consider security (privacy and correctness) of a protocol with respect to an adversary structure, meaning that the protocol remains secure even when an arbitrary set in the structure happens to be controlled by an adversary (which may be ....
[Article contains additional citation context not shown here]
M. Hirt, U. Maurer: Complete Characterization of Adversaries Tolerable in General Multiparty Computations, Proc. PODC '97.
Span Programs over Rings and How to Share a Secret from a Module - Fehr (1998) (2 citations) (Correct)
....AGAINST ACTIVE CHEATERS 37 all players are supposed to take part in the secret reconstruction (and the honest players do) then the second condition of (5. 1) follows from the first if the access structure Gamma has the property that A; A 0 ; A 00 62 Gamma ) A[A 0 [A 00 6= P (see also [12] and [8] In the second section of this chapter we will even allow the dealer to play faulty, and we will show how the players can by communication between each other detect that the dealer cheated or at least agree on a set of correct shares. And this even if some of the players play faulty as ....
M. Hirt, U. Maurer: Complete Characterization of Adversaries Tolerable in Secure Multiparty Computation (extended abstract). In Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 25--34, Santa Barbara, California, 21--24 August 1997.
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