{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:08:10Z","timestamp":1749874090253,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819655656","type":"print"},{"value":"9789819655663","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-5566-3_7","type":"book-chapter","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:22:56Z","timestamp":1749846176000},"page":"111-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Privacy-Preserving Counting Method with\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Jae-yun","family":"Kim","sequence":"first","affiliation":[]},{"given":"Jieun","family":"Yun","sequence":"additional","affiliation":[]},{"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[]},{"given":"Saerom","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Badawi, A.A., et al.: OpenFHE: open-source fully homomorphic encryption library. In: WAHC@CCS, pp. 53\u201363. ACM (2022)","DOI":"10.1145\/3560827.3563379"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bian, S., et al.: HE3DB: an efficient and elastic encrypted database via arithmetic-and-logic fully homomorphic encryption. In: CCS, pp. 2930\u20132944. ACM (2023)","DOI":"10.1145\/3576915.3616608"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Boemer, F., Lao, Y., Cammarota, R., Wierzynski, C.: nGraph-HE: a graph compiler for deep learning on homomorphically encrypted data. In: CF, pp. 3\u201313. ACM (2019)","DOI":"10.1145\/3310273.3323047"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014)","DOI":"10.1145\/2633600"},{"issue":"9","key":"7_CR6","doi-asserted-by":"publisher","first-page":"10114","DOI":"10.1007\/s10489-022-04015-z","volume":"53","author":"J Byun","year":"2023","unstructured":"Byun, J., Park, S., Choi, Y., Lee, J.: Efficient homomorphic encryption framework for privacy-preserving regression. Appl. Intell. 53(9), 10114\u201310129 (2023)","journal-title":"Appl. Intell."},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: In: Cid, C., Jacobson Jr., M. (eds.) SAC 2018. LNCS, vol. 11349, pp. 347\u2013368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64834-3_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"JH Cheon","year":"2020","unstructured":"Cheon, J.H., Kim, D., Kim, D.: Efficient homomorphic comparison methods with optimal complexity. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 221\u2013256. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_8"},{"key":"7_CR10","unstructured":"Cheon, J.H., Son, Y., Yhee, D.: Practical FHE parameters against lattice attacks. IACR Cryptol. ePrint Arch. 39 (2021)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"7_CR12","unstructured":"Chung, H., Kim, H., Kim, Y., Lee, Y.: Amortized large look-up table evaluation with multivariate polynomials for homomorphic encryption. IACR Cryptol. ePrint Arch. 274 (2024)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS, pp. 79\u201388. ACM (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"7_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 144 (2012)"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.3390\/e24040519","volume":"24","author":"R Hamza","year":"2022","unstructured":"Hamza, R., et al.: Towards secure big data analysis via fully homomorphic encryption algorithms. Entropy 24(4), 519 (2022)","journal-title":"Entropy"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Hamza, R., Zettsu, K.: Investigation on privacy-preserving techniques for personal data. In: ICDAR@ICMR, pp. 62\u201366. ACM (2021)","DOI":"10.1145\/3463944.3469267"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"4389","DOI":"10.1109\/TIFS.2021.3106167","volume":"16","author":"S Hong","year":"2021","unstructured":"Hong, S., Kim, S., Choi, J., Lee, Y., Cheon, J.H.: Efficient sorting of homomorphic encrypted data with k-way sorting network. IEEE Trans. Inf. Forensics Secur. 16, 4389\u20134404 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"4","key":"7_CR18","first-page":"670","volume":"2022","author":"I Iliashenko","year":"2022","unstructured":"Iliashenko, I., Izabach\u00e8ne, M., Mertens, A., Pereira, H.: Homomorphically counting elements with the same property. Proc. Priv. Enhanc. Technol. 2022(4), 670\u2013683 (2022)","journal-title":"Proc. Priv. Enhanc. Technol."},{"issue":"5","key":"7_CR19","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1108\/00220410410560573","volume":"60","author":"KS Jones","year":"2004","unstructured":"Jones, K.S.: A statistical interpretation of term specificity and its application in retrieval. J. Doc. 60(5), 493\u2013502 (2004)","journal-title":"J. Doc."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.H.: Logistic regression model training based on the approximate homomorphic encryption. IACR Cryptol. ePrint Arch. 254 (2018)","DOI":"10.1186\/s12920-018-0401-7"},{"key":"7_CR21","unstructured":"Kim, J., Park, S., Lee, J., Cheon, J.H.: Privacy-preserving embedding via look-up table evaluation with fully homomorphic encryption. In: Forty-first International Conference on Machine Learning (2024). https:\/\/openreview.net\/forum?id=apxON2uH4N"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Kim, M., Song, Y., Li, B., Micciancio, D.: Semi-parallel logistic regression for GWAS on encrypted data. IACR Cryptol. ePrint Arch. 294 (2019)","DOI":"10.1186\/s12920-020-0724-z"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"McAuley, J.J., Leskovec, J.: From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews. In: WWW, pp. 897\u2013908. International World Wide Web Conferences Steering Committee\/ACM (2013)","DOI":"10.1145\/2488388.2488466"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Park, S., Byun, J., Lee, J.: Privacy-preserving fair learning of support vector machine with homomorphic encryption. In: WWW, pp. 3572\u20133583. ACM (2022)","DOI":"10.1145\/3485447.3512252"},{"key":"7_CR25","unstructured":"Park, S., Lee, J., Cheon, J.H., Lee, J., Kim, J., Byun, J.: Security-preserving support vector machine with fully homomorphic encryption. In: SafeAI@AAAI. CEUR Workshop Proceedings, vol.\u00a02301. CEUR-WS.org (2019)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"36120","DOI":"10.1109\/ACCESS.2023.3266377","volume":"11","author":"R Patil","year":"2023","unstructured":"Patil, R., Boit, S., Gudivada, V.N., Nandigam, J.: A survey of text representation and embedding techniques in NLP. IEEE Access 11, 36120\u201336146 (2023)","journal-title":"IEEE Access"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: SOSP, pp. 85\u2013100. ACM (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"7_CR28","unstructured":"Ramos, J., et\u00a0al.: Using tf-idf to determine word relevance in document queries. In: Proceedings of the First Instructional Conference on Machine Learning, vol.\u00a0242, pp. 29\u201348. Citeseer (2003)"},{"issue":"4","key":"7_CR29","doi-asserted-by":"publisher","first-page":"601","DOI":"10.14778\/3574245.3574248","volume":"16","author":"X Ren","year":"2022","unstructured":"Ren, X., et al.: HEDA: multi-attribute unbounded aggregation over homomorphically encrypted database. Proc. VLDB Endow. 16(4), 601\u2013614 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Behera, S., Kolipakula, N., Swetha, P., Yogish, Y., Prathuri, J.R..: Text classification using machine learning algorithms on encrypted data. In: 2023 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp.\u00a01\u20136. IEEE (2023)","DOI":"10.1109\/CONECCT57959.2023.10234826"},{"key":"7_CR31","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-55415-5_5","volume-title":"ICT Systems Security and Privacy Protection","author":"M Strizhov","year":"2014","unstructured":"Strizhov, M., Ray, I.: Multi-keyword similarity search over encrypted cloud data. In: Cuppens-Boulahia, N., Cuppens, F., Jajodia, S., Abou El Kalam, A., Sans, T. (eds.) SEC 2014. IAICT, vol. 428, pp. 52\u201365. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55415-5_5"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-5566-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:23:00Z","timestamp":1749846180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-5566-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819655656","9789819655663"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-5566-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"14 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}