{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:35:19Z","timestamp":1757309719810,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003565","name":"Ministry of Land, Infrastructure and Transport","doi-asserted-by":"publisher","award":["RS-2022-0144012"],"award-info":[{"award-number":["RS-2022-0144012"]}],"id":[{"id":"10.13039\/501100003565","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2021R1A2C1092925, NRF-2022M3J6A1063021"],"award-info":[{"award-number":["NRF-2021R1A2C1092925, NRF-2022M3J6A1063021"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Fund of the University of Seoul"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10489-023-04837-5","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T12:01:42Z","timestamp":1690545702000},"page":"24782-24791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantile estimation for encrypted data"],"prefix":"10.1007","volume":"53","author":[{"given":"Minje","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaeseon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungchul","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheolwoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-June","family":"Jeon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SoonSun","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0589-8043","authenticated-orcid":false,"given":"Hosik","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"4837_CR1","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.future.2020.01.056","volume":"107","author":"S Adamovi\u0107","year":"2020","unstructured":"Adamovi\u0107 S, Mi\u0161kovic V, Ma\u010dek N, Milosavljevi\u0107 M, \u0160arac M, Sara\u010devi\u0107 M, Gnjatovi\u0107 M (2020) An efficient novel approach for iris recognition based on stylometric features and machine learning techniques. Future Gener Comput Syst 107:144\u2013157","journal-title":"Future Gener Comput Syst"},{"key":"4837_CR2","unstructured":"Assran, M. and Rabbat, M. (2020). On the convergence of nesterov\u2019s accelerated gradient method in stochastic settings. In Proceedings of the 37th International Conference on Machine Learning, ICML\u201920. JMLR.org"},{"key":"4837_CR3","first-page":"849","volume":"11","author":"Y Ben-Haim","year":"2010","unstructured":"Ben-Haim Y, Tom-Tov E (2010) A streaming parallel decision tree algorithm. J Mach Learn Res. 11:849\u2013872","journal-title":"J Mach Learn Res."},{"key":"4837_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/2090236.2090262","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS \u201912","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2012) (leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS \u201912. Association for Computing Machinery, New York, pp 309\u2013325"},{"issue":"4","key":"4837_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1093\/biomet\/75.4.761","volume":"75","author":"J Breckling","year":"1988","unstructured":"Breckling J, Chambers R (1988) M-quantiles. Biometrika 75(4):761\u2013771","journal-title":"M-quantiles. Biometrika"},{"key":"4837_CR6","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1145\/2939672.2939785","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201916","author":"T Chen","year":"2016","unstructured":"Chen T, Guestrin C (2016) Xgboost: A scalable tree boosting system. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201916. Association for Computing Machinery, New York, pp 785\u2013794"},{"key":"4837_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology - ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Takagi T, Peyrin T (eds) Advances in Cryptology - ASIACRYPT 2017. Cham. Springer International Publishing, pp 409\u2013437"},{"key":"4837_CR8","first-page":"2553","volume":"17","author":"JH Cheon","year":"2022","unstructured":"Cheon JH, Kim W, Park JH (2022) Efficient homomorphic evaluation on large intervals. IEEE 17:2553\u20132568","journal-title":"IEEE"},{"key":"4837_CR9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2016) Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In: Cheon JH, Takagi T (eds) Advances in Cryptology \u2013 ASIACRYPT 2016. Springer Berlin Heidelberg, Berlin, Heidelberg"},{"key":"4837_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: Halevi S, Rabin T (eds) Theory of Cryptography. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 265\u2013284"},{"key":"4837_CR11","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012:144","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"6","key":"4837_CR12","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1080\/00029890.1973.11993339","volume":"80","author":"H Flanders","year":"1973","unstructured":"Flanders H (1973) Differentiation under the integral sign. The American Mathematical Monthly 80(6):615\u2013627","journal-title":"The American Mathematical Monthly"},{"key":"4837_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1536414.1536440","volume-title":"Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC \u201909","author":"C Gentry","year":"2009","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC \u201909. Association for Computing Machinery, New York, pp 169\u2013178"},{"issue":"6","key":"4837_CR14","doi-asserted-by":"publisher","first-page":"5938","DOI":"10.1007\/s10489-021-02727-2","volume":"52","author":"H Huang","year":"2022","unstructured":"Huang H, Wang Y, Zong H (2022) Support vector machine classification over encrypted data. App Intell 52(6):5938\u20135948","journal-title":"App Intell"},{"issue":"1","key":"4837_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.2307\/1913643","volume":"46","author":"R Koenker","year":"1978","unstructured":"Koenker R, Bassett G (1978) Regression quantiles. Econometrica 46(1):33\u201350","journal-title":"Econometrica"},{"key":"4837_CR16","doi-asserted-by":"crossref","unstructured":"Lee J-W, Kang H, Lee Y, Choi W, Eom J, Deryabin M, Lee E, Lee J, Yoo D, Kim Y-S, No J-S (2022) Privacy-preserving machine learning with fully homomorphic encryption for deep neural network. IEEE Access 10:30039\u201330054","DOI":"10.1109\/ACCESS.2022.3159694"},{"key":"4837_CR17","unstructured":"Lee Y-J, Mangasarian OL (2001) Ssvm: A smooth support vector machine for classification. Comput Opt Appl 20(1):5\u201322"},{"key":"4837_CR18","doi-asserted-by":"crossref","unstructured":"Marquardt DW (1963) An algorithm for least-squares estimation of nonlinear parameters. J Soc Indust Appl Math 11(2):431\u2013441","DOI":"10.1137\/0111030"},{"issue":"2","key":"4837_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/12.16506","volume":"38","author":"T Nakatani","year":"1989","unstructured":"Nakatani T, Huang S-T, Arden B, Tripathi S (1989) K-way bitonic sort. IEEE Trans Comput 38(2):283\u2013288","journal-title":"IEEE Trans Comput"},{"key":"4837_CR20","doi-asserted-by":"crossref","unstructured":"Nesterov, Y. (2004). Introductory Lectures on Convex Optimization: A Basic Course. Springer Publishing Company, Incorporated, 1 edition","DOI":"10.1007\/978-1-4419-8853-9_1"},{"issue":"2","key":"4837_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1080\/00031305.1984.10483185","volume":"38","author":"RM Norton","year":"1984","unstructured":"Norton RM (1984) The double exponential distribution: Using calculus to find a maximum likelihood estimator. Am Stat 38(2):135\u2013136","journal-title":"Am Stat"},{"key":"4837_CR22","first-page":"169","volume-title":"On data banks and privacy homomorphisms","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Academia Press, Foundations of Secure Computation, pp 169\u2013179"},{"key":"4837_CR23","first-page":"461","volume":"9","author":"DB Rubin","year":"1993","unstructured":"Rubin DB (1993) Statistical disclosure limitation. J Off. Stat 9:461\u2013468","journal-title":"Stat"},{"issue":"2","key":"4837_CR24","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/TR.2020.3010973","volume":"70","author":"MH Sara\u010devi\u0107","year":"2021","unstructured":"Sara\u010devi\u0107 MH, Adamovi\u0107 SZ, Mi\u0161kovic VA, Elhoseny M, Ma\u010dek ND, Selim MM, Shankar K (2021) Data encryption for internet of things applications based on catalan objects and two combinatorial structures. IEEE Transact Reliabil 70(2):819\u2013830","journal-title":"IEEE Transact Reliabil"},{"key":"4837_CR25","unstructured":"Tukey, J.\u00a0W. (1977). Exploratory Data Analysis. Pearson"},{"issue":"3","key":"4837_CR26","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s13042-011-0031-2","volume":"2","author":"S Zheng","year":"2011","unstructured":"Zheng S (2011) Gradient descent algorithms for quantile regression with smooth approximation. Int J Mach Learn Cybernet 2(3):191\u2013207","journal-title":"Int J Mach Learn Cybernet"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04837-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04837-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04837-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T06:55:12Z","timestamp":1729839312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04837-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":26,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4837"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04837-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2023,7,28]]},"assertion":[{"value":"23 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The authors state that this research complies with ethical standards. This research does not involve either human participants or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standard"}}]}}