{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:24:18Z","timestamp":1764995058870,"version":"3.46.0"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2025,12,1]]},"DOI":"10.1587\/transinf.2024icp0008","type":"journal-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T22:08:28Z","timestamp":1755727708000},"page":"1526-1537","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Two-Party Exponentiation from Quotient Transfer"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Yi","family":"LU","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology"},{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}]},{"given":"Keisuke","family":"HARA","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"},{"name":"Yokohama National University (YNU)"}]},{"given":"Kazuma","family":"OHARA","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}]},{"given":"Jacob","family":"SCHULDT","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}]},{"given":"Keisuke","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology"}]}],"member":"532","reference":[{"unstructured":"[1] ISO\/IEC 19592-2:2017(en) Information technology \u2014 Security techniques \u2014 Secret sharing \u2014 Part 2: Fundamental mechanisms.","key":"1"},{"doi-asserted-by":"crossref","unstructured":"[2] A. Patra and A. Suresh, \u201cBLAZE: Blazing fast privacy-preserving machine learning,\u201d Proceedings 2020 Network and Distributed System Security Symposium, pp.459-480, 2020. 10.14722\/ndss.2020.24202","key":"2","DOI":"10.14722\/ndss.2020.24202"},{"doi-asserted-by":"crossref","unstructured":"[3] A. Aly, A. Abidin, and S. Nikova, \u201cPractically efficient secure distributed exponentiation without bit-decomposition,\u201d FC 2018, LNCS, pp.291-309, Springer, Heidelberg, Feb.\/March 2018. 10.1007\/978-3-662-58387-6_16","key":"3","DOI":"10.1007\/978-3-662-58387-6_16"},{"doi-asserted-by":"crossref","unstructured":"[4] G. Asharov, Y. Lindell, T. Schneider, and M. Zohner, \u201cMore efficient oblivious transfer extensions with security for malicious adversaries,\u201d E. Oswald and M. Fischlin, editors, EUROCRYPT 2015, Part I, vol.9056 of LNCS, pp.673-701, Springer, Heidelberg, April 2015. 10.1007\/978-3-662-46800-5_26","key":"4","DOI":"10.1007\/978-3-662-46800-5_26"},{"doi-asserted-by":"publisher","unstructured":"[5] M. Byali, H. Chaudhari, A. Patra, and A. Suresh, \u201cFLASH: Fast and robust framework for privacy-preserving machine learning,\u201d Proceedings on Privacy Enhancing Technologies, vol.2020, no.2, pp.459-480, 2020. 10.2478\/popets-2020-0036","key":"5","DOI":"10.2478\/popets-2020-0036"},{"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 20th ACM STOC, pp.1-10, ACM Press, May 1988. 10.1145\/62212.62213","key":"6","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"[8] H. Chaudhari, A. Choudhury, A. Patra, and A. Suresh, \u201cASTRA: High throughput 3PC over rings with application to secure prediction,\u201d Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, pp.81-92, 2019. 10.1145\/3338466.3358922","key":"7","DOI":"10.1145\/3338466.3358922"},{"doi-asserted-by":"crossref","unstructured":"[9] H. Chaudhari, R. Rachuri, and A. Suresh, \u201cTrident: Efficient 4PC framework for privacy preserving machine learning,\u201d Proceedings on 27th Annual Network and Distributed System Security Symposium, 2020. 10.14722\/ndss.2020.23005","key":"8","DOI":"10.14722\/ndss.2020.23005"},{"unstructured":"[10] J. Chiraag, V. Vinod, and C. Anantha, \u201cGAZELLE: A Low Latency Framework for Secure Neural Network Inference,\u201d Proceedings of the 27th USENIX Conference on Security Symposium, pp.1651-1668, 2018.","key":"9"},{"doi-asserted-by":"crossref","unstructured":"[11] I. Damg\u00e5rd, M. Fitzi, E. Kiltz, J.B. Nielsen, and T. Toft, \u201cUnconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation,\u201d S. Halevi and T. Rabin, editors, TCC 2006, vol.3876 of LNCS, pp.285-304, Springer, Heidelberg, March 2006. 10.1007\/11681878_15","key":"10","DOI":"10.1007\/11681878_15"},{"doi-asserted-by":"publisher","unstructured":"[12] I. Damg\u00e5rd, M. Keller, E. Larraia, V. Pastro, P. Scholl, and N.P. Smart, \u201cPractical covertly secure MPC for dishonest majority - or: Breaking the SPDZ limits,\u201d J. Crampton, S. Jajodia, and K. Mayes, editors, ESORICS 2013, vol.8134 of LNCS, pp.1-18, Springer, Heidelberg, Sept. 2013. 10.1007\/978-3-642-40203-6_1","key":"11","DOI":"10.1007\/978-3-642-40203-6_1"},{"doi-asserted-by":"crossref","unstructured":"[13] I. Damg\u00e5rd and J.B. Nielsen, \u201cUniversally composable efficient multiparty computation from threshold homomorphic encryption,\u201d D. Boneh, editor, CRYPTO 2003, vol.2729 of LNCS, pp.247-264, Springer, Heidelberg, Aug. 2003. 10.1007\/978-3-540-45146-4_15","key":"12","DOI":"10.1007\/978-3-540-45146-4_15"},{"doi-asserted-by":"crossref","unstructured":"[14] I. Damg\u00e5rd, V. Pastro, N. Smart, and S. Zakarias, \u201cMultiparty computation from somewhat homomorphic encryption,\u201d R. Safavi-Naini and R. Canetti, editors, CRYPTO 2012, vol.7417 of LNCS, pp.643-662, Springer, Heidelberg, Aug. 2012. 10.1007\/978-3-642-32009-5_38","key":"13","DOI":"10.1007\/978-3-642-32009-5_38"},{"doi-asserted-by":"crossref","unstructured":"[15] R. Gennaro, S. Goldfeder, and A. Narayanan, \u201cThreshold-Optimal DSA\/ECDSA Signatures and an Application to Bitcoin Wallet Security,\u201d ACNS 2016, LNCS, pp.156-174, Springer, Heidelberg, June 2016. 10.1007\/978-3-319-39555-5_9","key":"14","DOI":"10.1007\/978-3-319-39555-5_9"},{"doi-asserted-by":"crossref","unstructured":"[16] R. Kikuchi, D. Ikarashi, T. Matsuda, K. Hamada, and K. Chida, \u201cEfficient bit-decomposition and modulus-conversion protocols with an honest majority,\u201d W. Susilo and G. Yang, editors, ACISP 18, vol.10946 of LNCS, pp.64-82, Springer, Heidelberg, July 2018. 10.1007\/978-3-319-93638-3_5","key":"15","DOI":"10.1007\/978-3-319-93638-3_5"},{"doi-asserted-by":"publisher","unstructured":"[17] 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","key":"16","DOI":"10.1137\/090755886"},{"doi-asserted-by":"crossref","unstructured":"[18] M. Keller, E. Orsini, and P. Scholl, \u201cMASCOT: Faster malicious arithmetic secure computation with oblivious transfer,\u201d E.R. Weippl, S. Katzenbeisser, C. Kruegel, A.C. Myers, and S. Halevi, editors, ACM CCS 2016, pp.830-842, ACM Press, Oct. 2016. 10.1145\/2976749.2978357","key":"17","DOI":"10.1145\/2976749.2978357"},{"doi-asserted-by":"crossref","unstructured":"[19] M. Keller, V. Pastro, and D. Rotaru, \u201cOverdrive: Making SPDZ great again,\u201d J.B. Nielsen and V.Rijmen, editors, EUROCRYPT 2018, Part III, vol.10822 of LNCS, pp.158-189, Springer, Heidelberg, April\/May 2018. 10.1007\/978-3-319-78372-7_6","key":"18","DOI":"10.1007\/978-3-319-78372-7_6"},{"doi-asserted-by":"crossref","unstructured":"[20] N. Kumar, M. Rathee, N. Chandran, D. Gupta, A. Rastogi, and R. Sharma, \u201cCrypTFlow: Secure TensorFlow inference,\u201d Proceedings 2020 IEEE Symposium on Security and Privacy, pp.336-353, 2020. 10.1109\/sp40000.2020.00092","key":"19","DOI":"10.1109\/SP40000.2020.00092"},{"doi-asserted-by":"crossref","unstructured":"[21] Y. Lindell, \u201cFast secure two-party ECDSA signing,\u201d CRYPTO 2017, LNCS, pp.613-644, Springer, Heidelberg, Aug. 2017. 10.1007\/978-3-319-63715-0_21","key":"20","DOI":"10.1007\/978-3-319-63715-0_21"},{"doi-asserted-by":"crossref","unstructured":"[22] Y. Lu, K. Hara, K. Ohara, J. Schuldt, and K. Tanaka, \u201cEfficient two-party exponentiation from quotient transfer, ACNS 2022, LNCS, pp.643-662, Springer, Heidelberg, 2022. 10.1007\/978-3-031-09234-3_32","key":"21","DOI":"10.1007\/978-3-031-09234-3_32"},{"unstructured":"[23] P. Mishra, R. Lehmkuhl, A. Srinivasan, W. Zheng, and R.A. Popa, \u201cDelphi: A cryptographic inference service for neural networks,\u201d Proceedings of the 29th USENIX Conference on Security Symposium, pp.2505-2522, 2020.","key":"22"},{"doi-asserted-by":"crossref","unstructured":"[24] C. Ning and Q. Xu, \u201cConstant-rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security,\u201d D.H. Lee and X. Wang, editors, ASIACRYPT 2011, vol.7073 of LNCS, pp.572-589, Springer, Heidelberg, Dec. 2011. 10.1007\/978-3-642-25385-0_31","key":"23","DOI":"10.1007\/978-3-642-25385-0_31"},{"doi-asserted-by":"publisher","unstructured":"[25] K. Ohara, Y. Watanabe, M. Iwamoto, and K. Ohta, \u201cMulti-party computation for modular exponentiation based on replicated secret sharing,\u201d IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol.102, no.9, pp.1079-1090, 2019. 10.1587\/transfun.e102.a.1079","key":"24","DOI":"10.1587\/transfun.E102.A.1079"},{"unstructured":"[26] M.S. Riazi, M. Samragh, H. Chen, K. Laine, K. Lauter, and F. Koushanfar, \u201cXONN: XNOR-based oblivious deep neural network inference,\u201d Proceedings of the 28th USENIX Conference on Security Symposium, pp.1501-1518, 2019.","key":"25"},{"doi-asserted-by":"publisher","unstructured":"[27] Y. Wang, D.S. Wong, Q. Wu, S.S.M. Chow, B. Qin, and J. Liu, \u201cPractical distributed signatures in the standard model,\u201d CT-RSA 2014, LNCS, pp.307-326, Springer, Heidelberg, Feb. 2014. 10.1007\/978-3-319-04852-9_16","key":"26","DOI":"10.1007\/978-3-319-04852-9_16"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/12\/E108.D_2024ICP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T03:27:36Z","timestamp":1764991656000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/12\/E108.D_2024ICP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,1]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024icp0008","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,12,1]]},"article-number":"2024ICP0008"}}