Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning
暂无分享,去创建一个
[1] Ramy Arnaout,et al. Fast and accurate classification of echocardiograms using deep learning , 2017, ArXiv.
[2] Benny Pinkas,et al. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension , 2019, IACR Cryptol. ePrint Arch..
[3] Martin Hirt,et al. Perfectly-Secure MPC with Linear Communication Complexity , 2008, TCC.
[4] Ivan Damgård,et al. Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings , 2018, IACR Cryptol. ePrint Arch..
[5] Ye Zhang,et al. Fast and Secure Three-party Computation: The Garbled Circuit Approach , 2015, IACR Cryptol. ePrint Arch..
[6] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[7] David Evans,et al. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates , 2015, EUROCRYPT.
[8] Martin Hirt,et al. Efficient Multi-party Computation with Dispute Control , 2006, TCC.
[9] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[10] Yehuda Lindell,et al. From Keys to Databases - Real-World Applications of Secure Multi-Party Computation , 2018, IACR Cryptol. ePrint Arch..
[11] Ramy Arnaout,et al. Fast and accurate view classification of echocardiograms using deep learning , 2018, npj Digital Medicine.
[12] Vladimir Kolesnikov,et al. FleXOR: Flexible garbling for XOR gates that beats free-XOR , 2014, IACR Cryptol. ePrint Arch..
[13] Mihir Bellare,et al. Efficient Garbling from a Fixed-Key Blockcipher , 2013, 2013 IEEE Symposium on Security and Privacy.
[14] Mohammad Anagreh,et al. Yet Another Compiler for Active Security or : Efficient MPC Over Arbitrary Rings , 2017 .
[15] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[16] D. Rubinfeld,et al. Hedonic housing prices and the demand for clean air , 1978 .
[17] Ivan Damgård,et al. Better Preprocessing for Secure Multiparty Computation , 2016, ACNS.
[18] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[19] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.
[20] Yehuda Lindell,et al. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority , 2016, IACR Cryptol. ePrint Arch..
[21] Dan Bogdanov,et al. Students and Taxes: a Privacy-Preserving Social Study Using Secure Computation , 2015, IACR Cryptol. ePrint Arch..
[22] Ashish Choudhury,et al. An Efficient Framework for Unconditionally Secure Multiparty Computation , 2017, IEEE Transactions on Information Theory.
[23] Marcel Keller,et al. An architecture for practical actively secure MPC with dishonest majority , 2013, IACR Cryptol. ePrint Arch..
[24] Yehuda Lindell,et al. Fast Garbling of Circuits Under Standard Assumptions , 2015, Journal of Cryptology.
[25] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[26] Xiao Wang,et al. Secure Computation with Low Communication from Cross-checking , 2018, IACR Cryptol. ePrint Arch..
[27] Marcel Keller,et al. Overdrive: Making SPDZ Great Again , 2018, IACR Cryptol. ePrint Arch..
[28] Dan Bogdanov,et al. Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper) , 2012, Financial Cryptography.
[29] Stefan Katzenbeisser,et al. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation , 2018, CCS.
[30] K Lehnertz,et al. Indications of nonlinear deterministic and finite-dimensional structures in time series of brain electrical activity: dependence on recording region and brain state. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[31] Farinaz Koushanfar,et al. Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications , 2018, IACR Cryptol. ePrint Arch..
[32] Yehuda Lindell,et al. A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority , 2017, IACR Cryptol. ePrint Arch..
[33] Frederik Vercauteren,et al. EPIC: Efficient Private Image Classification (or: Learning from the Masters) , 2019, CT-RSA.
[34] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.
[35] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.
[36] Peter Sebastian Nordholt,et al. Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification , 2018, IACR Cryptol. ePrint Arch..
[37] Arun Joseph,et al. Fast Secure Computation for Small Population over the Internet , 2018, IACR Cryptol. ePrint Arch..
[38] Peter Rindal,et al. ABY3: A Mixed Protocol Framework for Machine Learning , 2018, IACR Cryptol. ePrint Arch..
[39] Yehuda Lindell,et al. High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority , 2017, IACR Cryptol. ePrint Arch..
[40] Marcel Keller,et al. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer , 2016, IACR Cryptol. ePrint Arch..
[41] Ashish Choudhury,et al. ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction , 2019, IACR Cryptol. ePrint Arch..
[42] Arpita Patra,et al. On the Exact Round Complexity of Secure Three-Party Computation , 2018, Journal of Cryptology.
[43] Daniel E. Escudero,et al. SPDℤ 2 k : Efficient MPC mod 2 k for Dishonest Majority. , 2018 .
[44] Sameer Wagh,et al. SecureNN: Efficient and Private Neural Network Training , 2018, IACR Cryptol. ePrint Arch..
[45] Payman Mohassel,et al. SecureML: A System for Scalable Privacy-Preserving Machine Learning , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[46] Marcel Keller,et al. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits , 2013, ESORICS.
[47] Yehuda Lindell,et al. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries , 2018, Journal of Cryptology.
[48] Claudio Orlandi,et al. Is multiparty computation any good in practice? , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[49] John Launchbury,et al. Application-Scale Secure Multiparty Computation , 2014, ESOP.
[50] Yehuda Lindell,et al. Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[51] Anat Paskin-Cherniavsky,et al. Secure Computation with Minimal Interaction, Revisited , 2015, CRYPTO.