Filters








71 Hits in 6.2 sec

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings [chapter]

Ivan Damgård, Claudio Orlandi, Mark Simkin
2018 Lecture Notes in Computer Science  
Our compiler leads to a very efficient MPC protocols for the important case of secure evaluation of arithmetic circuits over arbitrary rings (e.g., the natural case of Z 2 ) for small number of parties  ...  We present a very simple yet very powerful idea for turning any passively secure MPC protocol into an actively secure one, at the price of reducing the threshold of tolerated corruptions.  ...  Efficient Three-Party Computation Over Rings To illustrate the potential of our compiler from Section 3, we provide a protocol for secure three-party computation over arbitrary rings Z m that is secure  ... 
doi:10.1007/978-3-319-96881-0_27 fatcat:isgnmjtgbnedzk3pdonx56lahi

Efficient Multiparty Protocols via Log-Depth Threshold Formulae [chapter]

Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013 Lecture Notes in Computer Science  
Recursively compose π with itself to obtain an efficient n-party protocol which achieves security against a constant fraction of corrupted parties.  ...  We put forward a new approach for the design of efficient multiparty protocols: 1.  ...  MPC over rings and k-linear maps. The work of Cramer et al. [CFIK03] shows how to efficiently implement secure MPC over blackbox rings.  ... 
doi:10.1007/978-3-642-40084-1_11 fatcat:a7lwyvx6d5a2xbujlmoe6b7npe

Secure Arithmetic Computation with No Honest Majority [chapter]

Yuval Ishai, Manoj Prabhakaran, Amit Sahai
2009 Lecture Notes in Computer Science  
These include: -An unconditionally secure protocol in the OT-hybrid model which makes a black-box use of an arbitrary ring R, but where the number of ring operations grows linearly with (an upper bound  ...  We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks.  ...  We thank Jens Groth, Venkatesan Guruswami, Farzad Parvaresh, Oded Regev, and Ronny Roth for helpful discussions.  ... 
doi:10.1007/978-3-642-00457-5_18 fatcat:njbxeax5xrfsdpnmikxxbwexc4

Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security

Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, Mark Simkin, Daniel Wichs, Yael Tauman Kalai, Adam D. Smith
2020 Conference on Information-Theoretic Cryptography  
This paper focuses on the specific case of actively secure three-party computation with an honest majority.  ...  In particular, we are interested in solutions which allow to evaluate arithmetic circuits over real-world CPU word sizes, like 32- and 64-bit words.  ...  Moreover, novel techniques for honest-majority MPC over rings have very recently been deployed in [1] .  ... 
doi:10.4230/lipics.itc.2020.5 dblp:conf/icits/EeriksonKOPP020 fatcat:fpk766fhjzfnpn7s2q2ngcsq5q

Secure Evaluation of Quantized Neural Networks [article]

Anders Dalskov and Daniel Escudero and Marcel Keller
2019 arXiv   pre-print
The most efficient inference can be performed using a passive honest majority protocol which takes between 0.9 and 25.8 seconds, depending on the size of the model; for active security and an honest majority  ...  In particular, we provide a comprehensive comparison between running secure inference of large ImageNet models with active and passive security, as well as honest and dishonest majority.  ...  We thank Adrià Gascón for fruitful discussions, and also NEC and BIU members, especially Prof. Benny Pinkas and Prof. Yehuda Lindell for very useful comments on this work.  ... 
arXiv:1910.12435v1 fatcat:i5jxhze7zvgqjmel4rq4i6dljm

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation [article]

Siddharth Garg, Zahra Ghodsi, Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
2018 arXiv   pre-print
Recent works on the problem have mainly focused on passively secure protocols, whose security holds against passive ('semi-honest') parties but may completely break down in the presence of active ('malicious  ...  In this work, we propose an actively secure protocol for outsourcing secure and private machine learning computations.  ...  [IPS08] , which provides a general paradigm to design secure computation protocol combining the following two ingredients: (1) an active MPC protocol for the underlying function f in the honest majority  ... 
arXiv:1812.01372v1 fatcat:tdxijdfz2vei3hefs2lolyubyq

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $$\mathbb {Z}/p^k\mathbb {Z} $$ [chapter]

Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
2020 Lecture Notes in Computer Science  
For passive and active security with abort, our protocols communicate O(n) bits per multiplication.  ...  We study information-theoretic multiparty computation (MPC) protocols over rings Z/p k Z that have good asymptotic communication complexity for a large number of players.  ...  The authors thank Gabriele Spini for helpful discussions in the early stages of this research project.  ... 
doi:10.1007/978-3-030-64840-4_6 fatcat:hq6twvyp65g7pkkm72p47j6ohe

Secure Arithmetic Computation with No Honest Majority [article]

Yuval Ishai, Manoj Prabhakaran, Amit Sahai
2008 arXiv   pre-print
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks.  ...  When m is prime, the (amortized) number of calls to the encryption scheme for each gate of the circuit is constant.  ...  We thank Jens Groth, Farzad Parvaresh, Oded Regev, and Ronny Roth for helpful discussions.  ... 
arXiv:0811.0475v3 fatcat:4jjh2trvqvdutll35lb7cnd44i

Computer-aided proofs for multiparty computation with active security [article]

Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
2018 arXiv   pre-print
For the active case we provide a new NI definition, which we call input independence.  ...  Here we show for the first time that it can also be used to prove security of MPC against a malicious adversary.  ...  ACKNOWLEDGEMENTS Gilles Barthe showed us how non-interference can be used in the context of MPC for a passive adversary. Ivan Damgård helped us to understand MPC protocols and their security proofs.  ... 
arXiv:1806.07197v1 fatcat:lyvuiam43vgi7oibcbed2suova

Between a Rock and a Hard Place: Interpolating between MPC and FHE [chapter]

Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
2013 Lecture Notes in Computer Science  
The key contribution is that our presented protocol is highly communication efficient enabling us to obtain reduced communication when compared to traditional MPC protocols for relatively small values  ...  Thus one can trade communication for computation in a simple way. Our protocol is based on an interactive protocol for "bootstrapping" a somewhat homomorphic encryption (SHE) scheme.  ...  The second author was supported by an Trend Micro Ltd, and the fifth author was supported by in part by a Royal Society Wolfson Merit Award.  ... 
doi:10.1007/978-3-642-42045-0_12 fatcat:2fkf2m7cinbgnhsmilbldcajre

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Christian Mouchet, Juan Troncoso-Pastoriza, Jean-Philippe Bossuat, Jean-Pierre Hubaux
2021 Proceedings on Privacy Enhancing Technologies  
We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE).  ...  To support our solution, we introduce a multiparty version of the Brakerski-Fan-Vercauteren homomorphic cryptosystem and implement it in an open-source library.  ...  Acknowledgments The authors would like to thank Henry Corrigan-Gibbs and our shepherd, Peeter Laud, for their valuable reviews and comments.  ... 
doi:10.2478/popets-2021-0071 fatcat:wcfbzz5tznaazmj3vfle3rxjwu

SPD$$\mathbb {Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for Dishonest Majority [chapter]

Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
2018 Lecture Notes in Computer Science  
We apply this to construct an MPC protocol for dishonest majority in the preprocessing model that has efficiency comparable to the well-known SPDZ protocol (Damgård et al., CRYPTO 2012), with operations  ...  In the more natural setting of integer computations modulo 2 k , which are useful for simplifying implementations and applications, no solutions with active security are known unless the majority of the  ...  Cramer et al. showed how to contruct actively secure MPC over black-box rings [5] using secret-sharing techniques for honest majority, but this is only a feasibility result and the concrete efficiency  ... 
doi:10.1007/978-3-319-96881-0_26 fatcat:gwnxc5p76fgu5lfrizfuvoomly

PrivFair: a Library for Privacy-Preserving Fairness Auditing [article]

Sikha Pentyala, David Melanson, Martine De Cock, Golnoosh Farnadi
2022 arXiv   pre-print
We demonstrate the use of PrivFair for group fairness auditing with tabular data or image data, without requiring the investigator to disclose their data to anyone in an unencrypted manner, or the model  ...  Through the use of Secure Multiparty Computation (MPC), PrivFair protects the confidentiality of the model under audit and the sensitive data used for the audit, hence it supports scenarios in which a  ...  Acknowledgements Funding support for project activities has been partially provided by The University of Washington Tacoma's Founders Endowment fund, Canada CIFAR AI Chair, Facebook Research Award for  ... 
arXiv:2202.04058v2 fatcat:ovwbv3faqfhwfkkvm7f2njilsi

Secure training of decision trees with continuous attributes

Mark Abspoel, Daniel Escudero, Nikolaj Volgushev
2021 Proceedings on Privacy Enhancing Technologies  
We implement our algorithm in the MP-SPDZ framework and benchmark our implementation for both passive and active three-party computation using arithmetic modulo 264.  ...  Our starting point is to apply an existing generic MPC protocol to a standard decision tree learning algorithm, which we then optimize in several ways.  ...  We thank Paul Koster for helpful discussions throughout the project and for providing us with a practical application to benchmark our results.  ... 
doi:10.2478/popets-2021-0010 fatcat:bxsmhqtsyzgf3duios5vq7jfqa

Secure Multiparty Computation and Trusted Hardware: Examining Adoption Challenges and Opportunities

Joseph I. Choi, Kevin R. B. Butler
2019 Security and Communication Networks  
This paper revisits the history of improvements to SMC over the years and considers the possibility of coupling trusted hardware with SMC.  ...  Trusted execution environments (TEEs) provide hardware-enforced isolation of code and data in use, making them promising candidates for making SMC more tractable.  ...  Acknowledgments Special thanks are due to Patrick Traynor and Thomas Shrimpton for their interest in and constructive criticisms of this work.  ... 
doi:10.1155/2019/1368905 fatcat:izynm6msrvehfa3ghkw7tykk34
« Previous Showing results 1 — 15 out of 71 results