Private Evaluation of Decision Trees using Sublinear Cost

[1] A. Aly and M. V. Vyve. Securely solving classical network flow problems. In ICISC, pages 205–221, 2014.10.1007/978-3-319-15943-0_13Search in Google Scholar

[2] G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer and extensions for faster secure computation. In CCS, pages 535–548, New York, NY, USA, 2013. ACM.10.1145/2508859.2516738Search in Google Scholar

[3] G. Asharov, Y. Lindell, T. Schneider, and M. Zohner. More efficient oblivious transfer extensions. J. Cryptology, 30(3):805–858, 2017.10.1007/s00145-016-9236-6Search in Google Scholar

[4] M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, and T. Schneider. Secure evaluation of private linear branching programs with medical applications. In ESORICS, pages 424–439, Berlin, Heidelberg, 2009. Springer-Verlag.10.1007/978-3-642-04444-1_26Search in Google Scholar

[5] D. Beaver. Commodity-based cryptography (extended abstract). In STOC, pages 446–455, New York, NY, USA, 1997. ACM.10.1145/258533.258637Search in Google Scholar

[6] M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway. Efficient garbling from a fixed-key blockcipher. In SP, pages 478–492, Washington, DC, USA, 2013. IEEE Computer Society.10.1109/SP.2013.39Search in Google Scholar

[7] A. Ben-David, N. Nisan, and B. Pinkas. Fairplaymp: A system for secure multi-party computation. In CCS, pages 257–266, New York, NY, USA, 2008. ACM.10.1145/1455770.1455804Search in Google Scholar

[8] M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC, pages 1–10, 1988.10.1145/62212.62213Search in Google Scholar

[9] M. Blanton, A. Steele, and M. Alisagari. Data-oblivious graph algorithms for secure computation and outsourcing. In ASIACCS, pages 207–218, 2013.10.1145/2484313.2484341Search in Google Scholar

[10] D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS, pages 192–206, 2008.10.1007/978-3-540-88313-5_13Search in Google Scholar

[11] R. Bost, R. A. Popa, S. Tu, and S. Goldwasser. Machine learning classification over encrypted data. In NDSS, 2015.10.14722/ndss.2015.23241Search in Google Scholar

[12] J. Brickell, D. E. Porter, V. Shmatikov, and E. Witchel. Privacy-preserving remote diagnostics. In CCS, pages 498–507, New York, NY, USA, 2007. ACM.10.1145/1315245.1315307Search in Google Scholar

[13] S. S. Burra, E. Larraia, J. B. Nielsen, P. S. Nordholt, C. Orlandi, E. Orsini, P. Scholl, and N. P. Smart. High performance multi-party computation for binary circuits based on oblivious transfer. IACR Cryptology ePrint Archive, 2015:472, 2015.Search in Google Scholar

[14] J. Catlett. Overpruning large decision trees. In IJCAI, pages 764–769, San Francisco, CA, USA, 1991. Morgan Kaufmann Publishers Inc.Search in Google Scholar

[15] D. Chaum, C. Crépeau, and I. Damgard. Multiparty unconditionally secure protocols. In STOC, pages 11–19, 1988.10.1145/62212.62214Search in Google Scholar

[16] M. D. Cock, R. Dowsley, C. Horst, R. Katti, A. C. A. Nascimento, S. C. Newman, and W. Poon. Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation. IACR Cryptology ePrint Archive, 2016:736, 2016.Search in Google Scholar

[17] R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In EURO-CRYPT, pages 280–299, 2001.10.1007/3-540-44987-6_18Search in Google Scholar

[18] I. Damgård, M. Geisler, and M. Krøigaard. Efficient and secure comparison for on-line auctions. In ACISP, pages 416–430, 2007.10.1007/978-3-540-73458-1_30Search in Google Scholar

[19] I. Damgård, M. Geisler, M. Krøigaard, and J. B. Nielsen. Asynchronous multiparty computation: Theory and implementation. In PKC, pages 160–179, 2009.10.1007/978-3-642-00468-1_10Search in Google Scholar

[20] I. Damgård, 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, pages 1–18, 2013.10.1007/978-3-642-40203-6_1Search in Google Scholar

[21] I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias. Multi-party computation from somewhat homomorphic encryption. In CRYPTO, pages 643–662, 2012.10.1007/978-3-642-32009-5_38Search in Google Scholar

[22] I. Damgård and R. Thorbek. Efficient conversion of secret-shared values between different fields. IACR Cryptology ePrint Archive, 2008:221, 2008.Search in Google Scholar

[23] D. Demmler, T. Schneider, and M. Zohner. ABY - A framework for efficient mixed-protocol secure two-party computation. In NDSS, 2015.10.14722/ndss.2015.23113Search in Google Scholar

[24] J. Doerner and A. Shelat. Scaling oram for secure computation. In CCS, pages 523–535, 2017.10.1145/3133956.3133967Search in Google Scholar

[25] Y. Ejgenberg, M. Farbstein, M. Levy, and Y. Lindell. SCAPI: the secure computation application programming interface. IACR Cryptology ePrint Archive, 2012:629, 2012.Search in Google Scholar

[26] M. Franz, A. Holzer, S. Katzenbeisser, C. Schallhart, and H. Veith. CBMC-GC: an ANSI C compiler for secure two-party computations. In CC ‘14, pages 244–249, 2014.10.1007/978-3-642-54807-9_15Search in Google Scholar

[27] M. Fredrikson, S. Jha, and T. Ristenpart. Model inversion attacks that exploit confidence information and basic countermeasures. In CCS, pages 1322–1333, 2015.10.1145/2810103.2813677Search in Google Scholar

[28] O. Goldreich. Towards a theory of software protection and simulation by oblivious rams. In STOC, pages 182–194, New York, NY, USA, 1987. ACM.10.1145/28395.28416Search in Google Scholar

[29] O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York, NY, USA, 2004.Search in Google Scholar

[30] O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431–473, May 1996.10.1145/233551.233553Search in Google Scholar

[31] S. D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, and Y. Vahlis. Secure two-party computation in sublinear (amortized) time. In CCS, pages 513–524, 2012.10.1145/2382196.2382251Search in Google Scholar

[32] T. Graepel, K. Lauter, and M. Naehrig. Ml confidential: Machine learning on encrypted data. In Proceedings of the 15th International Conference on Information Security and Cryptology, ICISC’12, pages 1–21, Berlin, Heidelberg, 2013. Springer-Verlag.10.1007/978-3-642-37682-5_1Search in Google Scholar

[33] C. Hazay and Y. Lindell. Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer-Verlag New York, Inc., New York, NY, USA, 1st edition, 2010.10.1007/978-3-642-14303-8Search in Google Scholar

[34] W. Henecka, S. Kögl, A. Sadeghi, T. Schneider, and I. Wehrenberg. TASTY: tool for automating secure two-party computations. In CCS, pages 451–462, 2010.10.1145/1866307.1866358Search in Google Scholar

[35] E. Hesamifard, H. Takabi, M. Ghasemi, and C. Jones. Privacy-preserving machine learning in cloud. In Proceedings of the 2017 on Cloud Computing Security Workshop, CCSW ‘17, pages 39–43, New York, NY, USA, 2017. ACM.10.1145/3140649.3140655Search in Google Scholar

[36] Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO, pages 145–161, 2003.10.1007/978-3-540-45146-4_9Search in Google Scholar

[37] A. Jarrous and B. Pinkas. Secure hamming distance based computation and its applications. In ACNS, pages 107–124, 2009.10.1007/978-3-642-01957-9_7Search in Google Scholar

[38] M. Keller, E. Orsini, and P. Scholl. Actively secure OT extension with optimal overhead. In CRYPTO, pages 724–741, 2015.10.1007/978-3-662-47989-6_35Search in Google Scholar

[39] M. Keller, E. Orsini, and P. Scholl. Mascot: Faster malicious arithmetic secure computation with oblivious transfer. In CCS, pages 830–842, 2016.10.1145/2976749.2978357Search in Google Scholar

[40] M. Keller and P. Scholl. Efficient, oblivious data structures for MPC. In ASIACRYPT, pages 506–525, 2014.10.1007/978-3-662-45608-8_27Search in Google Scholar

[41] V. Kolesnikov and R. Kumaresan. Improved OT extension for transferring short secrets. In CRYPTO, pages 54–70. Springer, 2013.10.1007/978-3-642-40084-1_4Search in Google Scholar

[42] V. Kolesnikov, A. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS, pages 1–20, 2009.10.1007/978-3-642-10433-6_1Search in Google Scholar

[43] V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP, pages 486–498, 2008.10.1007/978-3-540-70583-3_40Search in Google Scholar

[44] V. Kolesnikov and T. Schneider. A practical universal circuit construction and secure evaluation of private functions. In FC, pages 83–97, 2008.10.1007/978-3-540-85230-8_7Search in Google Scholar

[45] Y. Lindell and B. Pinkas. Privacy preserving data mining. In CRYPTO, volume 1880, pages 36–54, Berlin and New York, 2000. Springer.10.1007/3-540-44598-6_3Search in Google Scholar

[46] Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177–206, 2002.10.1007/s00145-001-0019-2Search in Google Scholar

[47] Y. Lindell and B. Pinkas. Secure multiparty computation for privacy-preserving data mining. IACR Cryptology ePrint Archive, 2008:197, 2008.10.29012/jpc.v1i1.566Search in Google Scholar

[48] Y. Lindell and B. Pinkas. A proof of security of yao’s protocol for two-party computation. J. Cryptol., 22(2):161–188, Apr. 2009.10.1007/s00145-008-9036-8Search in Google Scholar

[49] C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi. Oblivm: A programming framework for secure computation. In SP, pages 359–376, 2015.10.1109/SP.2015.29Search in Google Scholar

[50] D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay— a secure two-party computation system. In SSYM, pages 20–20, Berkeley, CA, USA, 2004. USENIX Association.Search in Google Scholar

[51] P. Mohassel, S. S. Sadeghian, and N. P. Smart. Actively secure private function evaluation. In ASIACRYPT, pages 486–505, 2014.10.1007/978-3-662-45608-8_26Search in Google Scholar

[52] P. Mohassel and Y. Zhang. Secureml: A system for scalable privacy-preserving machine learning. In 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017, pages 19–38, 2017.10.1109/SP.2017.12Search in Google Scholar

[53] M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SODA, pages 448–457, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.Search in Google Scholar

[54] M. Naor and B. Pinkas. Computationally secure oblivious transfer. Journal of Cryptology, 18:1–35, Jan 2005.10.1007/s00145-004-0102-6Search in Google Scholar

[55] J. B. Nielsen and C. Orlandi. LEGO for two-party secure computation. In TCC, pages 368–386, 2009.10.1007/978-3-642-00457-5_22Search in Google Scholar

[56] A. Patra, P. Sarkar, and A. Suresh. Fast actively secure OT extension for short secrets. In NDSS. The Internet Society, 2017.10.14722/ndss.2017.23089Search in Google Scholar

[57] B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure two-party computation is practical. IACR Cryptology ePrint Archive, 2009:314, 2009.10.1007/978-3-642-10366-7_15Search in Google Scholar

[58] P. Pullonen, D. Bogdanov, and T. Schneider. The design and implementation of a two-party protocol suite for share-mind 3, Sept. 2012.Search in Google Scholar

[59] E. Shi, T.-H. H. Chan, E. Stefanov, and M. Li. Oblivious ram with o((logn)3) worst-case cost. In ASIACRYPT, pages 197–214, 2011.10.1007/978-3-642-25385-0_11Search in Google Scholar

[60] R. K. H. Tai, J. P. K. Ma, Y. Zhao, and S. S. M. Chow. Privacy-preserving decision trees evaluation via linear functions. In ESORICS, pages 494–512, 2017.10.1007/978-3-319-66399-9_27Search in Google Scholar

[61] F. Tramèr, F. Zhang, A. Juels, M. K. Reiter, and T. Risten-part. Stealing machine learning models via prediction apis. In USENIX, pages 601–618, 2016.Search in Google Scholar

[62] X. Wang, T. H. Chan, and E. Shi. Circuit ORAM: on tightness of the goldreich-ostrovsky lower bound. In CCS, pages 850–861, 2015.10.1145/2810103.2813634Search in Google Scholar

[63] X. S. Wang, Y. Huang, T.-H. H. Chan, A. Shelat, and E. Shi. Scoram: Oblivious ram for secure computation. In CCS, pages 191–202, 2014.10.1145/2660267.2660365Search in Google Scholar

[64] X. S. Wang, K. Nayak, C. Liu, T.-H. H. Chan, E. Shi, E. Stefanov, and Y. Huang. Oblivious data structures. In CCS, pages 215–226, New York, NY, USA, 2014. ACM.10.1145/2660267.2660314Search in Google Scholar

[65] I. H. Witten, E. Frank, and M. A. Hall. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kauf-mann Publishers Inc., San Francisco, CA, USA, 3rd edition, 2011.10.1016/B978-0-12-374856-0.00001-8Search in Google Scholar

[66] D. J. Wu, T. Feng, M. Naehrig, and K. Lauter. Privately evaluating decision trees and random forests. PoPETs, 2016(4):335–355, 2016.10.1515/popets-2016-0043Search in Google Scholar

[67] X. Wu, M. Fredrikson, S. Jha, and J. F. Naughton. A methodology for formalizing model-inversion attacks. In CSF, pages 355–370, 2016.10.1109/CSF.2016.32Search in Google Scholar

[68] A. C. Yao. Protocols for secure computations. In SFCS, pages 160–164, Washington, DC, USA, 1982. IEEE Computer Society.10.1109/SFCS.1982.38Search in Google Scholar

[69] S. Zahur, M. Rosulek, and D. Evans. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In EUROCRYPT, pages 220–250, 2015.10.1007/978-3-662-46803-6_8Search in Google Scholar

• Understanding Privacy-Related Advice on Stack Overflow

• Revisiting Identification Issues in GDPR ‘Right Of Access’ Policies: A Technical and Longitudinal Analysis

• Employees’ privacy perceptions: exploring the dimensionality and antecedents of personal data sensitivity and willingness to disclose

• Visualizing Privacy-Utility Trade-Offs in Differentially Private Data Releases

• Analyzing the Feasibility and Generalizability of Fingerprinting Internet of Things Devices

• CoverDrop: Blowing the Whistle Through A News App

• Building a Privacy-Preserving Smart Camera System

• FP-Radar: Longitudinal Measurement and Early Detection of Browser Fingerprinting

• Are iPhones Really Better for Privacy? A Comparative Study of iOS and Android Apps

• How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols

• Editors’ Introduction

• PUBA: Privacy-Preserving User-Data Bookkeeping and Analytics

• Who Knows I Like Jelly Beans? An Investigation Into Search Privacy

• SoK: Plausibly Deniable Storage

• d3p - A Python Package for Differentially-Private Probabilistic Programming

• Updatable Private Set Intersection

• Knowledge Cross-Distillation for Membership Privacy

• RegulaTor: A Straightforward Website Fingerprinting Defense

• Privacy-Preserving Positioning in Wi-Fi Fine Timing Measurement

• Efficient Set Membership Proofs using MPC-in-the-Head

• Checking Websites’ GDPR Consent Compliance for Marketing Emails

• Comprehensive Analysis of Privacy Leakage in Vertical Federated Learning During Prediction

• Understanding Utility and Privacy of Demographic Data in Education Technology by Causal Analysis and Adversarial-Censoring

• User-Level Label Leakage from Gradients in Federated Learning

• Privacy-preserving training of tree ensembles over continuous data

• Differentially Private Simple Linear Regression

• Increasing Adoption of Tor Browser Using Informational and Planning Nudges