{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:13:02Z","timestamp":1715299982274},"reference-count":51,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transfun.2021cip0018","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T22:08:32Z","timestamp":1631570912000},"page":"214-230","source":"Crossref","is-referenced-by-count":0,"title":["Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring and Field"],"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"}]},{"given":"Yusaku","family":"MAEDA","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] W. Aiello, Y. Ishai, and O. Reingold, \u201cPriced oblivious transfer: How to sell digital goods,\u201d EUROCRYPT, volume 2045 of Lecture Notes in Computer Science, pp.119-135, Springer, 2001. 10.1007\/3-540-44987-6_8","DOI":"10.1007\/3-540-44987-6_8"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] 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":"3","doi-asserted-by":"crossref","unstructured":"[3] 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":"4","doi-asserted-by":"crossref","unstructured":"[4] 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":"5","doi-asserted-by":"crossref","unstructured":"[5] D. Beaver, S. Micali, and P. Rogaway, \u201cThe round complexity of secure protocols (extended abstract),\u201d STOC, pp.503-513, ACM, 1990. 10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] 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":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Blanton, A.R. Kang, and C. Yuan, \u201cImproved building blocks for secure multi-party computation based on secret sharing with honest majority,\u201d ACNS (1), volume 12146 of Lecture Notes in Computer Science, pp.377-397, Springer, 2020. 10.1007\/978-3-030-57808-4_19","DOI":"10.1007\/978-3-030-57808-4_19"},{"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, 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":"13","unstructured":"[13] 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 Cryptology ePrint Archive, Report 2019\/695, 2019. https:\/\/eprint.iacr.org\/2019\/695"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] M. De Cock, R. Dowsley, C. Horst, R.S. Katti, Anderson 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":"15","doi-asserted-by":"publisher","unstructured":"[15] A.P.K. Dalskov, D. Escudero, and M. Keller, \u201cSecure evaluation of quantized neural networks,\u201d Proc. Priv. Enhancing Technol., vol.2020, no.4, pp.355-375, 2020. 10.2478\/popets-2020-0077","DOI":"10.2478\/popets-2020-0077"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] I. Damg\u00e5rd, D. Escudero, T.K. Frederiksen, M. Keller, P. Scholl, and N. Volgushev, \u201cNew primitives for actively-secure MPC over rings with applications to private machine learning,\u201d IEEE Symposium on Security and Privacy, pp.1102-1120, IEEE, 2019. 10.1109\/sp.2019.00078","DOI":"10.1109\/SP.2019.00078"},{"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. Doerner and A. Shelat, \u201cScaling ORAM for secure computation,\u201d ACM Conference on Computer and Communications Security, pp.523-535, ACM, 2017. 10.1145\/3133956.3133967","DOI":"10.1145\/3133956.3133967"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] D. Escudero, S. Ghosh, M. Keller, R. Rachuri, and P. Scholl, \u201cImproved primitives for MPC over mixed arithmetic-binary circuits,\u201d CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, pp.823-852, Springer, 2020. 10.1007\/978-3-030-56880-1_29","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] S. Faber, S. Jarecki, S. Kentros, and B. Wei, \u201cThree-party ORAM for secure computation,\u201d ASIACRYPT (1), volume 9452 of Lecture Notes in Computer Science, pp.360-385, Springer, 2015. 10.1007\/978-3-662-48797-6_16","DOI":"10.1007\/978-3-662-48797-6_16"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] T. El Gamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms,\u201d IEEE Trans. Inf. Theory, vol.31, no.4, pp.469-472, 1985. 10.1109\/tit.1985.1057074","DOI":"10.1109\/TIT.1985.1057074"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] R. Gennaro, M.O. Rabin, and T. Rabin, \u201cSimplified VSS and fast-track multiparty computations with applications to threshold cryptography,\u201d PODC, pp.101-111, ACM, 1998. 10.1145\/277697.277716","DOI":"10.1145\/277697.277716"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] C. Gentry, \u201cA fully homomorphic encryption scheme,\u201d PhD Thesis, Stanford University, 2009. crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] 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":"26","doi-asserted-by":"crossref","unstructured":"[26] 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":"27","unstructured":"[27] K. Hamada, D. Ikarashi, K. Chida, and K. Takahashi, \u201cOblivious radix sort: An efficient sorting algorithm for practical secure multi-party computation,\u201d Cryptology ePrint Archive, Report 2014\/121, 2014. https:\/\/eprint.iacr.org\/2014\/121"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] 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":"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] S. Jarecki and B. Wei, \u201c3PC ORAM with low latency, low bandwidth, and fast batch retrieval,\u201d ACNS, volume 10892 of Lecture Notes in Computer Science, pp.360-378, Springer, 2018. 10.1007\/978-3-319-93387-0_19","DOI":"10.1007\/978-3-319-93387-0_19"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] 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":"32","doi-asserted-by":"publisher","unstructured":"[32] \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":"33","doi-asserted-by":"crossref","unstructured":"[33] P. Laud, \u201cA private lookup protocol with low online complexity for secure multiparty computation,\u201d ICICS, volume 8958 of Lecture Notes in Computer Science, pp.143-157, Springer, 2014. 10.1007\/978-3-319-21966-0_11","DOI":"10.1007\/978-3-319-21966-0_11"},{"key":"34","doi-asserted-by":"publisher","unstructured":"[34] P. Laud, \u201cParallel oblivious array access for secure multiparty computation and privacy-preserving minimum spanning trees,\u201d PoPETs, vol.2015, no.2, pp.188-205, 2015. 10.1515\/popets-2015-0011","DOI":"10.1515\/popets-2015-0011"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] J. Launchbury, I.S. Diatchki, T. DuBuisson, and A. Adams-Moran, \u201cEfficient lookup-table protocol in secure multiparty computation,\u201d ICFP, pp.189-200, ACM, 2012. 10.1145\/2364527.2364556","DOI":"10.1145\/2398856.2364556"},{"key":"36","doi-asserted-by":"publisher","unstructured":"[36] 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":"37","unstructured":"[37] 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":"38","unstructured":"[38] M. Naor and B. Pinkas, \u201cEfficient oblivious transfer protocols,\u201d SODA, pp.448-457, ACM\/SIAM, 2001."},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] S. Ohata and K. Nuida, \u201cCommunication-efficient (client-aided) secure two-party protocols and its application,\u201d Financial Cryptography, volume 12059 of Lecture Notes in Computer Science, pp.369-385, Springer, 2020. 10.1007\/978-3-030-51280-4_20","DOI":"10.1007\/978-3-030-51280-4_20"},{"key":"40","doi-asserted-by":"publisher","unstructured":"[40] 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":"41","doi-asserted-by":"publisher","unstructured":"[41] R.L. Rivest, A. Shamir, and L.M. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems (reprint),\u201d Commun. ACM, vol.26, no.1, pp.96-99, 1983. 10.1145\/357980.358017","DOI":"10.1145\/357980.358017"},{"key":"42","doi-asserted-by":"crossref","unstructured":"[42] A. Shamir, \u201cHow to share a secret,\u201d Commun. ACM, vol.22, no.11, pp.612-613, 1979. 10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] 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":"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, volume 12505 of Lecture Notes in Computer Science, 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":"crossref","unstructured":"[47] X. Wang, T.-H.H. Chan, and E. Shi, \u201cCircuit ORAM: on tightness of the goldreich-ostrovsky lower bound,\u201d IACR Cryptol. ePrint Arch., 2014:672, 2014.","DOI":"10.1145\/2810103.2813634"},{"key":"48","doi-asserted-by":"crossref","unstructured":"[48] X.S. Wang, Y. Huang, T.-H.H. Chan, A. Shelat, and E. Shi, \u201cSCORAM: oblivious RAM for secure computation,\u201d ACM Conference on Computer and Communications Security, pp.191-202, ACM, 2014. 10.1145\/2660267.2660365","DOI":"10.1145\/2660267.2660365"},{"key":"49","doi-asserted-by":"publisher","unstructured":"[49] 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":"50","unstructured":"[50] 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"},{"key":"51","doi-asserted-by":"crossref","unstructured":"[51] S. Zahur, X. Wang, M. Raykova, A. Gasc\u00f3n, J. Doerner, D. Evans, and J. Katz, \u201cRevisiting square-root ORAM: Efficient random access in multi-party computation,\u201d IEEE Symposium on Security and Privacy, pp.218-234, IEEE Computer Society, 2016. 10.1109\/sp.2016.21","DOI":"10.1109\/SP.2016.21"}],"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\/3\/E105.A_2021CIP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:29:36Z","timestamp":1715232576000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/3\/E105.A_2021CIP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021cip0018","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021CIP0018"}}