Fetching the paper…
Reading the bibliography…
Machine learning has started to be deployed in fields such as healthcare and finance, which propelled the need for and growth of privacy-preserving machine learning (PPML).
D. Harrison and D. L. Rubinfeld, “Hedonic housing prices and the demand for clean air,” Journal of Environmental Economics and Management , 1978. [Online]. Available: http://www.sciencedirect.com/science/article/pii/0095069678900062
1978
Earlier work this paper cites.
D. Beaver, “Efficient Multiparty Protocols Using Circuit Randomization,” in CRYPTO , 1991
1991
Earlier work this paper cites.
D. Beaver, “Precomputing Oblivious Transfer,” in CRYPTO , 1995
1995
Earlier work this paper cites.
R. G. Andrzejak, K. Lehnertz, F. Mormann, C. Rieke, P. David, and C. Elger, “Indications of nonlinear deterministic and finite-dimensional structures in time series of brain electrical activity: Dependence on recording region and brain state,” Physical review. E, Statistical, nonlinear, and soft matter physics , 2002
2002
Earlier work this paper cites.
Z. Beerliová-Trubíniová and M. Hirt, “Efficient Multi-party Computation with Dispute Control,” in TCC , 2006
2006
Earlier work this paper cites.
M. Geisler, “Viff: Virtual ideal functionality framework,” 2007
2007
Earlier work this paper cites.
D. Bogdanov, S. Laur, and J. Willemson, “Sharemind: A framework for fast privacy-preserving computations,” in ESORICS , 2008
2008
Earlier work this paper cites.
Z. Beerliová-Trubíniová and M. Hirt, “Perfectly-Secure MPC with Linear Communication Complexity,” in TCC , 2008
2008
Earlier work this paper cites.
V. Kolesnikov and T. Schneider, “Improved Garbled Circuit: Free XOR Gates and Applications,” in ICALP , 2008
2008
Earlier work this paper cites.
B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams, “Secure two-party computation is practical,” in ASIACRYPT , 2009
2009
Earlier work this paper cites.
W. Henecka, S. Kögl, A. Sadeghi, T. Schneider, and I. Wehrenberg, “TASTY: tool for automating secure two-party computations,” in ACMCCS , 2010
2010
Earlier work this paper cites.
Y. LeCun and C. Cortes, “MNIST handwritten digit database,” 2010. [Online]. Available: http://yann.lecun.com/exdb/mnist/
2010
Earlier work this paper cites.
C. Orlandi, “Is multiparty computation any good in practice?” in IEEE ICASSP , 2011
2011
Earlier work this paper cites.
D. Bogdanov, R. Talviste, and J. Willemson, “Deploying Secure Multi-Party Computation for Financial Data Analysis,” in FC , 2012
2012
Earlier work this paper cites.
E. Ben-Sasson, S. Fehr, and R. Ostrovsky, “Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority,” in CRYPTO , 2012
2012
Earlier work this paper cites.
I. Damgrd, V. Pastro, N. P. Smart, and S. Zakarias, “Multiparty Computation from Somewhat Homomorphic Encryption,” in CRYPTO , 2012
2012
Earlier work this paper cites.
M. Bellare, V. T. Hoang, and P. Rogaway, “Foundations of Garbled Circuits,” in ACM CCS , 2012
2012
Earlier work this paper cites.
I. Damgrd, M. Keller, E. Larraia, V. Pastro, P. Scholl, and N. P. Smart, “Practical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits,” in ESORICS , 2013
2013
Earlier work this paper cites.
M. Keller, P. Scholl, and N. P. Smart, “An architecture for practical actively secure MPC with dishonest majority,” in ACM CCS , 2013
2013
Earlier work this paper cites.
M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway, “Efficient Garbling from a Fixed-Key Blockcipher,” in IEEE S&P , 2013
2013
Earlier work this paper cites.
J. Launchbury, D. Archer, T. DuBuisson, and E. Mertens, “Application-scale secure multiparty computation,” in ESOP , 2014
2014
Cited alongside, same era.
V. Kolesnikov, P. Mohassel, and M. Rosulek, “Flexor: Flexible garbling for XOR gates that beats free-xor,” in CRYPTO , 2014
2014
Cited alongside, same era.
P. Mohassel, M. Rosulek, and Y. Zhang, “Fast and Secure Three-party Computation: Garbled Circuit Approach,” in CCS , 2015
2015
Cited alongside, same era.
Y. Ishai, R. Kumaresan, E. Kushilevitz, and A. Paskin-Cherniavsky, “Secure computation with minimal interaction, revisited,” in CRYPTO , 2015
2015
Cited alongside, same era.
D. Bogdanov, L. Kamm, B. Kubo, R. Rebane, V. Sokk, and R. Talviste, “Students and taxes: a privacy-preserving social study using secure computation,” IACR Cryptology ePrint Archive , 2015
2015
Cited alongside, same era.
H. Darwood, “Epicurious - recipes with rating and nutrition,” 2017. [Online]. Available: https://www.kaggle.com/hugodarwood/epirecipes/
2017
Later among the works it cites.
E. Makri, D. Rotaru, N. P. Smart, and F. Vercauteren, “EPIC: efficient private image classification (or: Learning from the masters),” CT-RSA , 2018
2018
Later among the works it cites.
M. S. Riazi, C. Weinert, O. Tkachenko, E. M. Songhori, T. Schneider, and F. Koushanfar, “Chameleon: A hybrid secure computation framework for machine learning applications,” in AsiaCCS , 2018
2018
Later among the works it cites.
P. Mohassel and P. Rindal, “ABY 3 {}^{\mbox{3}} : A Mixed Protocol Framework for Machine Learning,” in ACM CCS , 2018
2018
Later among the works it cites.
S. Wagh, D. Gupta, and N. Chandran, “SecureNN: Efficient and private neural network training,” IACR Cryptology ePrint Archive , vol. 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Zahur, M. Rosulek, and D. Evans, “Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates,” in EUROCRYPT , 2015
2015
Cited alongside, same era.
S. Gueron, Y. Lindell, A. Nof, and B. Pinkas, “Fast Garbling of Circuits Under Standard Assumptions,” in ACM CCS , 2015
2015
Cited alongside, same era.
T. Araki, J. Furukawa, Y. Lindell, A. Nof, and K. Ohara, “High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority,” in ACM CCS , 2016
2016
Cited alongside, same era.
M. Keller, E. Orsini, and P. Scholl, “MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer,” in ACM CCS , 2016
2016
Cited alongside, same era.
C. Baum, I. Damgrd, T. Toft, and R. W. Zakarias, “Better preprocessing for secure multiparty computation,” in ACNS , 2016
2016
Cited alongside, same era.
A. Madani, R. Arnaout, M. Mofrad, and R. Arnaout, “Fast and accurate classification of echocardiograms using deep learning,” CoRR , 2017
2017
Cited alongside, same era.
P. Mohassel and Y. Zhang, “SecureML: A system for scalable privacy-preserving machine learning,” in IEEE S&P , 2017
2017
Cited alongside, same era.
2018
Later among the works it cites.
D. W. Archer, D. Bogdanov, Y. Lindell, L. Kamm, K. Nielsen, J. I. Pagter, N. P. Smart, and R. N. Wright, “From keys to databases - real-world applications of secure multi-party computation,” Comput. J. , 2018
2018
Later among the works it cites.
K. Chida, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell, and A. Nof, “Fast large-scale honest-majority MPC for malicious adversaries,” in CRYPTO , 2018
2018
Later among the works it cites.
P. S. Nordholt and M. Veeningen, “Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification,” in ACNS , 2018
2018
Later among the works it cites.
A. Patra and D. Ravi, “On the exact round complexity of secure three-party computation,” CRYPTO , 2018
2018
Later among the works it cites.
M. Byali, A. Joseph, A. Patra, and D. Ravi, “Fast secure computation for small population over the internet,” ACM CCS , 2018
2018
Later among the works it cites.
S. D. Gordon, S. Ranellucci, and X. Wang, “Secure computation with low communication from cross-checking,” in ASIACRYPT , 2018
2018
Later among the works it cites.
I. Damgrd, C. Orlandi, and M. Simkin, “Yet another compiler for active security or: Efficient MPC over arbitrary rings,” CRYPTO , 2018
2018
Later among the works it cites.
R. Cramer, I. Damgrd, D. Escudero, P. Scholl, and C. Xing, “SPDZ2k: Efficient MPC mod 2ˆk for Dishonest Majority,” CRYPTO , 2018
2018
Later among the works it cites.
M. Keller, V. Pastro, and D. Rotaru, “Overdrive: Making SPDZ great again,” in EUROCRYPT , 2018
2018
Later among the works it cites.
N. Büscher, D. Demmler, S. Katzenbeisser, D. Kretzmer, and T. Schneider, “Hycc: Compilation of hybrid protocols for practical secure computation,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018 , 2018
2018
Later among the works it cites.
H. Chaudhari, A. Choudhury, A. Patra, and A. Suresh, “ASTRA: High-throughput 3PC over Rings with Application to Secure Prediction,” in IACR Cryptology ePrint Archive , 2019
2019
Closest in time.
B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai, “Spot-light: Lightweight private set intersection from sparse OT extension,” in CRYPTO , 2019
2019
Closest in time.
2019
Closest in time.