{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:13:11Z","timestamp":1726359191636},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"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":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10207-024-00895-z","type":"journal-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T20:02:29Z","timestamp":1722456149000},"page":"3415-3432","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-preserving two-party computation of line segment intersection"],"prefix":"10.1007","volume":"23","author":[{"given":"Sorour","family":"Sheidani","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Zarei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,31]]},"reference":[{"key":"895_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Workshop on algorithms and data structures, pp. 165\u2013179. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44634-6_16"},{"issue":"09","key":"895_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 28(09), 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"895_CR3","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry: introduction. In: Computational geometry: algorithms and applications, pp. 1\u201317 (2008)","DOI":"10.1007\/978-3-662-03427-9_1"},{"key":"895_CR4","doi-asserted-by":"crossref","unstructured":"Bui, D., Couteau, G.: Improved private set intersection for sets with small entries. In: IACR international conference on public-key cryptography, pp. 190\u2013220. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-31371-4_7"},{"key":"895_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: International conference on the theory and applications of cryptographic techniques, pp. 316\u2013334. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45539-6_22"},{"key":"895_CR6","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Advances in cryptology-CRYPTO 2012. pp. 643\u2013662. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"895_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/B978-044482537-7\/50008-5","volume":"7","author":"L De Floriani","year":"2000","unstructured":"De Floriani, L., Magillo, P., Puppo, E.: Applications of computational geometry to geographic information systems. Handb. Comput. Geom. 7, 333\u2013388 (2000)","journal-title":"Handb. Comput. Geom."},{"issue":"3","key":"895_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3484","volume":"30","author":"M Dehghan","year":"2019","unstructured":"Dehghan, M., Sadeghiyan, B.: Privacy-preserving collision detection of moving objects. Trans. Emerg. Telecommun. Technol. 30(3), e3484 (2019)","journal-title":"Trans. Emerg. Telecommun. Technol."},{"issue":"6","key":"895_CR9","first-page":"1175","volume":"20","author":"L Fang","year":"2018","unstructured":"Fang, L., Li, S., Wang, W.: An efficient protocol for privately determining the relationship between two straight lines. Int. J. Netw. Secur. 20(6), 1175\u20131182 (2018)","journal-title":"Int. J. Netw. Secur."},{"key":"895_CR10","doi-asserted-by":"crossref","unstructured":"Frikken, K.B., Atallah, M.J.: Privacy preserving route planning. In: Proceedings of the 2004 ACM workshop on Privacy in the electronic society, pp. 8\u201315. Association for Computing Machinery, New York (2004)","DOI":"10.1145\/1029179.1029182"},{"key":"895_CR11","volume-title":"Foundations of cryptography: volume 2, basic applications","author":"O Goldreich","year":"2009","unstructured":"Goldreich, O.: Foundations of cryptography: volume 2, basic applications. Cambridge University Press, Cambridge (2009)"},{"key":"895_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient secure two-party protocols: techniques and constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient secure two-party protocols: techniques and constructions. Springer, Berlin (2010)"},{"issue":"551","key":"895_CR13","first-page":"1","volume":"2010","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: A note on the relation between the definitions of security for semi-honest and malicious adversaries. Cryptol. ePrint Arch. 2010(551), 1\u20134 (2010)","journal-title":"Cryptol. ePrint Arch."},{"key":"895_CR14","doi-asserted-by":"crossref","unstructured":"Heath, D.: Efficient arithmetic in garbled circuits. In: Annual international conference on the theory and applications of cryptographic techniques, pp. 3\u201331. Springer (2024)","DOI":"10.1007\/978-3-031-58740-5_1"},{"key":"895_CR15","doi-asserted-by":"crossref","unstructured":"Hirt, M., Lucas, C., Maurer, U., Raub, D.: Passive corruption in statistical multi-party computation. In: Information theoretic security: 6th international conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012. Proceedings 6, pp. 129\u2013146. Springer","DOI":"10.1007\/978-3-642-32284-6_8"},{"key":"895_CR16","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: How to simulate it-a tutorial on the simulation proof technique. In: Tutorials on the Foundations of Cryptography, pp. 277\u2013346 (2017)","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"895_CR17","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Advances in cryptology-EUROCRYPT 2007: 26th annual international conference on the theory and applications of cryptographic techniques, Barcelona, Spain, May 20\u201324, 2007. Proceedings 26, pp. 52\u201378. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72540-4_4"},{"issue":"1","key":"895_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10207-015-0284-y","volume":"15","author":"L Liu","year":"2016","unstructured":"Liu, L., Chen, X., Lou, W.: Secure three-party computational protocols for triangle area. Int. J. Inf. Secur. 15(1), 1\u201313 (2016). https:\/\/doi.org\/10.1007\/s10207-015-0284-y","journal-title":"Int. J. Inf. Secur."},{"issue":"3","key":"895_CR19","first-page":"1237","volume":"60","author":"W Liu","year":"2019","unstructured":"Liu, W., Xu, Y., Yang, J.C., Yu, W., Chi, L.: Privacy-preserving quantum two-party geometric intersection. Comput. Mater. Contin. 60(3), 1237\u20131250 (2019)","journal-title":"Comput. Mater. Contin."},{"issue":"1","key":"895_CR20","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1186\/s40064-016-3061-0","volume":"5","author":"X Liu","year":"2016","unstructured":"Liu, X., Li, S., Liu, J., Chen, X., Xu, G.: Secure multiparty computation of a comparison problem. Springerplus 5(1), 1489 (2016). https:\/\/doi.org\/10.1186\/s40064-016-3061-0","journal-title":"Springerplus"},{"key":"895_CR21","doi-asserted-by":"crossref","unstructured":"Liu, X., Liu, X.: Securely similarity determination of convex geometry graphics under the malicious model. In: Proceedings of TEPEN 2022, proceedings of TEPEN 2022, pp. 422\u2013434. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-26193-0_36"},{"key":"895_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.comcom.2021.09.011","volume":"180","author":"X Liu","year":"2021","unstructured":"Liu, X., Zhang, R., Xu, G., Chen, X.B., Xiong, N.N.: Confidentially judging the relationship between an integer and an interval against malicious adversaries and its applications. Comput. Commun. 180, 115\u2013125 (2021)","journal-title":"Comput. Commun."},{"key":"895_CR23","doi-asserted-by":"crossref","unstructured":"Makri, E., Rotaru, D., Vercauteren, F., Wagh, S.: Rabbit: efficient comparison for secure multi-party computation. In: International conference on financial cryptography and data security, pp. 249\u2013270. Springer, Berlin (2021)","DOI":"10.1007\/978-3-662-64322-8_12"},{"issue":"3","key":"895_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TST.2016.7488738","volume":"21","author":"B Mu","year":"2016","unstructured":"Mu, B., Bakiras, S.: Private proximity detection for convex polygons. Tsinghua Sci. Technol. 21(3), 270\u2013280 (2016)","journal-title":"Tsinghua Sci. Technol."},{"key":"895_CR25","unstructured":"Ng, K.S.: Extending the paillier cryptosystem to handle floating point numbers (2017). https:\/\/mentalmodels4life.net\/2017\/08\/13\/extending-the-paillier-cryptosystem-to-handle-floating-point-numbers\/. Accessed 05 Feb 2024"},{"key":"895_CR26","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques, pp. 223\u2013238. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"2","key":"895_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Priv. and Secur. (TOPS) 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Priv. and Secur. (TOPS)"},{"key":"895_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jnca.2014.08.004","volume":"46","author":"J Qin","year":"2014","unstructured":"Qin, J., Duan, H., Zhao, H., Hu, J.: A new lagrange solution to the privacy-preserving general geometric intersection problem. J. Netw. Comput. Appl. 46, 94\u201399 (2014)","journal-title":"J. Netw. Comput. Appl."},{"key":"895_CR29","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ins.2014.04.004","volume":"282","author":"L Shundong","year":"2014","unstructured":"Shundong, L., Chunying, W., Daoshun, W., Yiqi, D.: Secure multiparty computation of solid geometric problems and their applications. Inf. Sci. 282, 401\u2013413 (2014)","journal-title":"Inf. Sci."},{"key":"895_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-0007-4","volume-title":"Mathematics and its history","author":"J Stillwell","year":"1989","unstructured":"Stillwell, J., Stillwell, J.: Mathematics and its history, vol. 3. Springer, New York (1989)"},{"key":"895_CR31","doi-asserted-by":"crossref","unstructured":"Toft, T.: A secure priority queue; or: On secure datastructures from multiparty computation. In: Information Security and Cryptology-ICISC 2013. pp. 20\u201333. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12160-4_2"},{"issue":"1","key":"895_CR32","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s11128-022-03779-0","volume":"22","author":"C Wang","year":"2022","unstructured":"Wang, C., Zhou, R.G.: Secure multi-party convex hull protocol based on quantum homomorphic encryption. Quantum Inf. Process. 22(1), 24 (2022). https:\/\/doi.org\/10.1007\/s11128-022-03779-0","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"895_CR33","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2021.3125006","volume":"68","author":"Z Wang","year":"2021","unstructured":"Wang, Z., Banawan, K., Ulukus, S.: Private set intersection: a multi-message symmetric private information retrieval perspective. IEEE Trans. Inf. Theory 68(3), 2001\u20132019 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"895_CR34","first-page":"1071","volume":"21","author":"Q Wei","year":"2019","unstructured":"Wei, Q., Li, S., Wang, W., Yang, Y.: Privacy-preserving computational geometry. Int. J. Netw. Secur. 21(6), 1071\u20131080 (2019)","journal-title":"Int. J. Netw. Secur."},{"key":"895_CR35","unstructured":"William, H., Jonathan, M.: Secure multiparty computation: line segment intersection evaluation (2014)"},{"key":"895_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd annual symposium on foundations of computer science (SFCs 1982), pp. 160\u2013164. IEEE, USA (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"895_CR37","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ins.2018.10.024","volume":"476","author":"C Zhao","year":"2019","unstructured":"Zhao, C., Zhao, S., Zhao, M., Chen, Z., Gao, C.Z., Li, H., Tan, Y.A.: Secure multi-party computation: theory, practice and applications. Inf. Sci. 476, 357\u2013372 (2019)","journal-title":"Inf. Sci."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00895-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-024-00895-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-024-00895-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T01:07:23Z","timestamp":1726276043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-024-00895-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,31]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["895"],"URL":"https:\/\/doi.org\/10.1007\/s10207-024-00895-z","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2024,7,31]]},"assertion":[{"value":"31 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The current study does not involves humans or animals.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}]}}