{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:18:23Z","timestamp":1715300303020},"reference-count":48,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,9,1]]},"DOI":"10.1587\/transfun.2021dmp0016","type":"journal-article","created":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T22:09:56Z","timestamp":1646777396000},"page":"1270-1288","source":"Crossref","is-referenced-by-count":0,"title":["Constant-Round Fair SS-4PC for Private Decision Tree Evaluation"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Hikaru","family":"TSUCHIDA","sequence":"first","affiliation":[{"name":"NEC Corporation"},{"name":"University of Tsukuba"}]},{"given":"Takashi","family":"NISHIDE","sequence":"additional","affiliation":[{"name":"University of Tsukuba"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Acquire valued shoppers challenge | kaggle. https:\/\/www.kaggle.com\/c\/acquire-valued-shoppers-challenge\/data"},{"key":"2","unstructured":"[2] Hospital discharge data use agreement. https:\/\/www.dshs.texas.gov\/THCIC\/Hospitals\/Download.shtm"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T. Araki, A. Barak, J. Furukawa, M. Keller, K. Ohara, and H. Tsuchida, \u201cHow to choose suitable secure multiparty computation using generalized SPDZ,\u201d ACM Conference on Computer and Communications Security, pp.2198-2200, ACM, 2018. 10.1145\/3243734.3278510","DOI":"10.1145\/3243734.3278510"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein, \u201cOptimized honest-majority MPC for malicious adversaries \u2014 Breaking the 1 billion-gate per second barrier,\u201d IEEE Symposium on Security and Privacy, pp.843-862, IEEE Computer Society, 2017. 10.1109\/sp.2017.15","DOI":"10.1109\/SP.2017.15"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] T. Araki, J. Furukawa, Y. Lindell, A. Nof, and K. Ohara, \u201cHigh-throughput semi-honest secure three-party computation with an honest majority,\u201d ACM Conference on Computer and Communications Security, pp.805-817, ACM, 2016. 10.1145\/2976749.2978331","DOI":"10.1145\/2976749.2978331"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, and T. Schneider, \u201cSecure evaluation of private linear branching programs with medical applications,\u201d ESORICS, Volume 5789 of Lecture Notes in Computer Science, pp.424-439, Springer, 2009. 10.1007\/978-3-642-04444-1_26","DOI":"10.1007\/978-3-642-04444-1_26"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract),\u201d STOC, pp.1-10, ACM, 1988. 10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Brickell, D.E. Porter, V. Shmatikov, and E. Witchel, \u201cPrivacy-preserving remote diagnostics,\u201d ACM Conference on Computer and Communications Security, pp.498-507, ACM, 2007. 10.1145\/1315245.1315307","DOI":"10.1145\/1315245.1315307"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] M. Byali, H. Chaudhari, A. Patra, and A. Suresh, \u201cFLASH: Fast and robust framework for privacy-preserving machine learning,\u201d Proc. Priv. Enhancing Technol., vol.2020, no.2, pp.459-480, 2020. 10.2478\/popets-2020-0036","DOI":"10.2478\/popets-2020-0036"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] R. Canetti, \u201cUniversally composable security: A new paradigm for cryptographic protocols,\u201d FOCS, pp.136-145, IEEE Computer Society, 2001. 10.1109\/sfcs.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] O. Catrina and S. de Hoogh, \u201cImproved primitives for secure multiparty integer computation,\u201d SCN, Volume 6280 of Lecture Notes in Computer Science, pp.182-199, Springer, 2010. 10.1007\/978-3-642-15317-4_13","DOI":"10.1007\/978-3-642-15317-4_13"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] H. Chaudhari, A. Choudhury, A. Patra, and A. Suresh, \u201cASTRA: High throughput 3PC over rings with application to secure prediction,\u201d CCSW@CCS, pp.81-92, ACM, 2019. 10.1145\/3338466.3358922","DOI":"10.1145\/3338466.3358922"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] H. Chaudhari, R. Rachuri, and A. Suresh, \u201cTrident: Efficient 4PC framework for privacy preserving machine learning,\u201d NDSS, The Internet Society, 2020. 10.14722\/ndss.2020.23005","DOI":"10.14722\/ndss.2020.23005"},{"key":"14","unstructured":"[14] K. Chida, K. Hamada, D. Ikarashi, R. Kikuchi, N. Kiribuchi, and B. Pinkas, \u201cAn efficient secure three-party sorting protocol with an honest majority,\u201d IACR Cryptol. ePrint Arch., 2019:695, 2019."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] M. De Cock, R. Dowsley, C. Horst, R.S. Katti, A.C.A. Nascimento, W.-S. Poon, and S. Truex, \u201cEfficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation,\u201d IEEE Trans. Dependable Secur. Comput., vol.16, no.2, pp.217-230, 2019. 10.1109\/tdsc.2017.2679189","DOI":"10.1109\/TDSC.2017.2679189"},{"key":"16","unstructured":"[16] A. Dalskov, D. Escudero, and M. Keller, \u201cFantastic four: Honest-majority four-party secure computation with malicious security,\u201d Cryptology ePrint Archive, Report 2020\/1330, 2020. https:\/\/eprint.iacr.org\/2020\/1330 (Accepted in Usenix Security 2021)."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] I. Damg\u00e5rd and M. Jurik, \u201cA generalisation, a simplification and some applications of paillier&apos;s probabilistic public-key system,\u201d Public Key Cryptography, volume 1992 of Lecture Notes in Computer Science, pp.119-136, Springer, 2001. 10.1007\/3-540-44586-2_9","DOI":"10.1007\/3-540-44586-2_9"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] D. Demmler, T. Schneider, and M. Zohner, \u201cABY \u2014 A framework for efficient mixed-protocol secure two-party computation,\u201d NDSS, The Internet Society, 2015. 10.14722\/ndss.2015.23113","DOI":"10.14722\/ndss.2015.23113"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] J. Furukawa and Y. Lindell, \u201cTwo-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest,\u201d CCS, pp.1557-1571, ACM, 2019. 10.1145\/3319535.3339811","DOI":"10.1145\/3319535.3339811"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J. Furukawa, Y. Lindell, A. Nof, and O. Weinstein, \u201cHigh-throughput secure three-party computation for malicious adversaries and an honest majority,\u201d EUROCRYPT (2), Volume 10211 of Lecture Notes in Computer Science, pp.225-255, 2017. 10.1007\/978-3-319-56614-6_8","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to play any mental game or a completeness theorem for protocols with honest majority,\u201d STOC, pp.218-229, ACM, 1987.","DOI":"10.1145\/28395.28420"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S. Goldwasser and S. Micali, \u201cProbabilistic encryption and how to play mental poker keeping secret all partial information,\u201d STOC, pp.365-377, ACM, 1982. 10.1145\/800070.802212","DOI":"10.1145\/800070.802212"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] S. Dov Gordon, S. Ranellucci, and X. Wang, \u201cSecure computation with low communication from cross-checking,\u201d ASIACRYPT (3), Volume 11274 of Lecture Notes in Computer Science, pp.59-85, Springer, 2018. 10.1007\/978-3-030-03332-3_3","DOI":"10.1007\/978-3-030-03332-3_3"},{"key":"24","unstructured":"[24] K. Hamada, D. Ikarashi, K. Chida, and K. Takahashi, \u201cOblivious radix sort: An efficient sorting algorithm for practical secure multi-party computation,\u201d IACR Cryptol. ePrint Arch., 2014:121, 2014."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] K. Hamada, R. Kikuchi, D. Ikarashi, K. Chida, and K. Takahashi, \u201cPractically efficient multi-party sorting protocols from comparison sort algorithms,\u201d ICISC, Volume 7839 of Lecture Notes in Computer Science, pp.202-216, Springer, 2012. 10.1007\/978-3-642-37682-5_15","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] W. Henecka, S. K\u00f6gl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg, \u201cTASTY: Tool for automating secure two-party computations,\u201d ACM Conference on Computer and Communications Security, pp.451-462, ACM, 2010. 10.1145\/1866307.1866358","DOI":"10.1145\/1866307.1866358"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] K. Hiwatashi, K. Ogura, S. Ohata, and K. Nuida, \u201cAccelerating secure (2+1)-party computation by insecure but efficient building blocks,\u201d AsiaCCS, pp.616-627, ACM, 2021. 10.1145\/3433210.3453109","DOI":"10.1145\/3433210.3453109"},{"key":"28","unstructured":"[28] Y. Huang, D. Evans, and J. Katz, \u201cPrivate set intersection: Are garbled circuits better than custom protocols?,\u201d NDSS, The Internet Society, 2012."},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] A. Ichikawa, W. Ogata, K. Hamada, and R. Kikuchi, \u201cEfficient secure multi-party protocols for decision tree classification,\u201d ACISP, Volume 11547 of Lecture Notes in Computer Science, pp.362-380, Springer, 2019. 10.1007\/978-3-030-21548-4_20","DOI":"10.1007\/978-3-030-21548-4_20"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M. Keller and P. Scholl, \u201cEfficient, oblivious data structures for MPC,\u201d ASIACRYPT (2), Volume 8874 of Lecture Notes in Computer Science, pp.506-525, Springer, 2014. 10.1007\/978-3-662-45608-8_27","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] \u00c1. Kiss, M. Naderpour, J. Liu, N. Asokan, and T. Schneider, \u201cSoK: Modular and efficient private decision tree evaluation,\u201d PoPETs, vol.2019, no.2, pp.187-208, 2019. 10.2478\/popets-2019-0026","DOI":"10.2478\/popets-2019-0026"},{"key":"32","unstructured":"[32] N. Koti, M. Pancholi, A. Patra, and A. Suresh, \u201cSWIFT: Super-fast and robust privacy-preserving machine learning,\u201d Cryptology ePrint Archive, Report 2020\/592, 2020. https:\/\/eprint.iacr.org\/2020\/592 (Accepted in Usenix Security 2021)."},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] N. Koti, A. Patra, R. Rachuri, and A. Suresh, \u201cTetrad: Actively secure 4PC for secure training and inference,\u201d Cryptology ePrint Archive, Report 2021\/755, 2021. https:\/\/eprint.iacr.org\/2021\/755","DOI":"10.14722\/ndss.2022.24058"},{"key":"34","doi-asserted-by":"publisher","unstructured":"[34] E. Kushilevitz, Y. Lindell, and T. Rabin, \u201cInformation-theoretically secure protocols and security under composition,\u201d SIAM J. Comput., vol.39, no.5, pp.2090-2112, 2010. 10.1137\/090755886","DOI":"10.1137\/090755886"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[35] S. Laur, J. Willemson, and B. Zhang, \u201cRound-efficient oblivious database manipulation,\u201d ISC, Volume 7001 of Lecture Notes in Computer Science, pp.262-277, Springer, 2011. 10.1007\/978-3-642-24861-0_18","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"36","unstructured":"[36] P. Mohassel and P. Rindal, \u201cABY<sup>3<\/sup>: A mixed protocol framework for machine learning,\u201d ACM Conference on Computer and Communications Security, pp.35-52, ACM, 2018. 10.1145\/3243734.3243760"},{"key":"37","doi-asserted-by":"publisher","unstructured":"[37] P. Mohassel and S. Sadeghian, \u201cHow to hide circuits in MPC an efficient framework for private function evaluation,\u201d EUROCRYPT 2013, pp.557-574, 2013. 10.1007\/978-3-642-38348-9_33","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"38","doi-asserted-by":"publisher","unstructured":"[38] P. Paillier, \u201cPublic-key cryptosystems based on composite degree residuosity classes,\u201d EUROCRYPT, Volume 1592 of Lecture Notes in Computer Science, pp.223-238, Springer, 1999. 10.1007\/3-540-48910-x_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] A. Patra and A. Suresh, \u201cBLAZE: Blazing fast privacy-preserving machine learning,\u201d NDSS, The Internet Society, 2020. 10.14722\/ndss.2020.24202","DOI":"10.14722\/ndss.2020.24202"},{"key":"40","doi-asserted-by":"publisher","unstructured":"[40] J. Ross Quinlan, \u201cInduction of decision trees,\u201d Machine learning, vol.1, no.1, pp.81-106, 1986. 10.1007\/bf00116251","DOI":"10.1007\/BF00116251"},{"key":"41","doi-asserted-by":"publisher","unstructured":"[41] V.K. Singh, B. Bozkaya, and A. Pentland, \u201cMoney walks: Implicit mobility behavior and financial well-being,\u201d PLoS ONE, vol.10, no.8, e0136628, 2015. 10.1371\/journal.pone.0136628","DOI":"10.1371\/journal.pone.0136628"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] R.K.H. Tai, J.P.K. Ma, Y. Zhao, and S.S.M. Chow, \u201cPrivacy-preserving decision trees evaluation via linear functions,\u201d ESORICS (2), Volume 10493 of Lecture Notes in Computer Science, pp.494-512, Springer, 2017. 10.1007\/978-3-319-66399-9_27","DOI":"10.1007\/978-3-319-66399-9_27"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] H. Tsuchida and T. Nishide, \u201cPrivate decision tree evaluation with constant rounds via (only) fair SS-4PC,\u201d Information Security and Privacy, pp.309-329, Springer International Publishing, Cham, 2021. 10.1007\/978-3-030-90567-5_16","DOI":"10.1007\/978-3-030-90567-5_16"},{"key":"44","doi-asserted-by":"crossref","unstructured":"[44] H. Tsuchida, T. Nishide, and Y. Maeda, \u201cPrivate decision tree evaluation with constant rounds via (only) SS-3PC over ring,\u201d ProvSec, pp.298-317, Springer, 2020. 10.1007\/978-3-030-62576-4_15","DOI":"10.1007\/978-3-030-62576-4_15"},{"key":"45","doi-asserted-by":"publisher","unstructured":"[45] A. Tueno, F. Kerschbaum, and S. Katzenbeisser, \u201cPrivate evaluation of decision trees using sublinear cost,\u201d PoPETs, vol.2019, no.1, pp.266-286, 2019. 10.2478\/popets-2019-0015","DOI":"10.2478\/popets-2019-0015"},{"key":"46","doi-asserted-by":"publisher","unstructured":"[46] S. Wagh, D. Gupta, and N. Chandran, \u201cSecureNN: 3-party secure computation for neural network training,\u201d PoPETs, vol.2019, no.3, pp.26-49, 2019. 10.2478\/popets-2019-0035","DOI":"10.2478\/popets-2019-0035"},{"key":"47","doi-asserted-by":"publisher","unstructured":"[47] D.J. Wu, T. Feng, M. Naehrig, and K.E. Lauter, \u201cPrivately evaluating decision trees and random forests,\u201d PoPETs, vol.2016, no.4, pp.335-355, 2016. 10.1515\/popets-2016-0043","DOI":"10.1515\/popets-2016-0043"},{"key":"48","unstructured":"[48] A.C.-C. Yao, \u201cHow to generate and exchange secrets (extended abstract),\u201d FOCS, pp.162-167, IEEE Computer Society, 1986. 10.1109\/sfcs.1986.25"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/9\/E105.A_2021DMP0016\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:30:47Z","timestamp":1715232647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/9\/E105.A_2021DMP0016\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,1]]},"references-count":48,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021dmp0016","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,1]]},"article-number":"2021DMP0016"}}