Filters








1,024 Hits in 3.6 sec

Efficient MPC with a Mixed Adversary

Martin Hirt, Marta Mularczyk, Daniel Wichs, Adam D. Smith, Yael Tauman Kalai
2020 Conference on Information-Theoretic Cryptography  
In this paper, we present a perfectly-secure MPC protocol for the mixed setting with essentially the same efficiency as the best MPC protocols for the active-only setting.  ...  The aforementioned upper bounds (t<n/3 and t<n/2) have been circumvented by considering mixed adversaries (Fitzi et al., Crypto' 98), i.e., adversaries that corrupt, at the same time, some parties actively  ...  Future Work An interesting direction for future work is to consider efficient protocols tolerating a mixed adversary in the cryptographic and in the statistically-secure setting (hence, with larger thresholds  ... 
doi:10.4230/lipics.itc.2020.3 dblp:conf/icits/HirtM20 fatcat:t3obgeftwvfcpj47is7kmmyoty

Efficient MPC with a mixed adversary

Martin Hirt, Marta Mularczyk, Yael Tauman Kalai, Adam D. Smith, Daniel Wichs
2020
In this paper, we present a perfectly-secure MPC protocol for the mixed setting with essentially the same efficiency as the best MPC protocols for the active-only setting.  ...  As a special case, this also results in the first fully-secure MPC protocol secure against any number of crashing parties, with optimal (i.e., linear in n) communication.  ...  Future Work An interesting direction for future work is to consider efficient protocols tolerating a mixed adversary in the cryptographic and in the statistically-secure setting (hence, with larger thresholds  ... 
doi:10.3929/ethz-b-000447697 fatcat:4d5ryvg7pjbefbspa4yir5pfl4

Graceful Degradation in Multi-Party Computation (Extended Abstract) [chapter]

Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub
2011 Lecture Notes in Computer Science  
The dishonesty of parties is typically modeled with a central adversary who corrupts parties.  ...  We focus on perfect security, and prove exact bounds for which MPC with graceful degradation of security and corruptions is possible for both threshold and general adversaries.  ...  The protocols are strict generalizations (and combinations) of hybrid-secure MPC and mixed adversaries.  ... 
doi:10.1007/978-3-642-20728-0_15 fatcat:3owrpabzsbgatcfqjn4vmsuaza

Secure multi-party computation made simple

Ueli Maurer
2006 Discrete Applied Mathematics  
This approach naturally yields protocols secure for mixed (active and passive) corruption and general (as opposed to threshold) adversary structures, confirming the previously proved tight bounds in a  ...  The purpose of this paper is to present a very simple approach to secure multi-party computation with straight-forward security proofs.  ...  Mixed general adversary structures Finally, general mixed adversary specifications were considered in [12] and the exact conditions for general secure MPC to be possible were given for a general mixed  ... 
doi:10.1016/j.dam.2005.03.020 fatcat:rhgxrbszrne4xmlod4cwid3hm4

Secure Multi-party Computation Made Simple [chapter]

Ueli Maurer
2003 Lecture Notes in Computer Science  
This approach naturally yields protocols secure for mixed (active and passive) corruption and general (as opposed to threshold) adversary structures, confirming the previously proved tight bounds in a  ...  The purpose of this paper is to present a very simple approach to secure multi-party computation with straight-forward security proofs.  ...  Mixed general adversary structures Finally, general mixed adversary specifications were considered in [12] and the exact conditions for general secure MPC to be possible were given for a general mixed  ... 
doi:10.1007/3-540-36413-7_2 fatcat:7umiln2scnaptd3d5xw6ho43ta

Is multiparty computation any good in practice?

Claudio Orlandi
2011 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
The aim of this paper is to present some of the recent progress in efficient secure multiparty computation (MPC). In MPC we have a set of parties owning a set of private inputs.  ...  The parties want to compute a function of their inputs, but they do not trust each other, therefore they need a cryptographic protocol to perform the computation in a way that 1) the output is correct  ...  Therefore, MPC protocols come with a proof of security, or reduction, to a simpler, well studied assumption.  ... 
doi:10.1109/icassp.2011.5947691 dblp:conf/icassp/Orlandi11 fatcat:a2cmm2bavra6hatgro5f4ea5du

On Multiplicative Linear Secret Sharing Schemes [chapter]

Ventzislav Nikov, Svetla Nikova, Bart Preneel
2003 Lecture Notes in Computer Science  
We prove that using two (different) MSPs to compute their resulting MSP is more efficient than building a multiplicative MSP.  ...  We show which conditions the resulting access structure should fulfill in order to achieve MPC secure against an adaptive, active adversary in the zero-error case in both the computational and the information-theoretic  ...  On the other hand we consider more grained mixed adversaries with Q 2 , (Q 3 ) adversary structure.  ... 
doi:10.1007/978-3-540-24582-7_10 fatcat:wgret6ywfvf55ki64qfo4mbcpa

AutoMPC: Efficient Multi-Party Computation for Secure and Privacy-Preserving Cooperative Control of Connected Autonomous Vehicles

Tao Li, Lei Lin, Siyuan Gong
2019 AAAI Conference on Artificial Intelligence  
In this paper, we propose a cooperative control strategy incorporating with efficient multi-party computation (MPC).  ...  In an effort to perform secure MPC without third-party authentication while reducing latency, we integrate a function secret sharing scheme with a distributed oblivious random access memory.  ...  The contributions lie in several ways: (i) security and privacy are guaranteed via a MPC scheme, without the presence of third-party authentication; (ii) the efficiency of the MPC is achieved by a distributed  ... 
dblp:conf/aaai/LiLG19 fatcat:dwtok4mg2vb4lkywl3skmqpg3y

Systematizing Secure Computation for Research and Decision Support [chapter]

Jason Perry, Debayan Gupta, Joan Feigenbaum, Rebecca N. Wright
2014 Lecture Notes in Computer Science  
Our systematization of secure computation consists of (1) a set of definitions circumscribing the MPC protocols to be considered; (2) a set of quantitative axes for classifying and comparing MPC protocols  ...  We propose a framework for organizing and classifying research results in the active field of secure multiparty computation (MPC).  ...  Any general MPC protocol with complete fairness against a malicious adversary must have at least three rounds.  ... 
doi:10.1007/978-3-319-10879-7_22 fatcat:mbmbehaxtnhipoktng5ffxpjvq

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme [chapter]

Ronald Cramer, Ivan Damgård, Ueli Maurer
2000 Lecture Notes in Computer Science  
from any LSSS a multiplicative LSSS for the same access structure, and 3) an efficient generic construction to build verifiability into every LSSS (always assuming that the adversary structure allows  ...  We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided  ...  MPC to SS that is efficient on all relevant adversary structures.  ... 
doi:10.1007/3-540-45539-6_22 fatcat:uew55bfjinhwfhpivzmeffqipq

Secure MPC: Laziness Leads to GOD [article]

Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai
2018 IACR Cryptology ePrint Archive  
against malicious adversaries or, more generally, mixed adversaries (which supports "honest but lazy" parties), assuming LWE. • Our MPC protocols simultaneously achieve security against the maximum number  ...  Such expanded ciphertexts can be homomorphically evaluated with respect to any circuit to generate a ciphertext ct.  ...  Aayush Jain was also partially supported by a Google PhD fellowship.  ... 
dblp:journals/iacr/BadrinarayananJ18 fatcat:72ojpxcpundu3ejdqx2palvrby

Multi-Party Computation with Omnipresent Adversary [chapter]

Hossein Ghodosi, Josef Pieprzyk
2009 Lecture Notes in Computer Science  
The omnipresent adversary can be either a passive, an active or a mixed one.  ...  Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario).  ...  So after elimination of Fitzi, Hirt, and Maurer [10] improved the classical results in unconditionally secure MPC by considering a mixed adversary.  ... 
doi:10.1007/978-3-642-00468-1_11 fatcat:3uqwsmnqkfbanmh54mdgy7eqkm

HoneyBadgerMPC and AsynchroMix: Practical AsynchronousMPC and its Application to Anonymous Communication [article]

Donghang Lu, Thomas Yurek, Samarth Kulshreshtha, Rahul Govind, Rahul Mahadev, Aniket Kate, Andrew K. Miller
2019 IACR Cryptology ePrint Archive  
To remedy this we propose a new MPC implementation, HoneyBadgerMPC, that combines a robust online phase with an optimistic offline phase that is efficient enough to run continuously alongside the online  ...  In a cloud-based distributed benchmark with 100 nodes, we demonstrate mixing a batch of 512 messages in around 20 seconds and up to 4096 messages in around two minutes.  ...  We show that this allows for messages to be mixed with a lower latency than we could otherwise achieve, with larger mixes being available to servers with more computational power.  ... 
dblp:journals/iacr/LuYKGMKM19 fatcat:fkrpynqjpzdpxjum2koipsg2sm

Towards Provably-Secure Scalable Anonymous Broadcast

Mahdi Zamani, Jared Saia, Mahnush Movahedi, Joud S. Khoury
2013 USENIX Security Symposium  
We assume up to a one third fraction of the parties is controlled by a static Byzantine adversary.  ...  Similar to the dining cryptographers networks (DC-NETS), our algorithm uses secure multi-party computation (MPC) to ensure anonymity.  ...  The authors would also like to thank Josh Karlin from Google for making a valuable contribution to the discussions and for his supportive comments.  ... 
dblp:conf/uss/ZamaniSMK13 fatcat:iq36gwnoajgixorgoxf6dirmsq

Secure Multi-party Quantum Computation with a Dishonest Majority [chapter]

Yfke Dulek, Alex B. Grilo, Stacey Jeffery, Christian Majenz, Christian Schaffner
2020 Lecture Notes in Computer Science  
To achieve efficiency, we develop a novel public verification protocol for the Clifford authentication code, and a testing protocol for magic-state inputs, both using classical multi-party computation.  ...  Even in the extreme case where a computation is performed between k mutually distrustful players, and security is required even for the single honest player if all other players are colluding adversaries  ...  adversary) such that for all environments E, a 1 . 1 MPC sends E to player i, removing it from the state register S. 2.  ... 
doi:10.1007/978-3-030-45727-3_25 fatcat:v6l5xygcq5e2fpgmpnpagaizza
« Previous Showing results 1 — 15 out of 1,024 results