{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T21:59:48Z","timestamp":1781819988474,"version":"3.54.5"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608744","type":"print"},{"value":"9789819608751","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"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-0875-1_9","type":"book-chapter","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:09:52Z","timestamp":1733728192000},"page":"271-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Homomorphic Sign Evaluation with\u00a0a\u00a0RNS Representation of\u00a0Integers"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Chartier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Koskas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Lemou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"M\u00e9hats","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"9_CR1","unstructured":"A. Alexandru, A. Al Badawi, D. Micciancio and Y. Polyakov, Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use, Cryptology ePrint Archive, Paper 2024\/203, 2024, https:\/\/eprint.iacr.org\/2024\/203"},{"key":"9_CR2","unstructured":"J.-P. Bossuat, A. Costache, C. Mouchet, L. N\u00fcrnberger and J.R. Troncoso-Pastoriza, Practical q-IND-CPA-D-Secure Approximate Homomorphic Encryption, Cryptology ePrint Archive, Paper 2024\/853, 2024, https:\/\/eprint.iacr.org\/2024\/853"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"F. Bourse, M. Minelli, M. Minihold, and Pascal Paillier, Fast homomorphic evaluation of deep discretized neural networks, Advances in Cryptology - CRYPTO, 483\u2013512, Springer, 2018","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"F. Bourse, O. Sanders, and J. Traor\u00e9, Improved secure integer comparison via homomorphic encryption, Cryptographers\u2019 Track at the RSA Conference, 391\u2013416, Springer, 2020","DOI":"10.1007\/978-3-030-40186-3_17"},{"key":"9_CR5","volume-title":"Threshold properties of prime power subgroups with application to secure integer comparisons, Cryptographers\u2019 Track at the RSA Conference, 137\u2013156","author":"R Carlton","year":"2018","unstructured":"Carlton, R., Essex, A., Kapulkin, K.: Threshold properties of prime power subgroups with application to secure integer comparisons, Cryptographers\u2019 Track at the RSA Conference, 137\u2013156. Springer, Heidelberg (2018)"},{"key":"9_CR6","unstructured":"P. Chartier, M. Koskas, M. Lemou, and F. M\u00e9hats, Fully Homomorphic Encryption on large integers, Cryptology ePrint Archive, 2024"},{"key":"9_CR7","unstructured":"P. Chartier, M. Koskas, M. Lemou, and F. M\u00e9hats, Method for homomorphically determining the sign of a message by dilation, associated methods and devices, Patent no WO2023242429 - 12\/21\/2023. Number and date of prority : FR2205957 - 17\/06\/2022"},{"key":"9_CR8","unstructured":"P. Chartier, M. Koskas, M. Lemou, and F. M\u00e9hats, Homomorphic encryption method and associated devices ans system. Patent no WO2022129979 - 06\/23\/2022. Number and date of priority : PCT\/IB2020001147 - 12\/18\/2020"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"J. H. Cheon, D. Kim, and D. Kim, Efficient homomorphic comparison methods with optimal complexity, Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 221\u2013256, 2020","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"H. Chen, R. Gilad-Bachrach, K. Han, Z. Huang, A. Jalali, K. Laine, and K. Lauter, Logistic regression over encrypted data from fully homomorphic encryption, Cryptology ePrint Archive, Report 2018\/462, 2018","DOI":"10.1186\/s12920-018-0397-z"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"issue":"1","key":"9_CR12","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. Journal of Cryptology 33(1), 34\u201391 (2020)","journal-title":"Journal of Cryptology"},{"key":"9_CR13","unstructured":"A. Costache, B. R. Curtis, E. Hales, S. Murphy, T. Ogilvie and R. Player, On the precision loss in approximate homomorphic encryption, Cryptology ePrint Archive, Report 2022\/162, 2022"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"C. Gentry, Fully homomorphic encryption using ideal lattices, 41st Annual ACM Symposium on Theory of Computing, 169\u2013178. ACM Press, 2009","DOI":"10.1145\/1536414.1536440"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"I. Iliashenko, and V. Zucca, Faster homomorphic comparison operations for BGV and BFV, Proceedings on Privacy Enhancing Technologies, 2021","DOI":"10.2478\/popets-2021-0046"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"M. Izabach\u00e8ne, R. Sirdey, and M. Zuber, Practical fully homomorphic encryption for fully masked neural networks, Cryptology and Network Security - 18th International Conference, CANS, 24\u201336. Springer, 2019","DOI":"10.1007\/978-3-030-31578-8_2"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"E. Lee, J.-W. Lee, J.-S. No, and Y.-S. Kim, Minimax approximation of sign function by composite polynomial for homomorphic comparison, IEEE Transactions on Dependable and Secure Computing, 2021","DOI":"10.1109\/TDSC.2021.3105111"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"26163","DOI":"10.1109\/ACCESS.2022.3155882","volume":"10","author":"E Lee","year":"2022","unstructured":"Lee, E., Lee, J.-W., Kim, Y.-S., No, J.-S.: Optimization of homomorphic comparison algorithm on RNS-CKKS scheme. IEEE Access 10, 26163\u201326176 (2022)","journal-title":"IEEE Access"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Y. Lee, D. Micciancio, A. Kim, R. Choi, M. Deryabin, J. Eom, and D. Yoo, Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption, Advances in Cryptology \u2013 EUROCRYPT 2023","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"B. Li, D. Micciancio, On the Security of Homomorphic Encryption on Approximate Numbers, In: Canteaut, A., Standaert, FX, (eds) Advances in Cryptology, EUROCRYPT 2021, Lecture Notes in Computer Science, vol 12696, Springer","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"B. Li, D. Micciancio, M. Schultz and J. Sorrell, Securing Approximate Homomorphic Encryption Using Differential Privacy, In: Dodis, Y., Shrimpton, T. (eds) Advances in Cryptology, CRYPTO 2022, Lecture Notes in Computer Science, vol 13507, Springer","DOI":"10.1007\/978-3-031-15802-5_20"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Z. Liu, D. Micciancio, and Y. Polyakov, Large-precision homomorphic sign evaluation using FHEW\/TFHE bootstrapping, IACR Cryptol. ePrint Arch., 2021\/1337, 2021","DOI":"10.1007\/978-3-031-22966-4_5"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"D. Micciancio, and Y. Polyakov, Bootstrapping in FHEW-like Cryptosystems, Association for Computing Machinery, New York, NY, USA, 17\u201328, 2021","DOI":"10.1145\/3474366.3486924"},{"key":"9_CR25","unstructured":"S. Murphy, R. Player, A Central Limit Framework for Ring-LWE Decryption, Cryptology ePrint Archive, Report 2019\/452, 2019"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"H. Narumanchi, D. Goyal, N. Emmadi, and P. Gauravaram, Performance analysis of sorting of fhe data: Integer-wise comparison vs bit-wise comparison, 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA), 902\u2013908, 2017","DOI":"10.1109\/AINA.2017.85"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"Journal of the ACM (JACM)"},{"key":"9_CR28","unstructured":"R. Schwerdt, L. Benz, W. Beskorovajnov, S. Eilebrecht, J. M\u00fcller-Quade and A. Ottenhues, Sender-binding Key Encapsulation, Cryptology ePrint Archive, Paper 2023\/127, 2023, https:\/\/eprint.iacr.org\/2023\/127"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0875-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T08:04:41Z","timestamp":1733731481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0875-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"ISBN":["9789819608744","9789819608751"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0875-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"10 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}