{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:54Z","timestamp":1766449794664,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031346705"},{"type":"electronic","value":"9783031346712"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34671-2_8","type":"book-chapter","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T23:02:58Z","timestamp":1687302178000},"page":"96-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Generating One-Hot Maps Under Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3647-1440","authenticated-orcid":false,"given":"Ehud","family":"Aharoni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7273-4797","authenticated-orcid":false,"given":"Nir","family":"Drucker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-0297","authenticated-orcid":false,"given":"Eyal","family":"Kushnir","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6808-5675","authenticated-orcid":false,"given":"Ramy","family":"Masalha","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8432-0623","authenticated-orcid":false,"given":"Hayim","family":"Shaul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"8_CR1","unstructured":"Aharoni, E., et al.: HeLayers: a tile tensors framework for large neural networks on encrypted data. CoRR abs\/2011.0 (2020). arXiv:2011.01805"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/MSEC.2022.3181689","volume":"20","author":"E Aharoni","year":"2022","unstructured":"Aharoni, E., Drucker, N., Ezov, G., Shaul, H., Soceanu, O.: Complex encoded tile tensors: accelerating encrypted analytics. IEEE Secur. Priv. 20(5), 35\u201343 (2022). https:\/\/doi.org\/10.1109\/MSEC.2022.3181689","journal-title":"IEEE Secur. Priv."},{"key":"8_CR3","unstructured":"Albrecht, M., et al.: Homomorphic encryption security standard. Technical report, HomomorphicEncryption.org, Toronto, Canada (2018). https:\/\/HomomorphicEncryption.org"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-031-13945-1_11","volume-title":"Privacy in Statistical Databases","author":"Y Ameur","year":"2022","unstructured":"Ameur, Y., Aziz, R., Audigier, V., Bouzefrane, S.: Secure and non-interactive k-NN classifier using symmetric fully homomorphic encryption. In: Domingo-Ferrer, J., Laurent, M. (eds.) PSD 2022. LNCS, vol. 13463, pp. 142\u2013154. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13945-1_11"},{"key":"8_CR5","unstructured":"Aslett, L.J.M., Esperan\u00e7a, P.M., Holmes, C.C.: Encrypted statistical machine learning: new privacy preserving methods (2015). arXiv:1508.06845"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 1\u201336 (2014). https:\/\/doi.org\/10.1145\/2633600","journal-title":"ACM Trans. Comput. Theory"},{"key":"8_CR8","unstructured":"Centers for Medicare & Medicaid Services: The Health Insurance Portability and Accountability Act of 1996 (HIPAA) (1996). https:\/\/www.hhs.gov\/hipaa\/"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Chakraborty, O., Zuber, M.: Efficient and accurate homomorphic comparisons. In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC 2022, pp. 35\u201346. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3560827.3563375","DOI":"10.1145\/3560827.3563375"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-10970-7_16","volume-title":"Selected Areas in Cryptography - SAC 2018","author":"JH Cheon","year":"2019","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson, M.J., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 347\u2013368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_16"},{"key":"8_CR11","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":"8_CR12","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":"8_CR13","unstructured":"CryptoLab: HEaaN: Homomorphic Encryption for Arithmetic of Approximate Numbers (2022). https:\/\/www.cryptolab.co.kr\/eng\/product\/heaan.php"},{"key":"8_CR14","unstructured":"Drucker, N., Moshkowich, G., Pelleg, T., Shaul, H.: BLEACH: cleaning errors in discrete computations over CKKS. Cryptology ePrint Archive, Paper 2022\/1298 (2022). https:\/\/eprint.iacr.org\/2022\/1298"},{"key":"8_CR15","unstructured":"EU General Data Protection Regulation: Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95\/46\/EC (General Data Protection Regulation). Official Journal of the European Union 119 (2016). http:\/\/data.europa.eu\/eli\/reg\/2016\/679\/oj"},{"key":"8_CR16","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. In: Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, pp. 1\u201316 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"8_CR17","unstructured":"Gartner: Gartner identifies top security and risk management trends for 2021. Technical report (2021). https:\/\/www.gartner.com\/en\/newsroom\/press-releases\/2021-03-23-gartner-identifies-top-security-and-risk-management-t"},{"key":"8_CR18","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-57048-8_5","volume-title":"Tutorials on the Foundations of Cryptography","author":"S Halevi","year":"2017","unstructured":"Halevi, S.: Homomorphic encryption. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography. ISC, pp. 219\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_5"},{"key":"8_CR19","unstructured":"IBM: HELayers SDK with a Python API for x86 (2021). https:\/\/hub.docker.com\/r\/ibmcom\/helayers-pylab"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Iliashenko, I., Zucca, V.: Faster homomorphic comparison operations for BGV and BFV. Proc. Priv. Enhancing Technol. 3, 246\u2013264 (2021). https:\/\/petsymposium.org\/popets\/2021\/popets-2021-0046.pdf","DOI":"10.2478\/popets-2021-0046"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-04212-7_30","volume-title":"Neural Information Processing","author":"S Kim","year":"2018","unstructured":"Kim, S., Omori, M., Hayashi, T., Omori, T., Wang, L., Ozawa, S.: Privacy-preserving naive bayes classification using fully homomorphic encryption. In: Cheng, L., Leung, A.C.S., Ozawa, S. (eds.) ICONIP 2018. LNCS, vol. 11304, pp. 349\u2013358. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04212-7_30"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Lee, E., Lee, J.W., Kim, Y.S., No, J.S.: Minimax approximation of sign function by composite polynomial for homomorphic comparison. IEEE Trans. Dependable Secure Comput. (2021). https:\/\/doi.org\/10.1109\/TDSC.2021.3105111","DOI":"10.1109\/TDSC.2021.3105111"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-71039-4_4","volume-title":"Fast Software Encryption","author":"V Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: a modest proposal for FFT hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 54\u201372. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_4"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"8_CR25","unstructured":"Magara, S.S., et al.: ML with HE: privacy preserving machine learning inferences for genome studies. Technical report 1 (2021). arXiv:2110.11446"},{"issue":"4","key":"8_CR26","doi-asserted-by":"publisher","first-page":"819","DOI":"10.3390\/make3040041","volume":"3","author":"G Onoufriou","year":"2021","unstructured":"Onoufriou, G., Mayfield, P., Leontidis, G.: Fully homomorphically encrypted deep learning as a service. Mach. Learn. Knowl. Extract. 3(4), 819\u2013834 (2021). https:\/\/doi.org\/10.3390\/make3040041","journal-title":"Mach. Learn. Knowl. Extract."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Rescorla, E.: The transport layer security (TLS) protocol version 1.3. RFC 8446 (2018). https:\/\/www.rfc-editor.org\/info\/rfc8446","DOI":"10.17487\/RFC8446"},{"key":"8_CR28","unstructured":"The HEBench Organization: HEBench (2022). https:\/\/hebench.github.io\/"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Zhang, L., Xu, J., Vijayakumar, P., Sharma, P.K., Ghosh, U.: Homomorphic encryption-based privacy-preserving federated learning in IoT-enabled healthcare system. IEEE Trans. Netw. Sci. Eng. 1\u201317 (2022). https:\/\/doi.org\/10.1109\/TNSE.2022.3185327","DOI":"10.1109\/TNSE.2022.3185327"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34671-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:19:57Z","timestamp":1710332397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34671-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031346705","9783031346712"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34671-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}