Filters








607 Hits in 4.2 sec

Dishonest Majority Multi-Party Computation for Binary Circuits [chapter]

Enrique Larraia, Emmanuela Orsini, Nigel P. Smart
2014 Lecture Notes in Computer Science  
We extend the Tiny-OT two party protocol of Nielsen et al (CRYPTO 2012) to the case of n parties in the dishonest majority setting.  ...  As a by product we obtain a more efficient manner of producing globally authenticated shares, in the random oracle model, which in turn leads to a more efficient two party protocol than that of Nielsen  ...  ] , and for n-party dishonest majority MPC over binary circuits [8] .  ... 
doi:10.1007/978-3-662-44381-1_28 fatcat:nmsve4zccfblvctcenwg5x5lza

Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol [chapter]

Ivan Damgård, Marcel Keller, Enrique Larraia, Christian Miles, Nigel P. Smart
2012 Lecture Notes in Computer Science  
We describe an implementation of the protocol of Damgård, Pastro, Smart and Zakarias (SPDZ/Speedz) for multi-party computation in the presence of a dishonest majority of active adversaries.  ...  As a bench mark application we present the evaluation of the AES cipher, a now standard bench marking example for multi-party computation.  ...  of dishonest majority.  ... 
doi:10.1007/978-3-642-32928-9_14 fatcat:u4rbz3eblfg25kuezlwg2ovoyi

Secure Multi-Party Proof and its Applications

Chunming Tang, Shuhong Gao
2010 Journal of Software Engineering and Applications  
We define a new type cryptographical model called secure multi-party proof that allows any t players and a verifier to securely compute a function ) ,..., ( 1 t x x f : each of the players learns nothing  ...  It is implemented by a protocol using oblivious transfer and Yao's scrambled circuit.  ...  Secure multi-party computation can be viewed as the task of carrying out a distributed computation, while protecting honest parties from the malicious manipulation of dishonest (or corrupted) parties.  ... 
doi:10.4236/jsea.2010.37081 fatcat:rkjuxlsgnzadlkqgoi6ahfdzjm

Round-Optimal Secure Multiparty Computation with Honest Majority [chapter]

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
2018 Lecture Notes in Computer Science  
We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal n-party protocols, tolerating any t < n 2 corruptions. 1.  ...  Security with abort: We give the first construction of two round MPC for general functions that achieves security with abort against malicious adversaries in the plain model.  ...  The second author would like to thank Ignacio Cascudo for helpful discussions.  ... 
doi:10.1007/978-3-319-96881-0_14 fatcat:6onhsimquzggniastap5bnweiq

An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation [chapter]

Ivan Damgård, Rasmus Lauritsen, Tomas Toft
2014 Lecture Notes in Computer Science  
Recent developments in Multi-party Computation (MPC) has resulted in very efficient protocols for dishonest majority in the preprocessing model.  ...  In particular, two very promising protocols for Boolean circuits have been proposed by Nielsen et al. (nicknamed TinyOT) and by Damgård and Zakarias (nicknamed MiniMac).  ...  Acknowledgements We would like to thank Nigel Smart, Stefan Tillich and their crew at Bristol for providing a selection of excellent circuits at http://www.cs.bris.ac.uk/ Research/CryptographySecurity/  ... 
doi:10.1007/978-3-319-10879-7_23 fatcat:n5uch7r2z5frpivvuqgikkjvzq

An architecture for practical actively secure MPC with dishonest majority

Marcel Keller, Peter Scholl, Nigel P. Smart
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
We present a runtime environment for executing secure programs via a multi-party computation protocol in the preprocessing model.  ...  A particularly novel aspect is that it automatically determines the minimum number of rounds needed for a computation, and uses this to minimize the overall cost of the computation.  ...  Introduction Recent years have seen great advances in practical variants of protocols for secure Multi Party Computation (MPC).  ... 
doi:10.1145/2508859.2516744 dblp:conf/ccs/KellerSS13 fatcat:r3dvfhkzfjcjdcemxftbwhc5jy

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ

Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
2019 Journal of Cryptology  
(the BMR protocol) and is the first version of that protocol that is concretely efficient for the dishonest majority case.  ...  In this paper, we present a constant-round multi-party secure computation protocol that is fully secure in the presence of malicious adversaries and for any number of corrupted parties.  ...  The existence of constant-round protocols for multi-party secure computation in the presence of a dishonest majority was proven later in [18, 27] .  ... 
doi:10.1007/s00145-019-09322-2 fatcat:lxeqssqwtbdpref5f4qxq4t2ui

More Efficient Constant-Round Multi-party Computation from BMR and SHE [chapter]

Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez
2016 Lecture Notes in Computer Science  
We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity.  ...  Additionally, we present a variant of our protocol which trades the depth of the garbling circuit (computed using SHE) for some more multiplications in the offline and online phases.  ...  Secure computation has been studied since the 1980s, and it has been shown that any functionality can be securely computed, even in the presence of a dishonest majority [35, 17] .  ... 
doi:10.1007/978-3-662-53641-4_21 fatcat:syycakbu7remhmxoo2npju4zzi

Private Speech Classification with Secure Multiparty Computation [article]

Kyle Bittner, Martine De Cock, Rafael Dowsley
2021 arXiv   pre-print
Our approach, which is based on Secure Multiparty Computation, allows to classify a speech signal of one party (Alice) with a deep neural network of another party (Bob) without Bob ever seeing Alice's  ...  In this paper we propose the first privacy-preserving solution for deep learning-based audio classification that is provably secure.  ...  Acknowledgements The authors would like to thank Marcel Keller for making the MP-SPDZ framework available, and for his assistance in the use of the framework.  ... 
arXiv:2007.00253v2 fatcat:rajekufeufbfjeiettm3gsscre

Secure Computation on the Web: Computing without Simultaneous Interaction [chapter]

Shai Halevi, Yehuda Lindell, Benny Pinkas
2011 Lecture Notes in Computer Science  
Amongst other things, even if some of the participants are corrupted the output is still correctly computed, and parties do not learn anything about each other's inputs except for that output.  ...  Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees.  ...  (In contrast, in the setting of multi-Hop homomorphic encryption if party i + 1 is dishonest then the adversary can evaluatef i .)  ... 
doi:10.1007/978-3-642-22792-9_8 fatcat:b2na3m7h2rhv7c6wjo24fbjkci

Efficient Constant Round Multi-party Computation Combining BMR and SPDZ [chapter]

Yehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai
2015 Lecture Notes in Computer Science  
(the BMR protocol), and is the first version of that protocol that is concretely efficient for the dishonest majority case.  ...  This requires a very large proof (of a circuit computing a pseduorandom generator) for every gate of the circuit.  ...  The existence of constant-round protocols for multiparty secure computation in the presence of a dishonest majority was proven later in [18, 27] .  ... 
doi:10.1007/978-3-662-48000-7_16 fatcat:3u4ajyjz4vhydgm2v2umvkhkxa

Page 10580 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
Comput. 151 (2004), no. 2, 483-490. Summary: “In the (¢,7) multi-secret sharing scheme, there are n participants in the system.  ...  One of the major research areas in XML security is XML Signature.  ... 

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables [chapter]

Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
2017 Lecture Notes in Computer Science  
We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party 'TinyTable' protocol of Damgård et al. (ePrint 2016).  ...  We also give a new method for efficiently implementing the preprocessing material required for the online phase using arithmetic circuits over characteristic two fields.  ...  Acknowledgements We are grateful to Carsten Baum, Nigel Smart and the anonymous reviewers for valuable feedback that helped to improve the paper.  ... 
doi:10.1007/978-3-319-61204-1_12 fatcat:3ikn3w53qrg5phriiqc7b65wgi

Salus

Seny Kamara, Payman Mohassel, Ben Riva
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
Early work on SFE-and the more general notion of multi-party computation (MPC)-focused on feasibility results; that is, demonstrating that every function can be computed securely [57, 58, 24, 10] .  ...  their computational resources available to the parties.  ...  Smart for providing us the AES circuit from [52] , and Peeter Laud for his valuable comments.  ... 
doi:10.1145/2382196.2382280 dblp:conf/ccs/KamaraMR12 fatcat:x3ilk5w7crhn3lbu5n7lsc4zcm

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza
2015 2015 IEEE Symposium on Security and Privacy  
In this work, we show how public parameters for a class of NIZKs can be generated by a multi-party protocol, such that if at least one of the parties is honest, then the result is secure (in both aforementioned  ...  senses) and can be subsequently used for generating and verifying numerous proofs without any further trust.  ...  When requiring security against dishonest majorities (with at least one honest party), implementations have a round complexity that depends linearly on the depth of the circuit being computed [61] -  ... 
doi:10.1109/sp.2015.25 dblp:conf/sp/Ben-SassonC0TV15 fatcat:lh2mmdyenjhexcmt3cytfwncfa
« Previous Showing results 1 — 15 out of 607 results