SMITH, A., AND STIGLIC, A. Multiparty computation unconditionally secure against adversary structures. Cryptology SOCS-98.2, School of Computer Science, McGill University, Montreal, Canada, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (34 citations) (Correct)
....are formulated 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 ....
....is presented. Our techniques also allow us to prove the natural generalization of the threshold type results in [RB89] for a model with a broadcast channel: unconditional multiparty computation is possible if and only if no two sets in the adversary structure cover the full player set [HM97] [SS98]. More generally, the simulation technique applies to most previously proposed unconditional multiparty protocols. Furthermore, we believe that every reasonable protocol generator can be used in our construction, but we have also given an example of an artificial protocol generator which can not ....
A. Smith and A. Stiglic. Multiparty computation unconditionally secure against Q 2 adversary structures. Manuscript, July 1998.
General Adversaries in Unconditional Multi-Party Computation - Fitzi, Hirt, Maurer (1999) (3 citations) (Correct)
....with classical protocols [BGW88,RB89] as a basis. Cramer, Damgard, and Maurer [CDM99] proved that for every adversary structure for which multi party computation is feasible and for which there is an efficient linear secret sharing scheme, efficient multi party protocols exist. Smith and Stiglic [SS98] consider also uniquely active adversaries and propose protocols for the active model with broadcast. The efficiency of their protocols is polynomial in the size of a span program that computes the adversary structure, however in Section 4 we prove that for some adversary structures, every ....
....some players and simultaneously passively corrupt some additional players. The characterization of the adversary is given by a set of pairs of subsets of the player set (rather than thresholds as in [Cha89,DDWY93,FHM98] or an adversary structure for either passive or active corruption [HM97,CDM99,SS98] Moreover we have proposed constructions that, for any admissible adversary, yield secure protocols with communication and computation complexities polynomial in the size of the adversary structure. This improves on those protocols in [HM97] that have complexities super polynomial in the size ....
A. Smith and A. Stiglic. Multiparty computation unconditionally secure against Q 2 adversary structures. Manuscript, July 1998.
Efficient Multiparty Computations Secure Against.. - Cramer.. (1999) (7 citations) (Correct)
....As far as general adversaries are concerned, security against Q 2 adversaries is the maximum attainable level of security. This construction gives a VSS with complexity O( k logn)nm 3 ) bits, where m is the size of the monotone span program. In some independent work Smith and Stiglic[SS98] present a somewhat similar idea, which however results in a less efficient protocol (O(k 2 (k log n)nm 3 ) bits) because they directly apply the ideas from [CDM99] to [Rab94] i.e. replace in [Rab94] Shamir s secret sharing by the monotone span programs with multiplication from [CDM99] ....
A. Smith and A. Stiglic. Multiparty computations unconditionally secure against Q 2 adversary structures. Manuscript, 1998.
Traffic Analysis Attacks and Trade-Offs in Anonymity.. - Back, Möller, Stiglic (2001) (10 citations) Self-citation (Stiglic) (Correct)
....in practice. 2 Chaum argues that DC nets are efficient in a ring topology, which can be found on some local networks, but does not exist in large scale networks such as the Internet. Secure multi party computations 3 are a related problem that has received considerable attention ( 13] 11] [27], 7] A multi party computation protocol can be used to hide participants communication partners ( 24] But general multi party computations are inefficient in practice with regards to communication complexity, and most solutions rely on the existence of a synchronous network and are often not ....
SMITH, A., AND STIGLIC, A. Multiparty computation unconditionally secure against adversary structures. Cryptology SOCS-98.2, School of Computer Science, McGill University, Montreal, Canada, 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