{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:17:03Z","timestamp":1778109423480,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819578191","type":"print"},{"value":"9789819578207","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7820-7_11","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:08:23Z","timestamp":1778108903000},"page":"166-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Prefix-Based Homomorphic Encryption Protocol for\u00a0Efficient Secure Comparison"],"prefix":"10.1007","author":[{"given":"Shutong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baodong","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Bouman, N.J., Schoenmakers, B., de\u00a0Vreede, N.: Fast secure comparison for medium-sized integers and its application in binarized neural networks. In: Cryptographers\u2019 Track at the RSA Conference. LNCS, vol. 11405, pp. 453\u2013472. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_23","DOI":"10.1007\/978-3-030-12612-4_23"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/130929643","volume":"44","author":"B Applebaum","year":"2015","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E., Waters, B.: Encoding functions with constant online rate, or how to compress garbled circuit keys. SIAM J. Comput. 44(2), 433\u2013466 (2015). https:\/\/doi.org\/10.1137\/130929643","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Advances in Cryptology \u2013 CRYPTO 2018. LNCS, vol. 10993, pp. 483\u2013512. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_17","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Bourse, F., Sanders, O., Traor\u00e9, J.: Improved secure integer comparison via homomorphic encryption. In: Cryptographers\u2019 Track at the RSA Conference. LNCS, vol. 12006, pp. 391\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_17","DOI":"10.1007\/978-3-030-40186-3_17"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Brandt, F.: Fully private auctions in a constant number of rounds. In: International Conference on Financial Cryptography. LNCS, vol.\u00a02742, pp. 223\u2013238. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_16","DOI":"10.1007\/978-3-540-45126-6_16"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Carlton, R., Essex, A., Kapulkin, K.: Threshold properties of prime power subgroups with application to secure integer comparisons. In: CT-RSA, pp. 137\u2013156 (2018)","DOI":"10.1007\/978-3-319-76953-0_8"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M.: Efficient and secure comparison for on-line auctions. In: Australasian Conference on Information Security and Privacy. LNCS, vol.\u00a04586, pp. 416\u2013430. Springer, Cham (2007). https:\/\/doi.org\/10.1007\/978-3-540-73458-1_30","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Galal, H.S., Youssef, A.M.: Verifiable sealed-bid auction on the ethereum blockchain. In: International Conference on Financial Cryptography and Data Security. LNCS, vol. 10957, pp. 265\u2013278. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_18","DOI":"10.1007\/978-3-662-58820-8_18"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307\u2013328. ACM (2019). https:\/\/doi.org\/10.1145\/3335741.3335755","DOI":"10.1145\/3335741.3335755"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Kennedy, W.S., Kolesnikov, V., Wilfong, G.: Overlaying circuit clauses for secure computation. In: Advances in Cryptology \u2013 EUROCRYPT 2016. LNCS, vol.\u00a09666, pp. 499\u2013528. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18","DOI":"10.1007\/978-3-662-49896-5_18"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Sadeghi, A.R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: International Conference on Cryptology and Network Security. LNCS, vol.\u00a05888, pp. 1\u201320. Springer, Cham (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_1","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Ma, J., Qi, B., Lv, K.: Three-party integer comparison and applications. In: 2021 IEEE International Performance, Computing, and Communications Conference (IPCCC), pp.\u00a01\u20138. IEEE (2021). https:\/\/doi.org\/10.1109\/IPCCC51483.2021.9679393","DOI":"10.1109\/IPCCC51483.2021.9679393"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Veugen, T.: Improving the DGK comparison protocol. In: 2012 IEEE International Workshop on Information Forensics and Security (WIFS), pp. 49\u201354. IEEE (2012). https:\/\/doi.org\/10.1109\/WIFS.2012.6412624","DOI":"10.1109\/WIFS.2012.6412624"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1109\/JSTSP.2015.2429117","volume":"9","author":"T Veugen","year":"2015","unstructured":"Veugen, T., Blom, F., De Hoogh, S.J.A., Erkin, Z.: Secure comparison protocols in the semi-honest model. IEEE J. Sel. Topics Signal Process. 9(7), 1217\u20131228 (2015). https:\/\/doi.org\/10.1109\/JSTSP.2015.2429117","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7820-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T23:08:24Z","timestamp":1778108904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7820-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819578191","9789819578207"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7820-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ML4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","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":"ml4cs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nsclab.org\/ml4cs2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}