aqora

Efficient Multiparty Computations Secure Against an Adaptive Adversary

Ronald Cramer, Ivan Damgård, Stefan Dziembowski +2 more

Lecture notes in computer scienceJan 1, 1999223 citations

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

Mrinal Kumar, Kannan Srinathan, Chandrasekharan Pandu Rangan

Lecture notes in computer scienceJan 1, 20027 citations

Secure Multiparty Computation with Minimal Interaction

Yuval Ishai, Eyal Kushilevitz Z, Anat Paskin-Cherniavsky

Lecture notes in computer scienceJan 1, 201057 citations

Multiparty computation unconditionally secure against Q^2 adversary structures

Adam Smith, Anton Štiglić

We present here a generalization of the work done by Rabin and Ben-Or. We give a protocol for multiparty computation which tolerates any Q^2 active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although we allow an exponentially small probability of error. This is possible due to a protocol for computing the product of two values already shared by means of a homomorphic commitment scheme which appeared originally in a paper of Chaum, Evertse and van de Graaf.We present here a generalization of the work done by Rabin and Ben-Or. We give a protocol for multiparty computation which tolerates any Q^2 active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although we allow an exponentially small probability of error. This is possible due to a protocol for computing the product of two values already shared by means of a homomorphic commitment scheme which appeared originally in a paper of Chaum, Evertse and van de Graaf.

arXiv:cs/9902010Feb 8, 19998 citations

Information-Theoretic Secure Multiparty Computation

Ueli M. Maurer, Vassilis Zikas

Most of this book has considered two-party and multiparty computation with security with (unfair) abort. This security notion allows the adversary to force the honest parties to abort even depending on the outputs of corrupted parties. (Note, however, that the adversary is not allowed to bias the output of honest parties in any other manner.) This relaxation of security is necessary if one wishes to tolerate arbitrarily many corruptions. A further relaxation considers computational security, where the adversary is assumed to be computationally bounded, e.g., probabilistic polynomial time. In this setting, any circuit can be securely realized even when arbitrarily many parties are corrupted, as long as one is willing to sacrifice fairness and robustness.Most of this book has considered two-party and multiparty computation with security with (unfair) abort. This security notion allows the adversary to force the honest parties to abort even depending on the outputs of corrupted parties. (Note, however, that the adversary is not allowed to bias the output of honest parties in any other manner.) This relaxation of security is necessary if one wishes to tolerate arbitrarily many corruptions. A further relaxation considers computational security, where the adversary is assumed to be computationally bounded, e.g., probabilistic polynomial time. In this setting, any circuit can be securely realized even when arbitrarily many parties are corrupted, as long as one is willing to sacrifice fairness and robustness.

IOS Press eBooksJan 1, 20130 citations

Realizing secure multiparty computation on incomplete networks

Vaya

International Conference on Security and CryptographyJan 1, 20100 citations

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation

Related papers

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation

Related papers