{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T21:54:13Z","timestamp":1770155653029,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819564187","type":"print"},{"value":"9789819564194","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-6419-4_16","type":"book-chapter","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T08:57:57Z","timestamp":1770109077000},"page":"272-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient and\u00a0Secure Vector Comparison Protocol in\u00a0a\u00a0Dishonest Majority Environment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-1797","authenticated-orcid":false,"given":"Haibo","family":"Tian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7611-8017","authenticated-orcid":false,"given":"Zhengdong","family":"Liang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1671-1128","authenticated-orcid":false,"given":"Ting","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-12612-4_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"M Abspoel","year":"2019","unstructured":"Abspoel, M., Bouman, N.J., Schoenmakers, B., de Vreede, N.: Fast secure comparison for medium-sized integers and its application in binarized neural networks. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 453\u2013472. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_23"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.56553\/popets-2023-0092","volume":"2023","author":"T Anselme","year":"2023","unstructured":"Anselme, T., Jonas, J., David, B.: A method for securely comparing integers using binary trees. Proc. Priv. Enhancing Technol. 2023(3), 469\u2013487 (2023)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Generalizing the SPDZ compiler for other protocols. In: CCS 2018, pp. 880\u2013895 (2018)","DOI":"10.1145\/3243734.3243854"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 503\u2013513. Association for Computing Machinery, New York (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS 2008, pp. 257\u2013266. Association for Computing Machinery, New York (2008). https:\/\/doi.org\/10.1145\/1455770.1455804","DOI":"10.1145\/1455770.1455804"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"16_CR7","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"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Braun, L., Demmler, D., Schneider, T., Tkachenko, O.: Motion \u2013 a framework for mixed-protocol multi-party computation. ACM Trans. Priv. Secur. 25(2) (2022)","DOI":"10.1145\/3490390"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-76953-0_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"R Carlton","year":"2018","unstructured":"Carlton, R., Essex, A., Kapulkin, K.: Threshold properties of prime power subgroups with application to secure integer comparisons. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 137\u2013156. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_8"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved primitives for secure multiparty integer computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 182\u2013199. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13"},{"key":"16_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":"16_CR12","doi-asserted-by":"publisher","unstructured":"Choi, S.G., Hwang, K.W., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. In: Proceedings of the 12th Conference on Topics in Cryptology, CT-RSA 2012, pp. 416\u2013432. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_26","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Christian, M., Juan, T.P., Jean-Philippe, B., Jean-Pierre, H.: Multiparty homomorphic encryption from ring-learning-with-errors (2021). https:\/\/doi.org\/10.2478\/popets-2021-0071","DOI":"10.2478\/popets-2021-0071"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013300. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Crawford, J.L.H., Gentry, C., Halevi, S., Platt, D., Shoup, V.: Doing real work with FHE: the case of logistic regression. In: WAHC 2018, pp. 1\u201312 (2018)","DOI":"10.1145\/3267973.3267974"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) Theory of Cryptography, pp. 285\u2013304 (2006)","DOI":"10.1007\/11681878_15"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"2382","DOI":"10.1109\/TIFS.2023.3265342","volume":"18","author":"Y Dong","year":"2023","unstructured":"Dong, Y., Chen, X., Song, X., Li, K.: Flexbnn: fast private binary neural network inference with flexible bit-width. IEEE Trans. Inf. Forensics Secur. 18, 2382\u20132397 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1109\/TIFS.2012.2190726","volume":"7","author":"Z Erkin","year":"2012","unstructured":"Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Generating private recommendations efficiently using homomorphic encryption and data packing. IEEE Trans. Inf. Forensics Secur. 7(3), 1053\u20131066 (2012)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"key":"16_CR20","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012)"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. Association for Computing Machinery, New York (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: CCS 2020, pp. 1575\u20131590 (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-78372-7_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Yanai, A.: Efficient maliciously secure multiparty computation for RAM. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 91\u2013124. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_4"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-93638-3_5","volume-title":"Information Security and Privacy","author":"R Kikuchi","year":"2018","unstructured":"Kikuchi, R., Ikarashi, D., Matsuda, T., Hamada, K., Chida, K.: Efficient bit-decomposition and modulus-conversion protocols with an honest majority. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 64\u201382. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_5"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P., Yanai, A.: Efficient constant-round multi-party computation combining BMR and spdz. J. Cryptol. 32(3), 1026\u20131069 (2019)","DOI":"10.1007\/s00145-019-09322-2"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-53641-4_21","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y., Smart, N.P., Soria-Vazquez, E.: More efficient constant-round multi-party computation from BMR and SHE. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 554\u2013581. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_21"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Makri, E., Rotaru, D., Vercauteren, F., Wagh, S.: Rabbit: efficient comparison for secure multi-party computation. In: FC 2021, pp. 249\u2013270 (2021)","DOI":"10.1007\/978-3-662-64322-8_12"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343\u2013360. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_23"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Samet, S., Miri, A.: Privacy-preserving back-propagation and extreme learning machine algorithms. Data Knowl. Eng. 79\u201380, 40\u201361 (2012)","DOI":"10.1016\/j.datak.2012.06.001"},{"issue":"3","key":"16_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3390\/math10030305","volume":"10","author":"T Veugen","year":"2022","unstructured":"Veugen, T.: Lightweight secure integer comparison. Mathematics 10(3), 305 (2022)","journal-title":"Mathematics"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: Securenn: 3-party secure computation for neural network training. Proc. Priv. Enhancing Technol. 2019, 26\u201349 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"16_CR32","doi-asserted-by":"publisher","first-page":"188","DOI":"10.2478\/popets-2021-0011","volume":"2021","author":"S Wagh","year":"2020","unstructured":"Wagh, S., Tople, S., Benhamouda, F., Kushilevitz, E., Mittal, P., Rabin, T.: Falcon: honest-majority maliciously secure framework for private deep learning. Proc. Priv. Enhancing Technol. 2021, 188\u2013208 (2020)","journal-title":"Proc. Priv. Enhancing Technol."},{"issue":"2","key":"16_CR33","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TC.2021.3073171","volume":"73","author":"Z Xia","year":"2024","unstructured":"Xia, Z., Gu, Q., Zhou, W., Xiong, L., Weng, J., Xiong, N.: STR: secure computation on additive shares using the share-transform-reveal strategy. IEEE Trans. Comput. 73(2), 340\u2013352 (2024)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: SFCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"16_CR35","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"16_CR36","unstructured":"Yuan, B., Yang, S., Zhang, Y., Ding, N., Gu, D., Sun, S.F.: MD-ML: super fast privacy-preserving machine learning for malicious security with a dishonest majority. In: Proceedings of the 33rd USENIX Conference on Security Symposium, SEC 2024. USENIX Association, USA (2024)"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Zeng, C., He, D., Feng, Q., Yang, X., Luo, Q.: Epauto: efficient privacy-preserving machine learning on AI-powered autonomous driving systems using multi-party computation. ACM Trans. Auton. Adapt. Syst. (2025)","DOI":"10.1145\/3718743"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Zhou, L., Wang, Z., Cui, H., Song, Q., Yu, Y.: Bicoptor: two-round secure three-party non-linear computation without preprocessing for privacy-preserving machine learning. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 534\u2013551 (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179449","DOI":"10.1109\/SP46215.2023.10179449"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6419-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T08:57:59Z","timestamp":1770109079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6419-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819564187","9789819564194"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6419-4_16","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":"4 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"5 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nsclab.org\/nss-socialsec2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}