{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:24:29Z","timestamp":1773663869332,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T00:00:00Z","timestamp":1429574400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10207-015-0284-y","type":"journal-article","created":{"date-parts":[[2015,4,20]],"date-time":"2015-04-20T12:27:21Z","timestamp":1429532841000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Secure three-party computational protocols for triangle area"],"prefix":"10.1007","volume":"15","author":[{"given":"Liang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wenjing","family":"Lou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,21]]},"reference":[{"key":"284_CR1","doi-asserted-by":"crossref","unstructured":"Liu, L., Chen, X., Lou, W.: A secure three-party computational protocol for triangle area. In: Willy Susilo and Yi Mu, editors, Information Security and Privacy, volume 8544 of Lecture Notes in Computer Science, pp. 82\u201397. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-08344-5_6"},{"key":"284_CR2","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Dehne, F., Sack J.-R., Tamassia, R. (eds.) Algorithms and Data Structures, pp. 165\u2013179. Springer, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-44634-6_16"},{"issue":"5","key":"284_CR3","first-page":"422","volume":"29","author":"L Liu","year":"2012","unstructured":"Liu, L., Chunying, W., Li, S.: Two privacy-preserving protocols for point-curve relation. J. Electron. 29(5), 422\u2013430 (2012)","journal-title":"J. Electron."},{"issue":"3","key":"284_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/1325555.1325568","volume":"51","author":"IA Junglas","year":"2008","unstructured":"Junglas, I.A., Watson, R.T.: Location-based services. Commun. ACM 51(3), 65\u201369 (2008)","journal-title":"Commun. ACM"},{"issue":"6","key":"284_CR5","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1109\/TIFS.2013.2252011","volume":"8","author":"I-T Lien","year":"2013","unstructured":"Lien, I.-T., Lin, Y.-H., Shieh, J.-R., Wu, J.-L.: A novel privacy preserving location-based service protocol with secret circular shift for k-nn search. IEEE Trans. Inform. Forensics Secur. 8(6), 863\u2013873 (2013)","journal-title":"IEEE Trans. Inform. Forensics Secur."},{"key":"284_CR6","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: Proceedings of 23rd Annual Symposium on Foundations of Computer Science, FOCS, vol. 82, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"284_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC \u201987, pp. 218\u2013229, ACM, New York, NY, USA (1987)","DOI":"10.1145\/28395.28420"},{"key":"284_CR9","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) Advances in Cryptology\u2014EUROCRYPT 2007, volume 4515 of Lecture Notes in Computer Science, pp. 52\u201378. Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-72540-4_4"},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography, PKC\u201906, pp. 458\u2013473. Springer-Verlag, Berlin, Heidelberg (2006)","DOI":"10.1007\/11745853_30"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P.: Revisiting the efficiency of malicious two-party computation. In: Naor, M. (ed.) Advances in Cryptology\u2014EUROCRYPT 2007, volume 4515 of Lecture Notes in Computer Science, pp. 79\u201396. Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-72540-4_5"},{"key":"284_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"284_CR13","doi-asserted-by":"crossref","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E.: How many oblivious transfers are needed for secure multiparty computation? In: Proceedings of the 27th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO\u201907, pp. 284\u2013302, Springer-Verlag , Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74143-5_16"},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Horvitz, O., Katz, J.: Universally-composable two-party computation in two rounds. In: Proceedings of the 27th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO\u201907, pp. 111\u2013129. Springer-Verlag, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-74143-5_7"},{"key":"284_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) Advances in Cryptology\u2014CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pp. 577\u2013594. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-14623-7_31"},{"key":"284_CR16","doi-asserted-by":"crossref","unstructured":"Seung G.C., Elbaz, A., Malkin, T., Yung, M.: Secure multi-party computation minimizing online rounds. In: Matsui, M. (ed.) Advances in Cryptology\u2014ASIACRYPT 2009, volume 5912 of Lecture Notes in Computer Science, pp. 268\u2013286. Springer, Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-10366-7_16"},{"key":"284_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, STOC \u201907, pp. 21\u201330, ACM, New York, NY, USA (2007)","DOI":"10.1145\/1250790.1250794"},{"issue":"3","key":"284_CR18","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"key":"284_CR19","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS \u201913, pp. 535\u2013548, New York, NY, USA, ACM (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"284_CR20","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Theory of Cryptography, pp. 342\u2013362. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"284_CR21","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) Advances in Cryptology\u2014EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pp. 280\u2013300. Springer, Berlin Heidelberg (2001)","DOI":"10.1007\/3-540-44987-6_18"},{"key":"284_CR22","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology\u2014CRYPTO 2012, volume 7417 of Lecture Notes in Computer Science, pp. 643\u2013662. Springer, Berlin Heidelberg (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"284_CR23","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay-secure two-party computation system. In: USENIX Security Symposium, pp. 287\u2013302 (2004)"},{"key":"284_CR24","doi-asserted-by":"crossref","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, pp. 257\u2013266. ACM (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"284_CR25","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: Tasty: Tool for automating secure two-party computations. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS \u201910, pp. 451\u2013462. ACM, New York, NY, USA (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology\u2014CRYPTO 2013, volume 8043 of Lecture Notes in Computer Science, pp. 18\u201335. Springer, Berlin Heidelberg (2013)","DOI":"10.1007\/978-3-642-40084-1_2"},{"issue":"3","key":"284_CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. J. Cryptol. 15(3), 177\u2013206 (2002)","journal-title":"J. Cryptol."},{"issue":"2","key":"284_CR28","first-page":"324","volume":"19","author":"S Li","year":"2010","unstructured":"Li, S., Wang, D., Dai, Y.: Efficient secure multiparty computational geometry. Chin. J. Electron. 19(2), 324\u2013328 (2010)","journal-title":"Chin. J. Electron."},{"issue":"1","key":"284_CR29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s11390-007-9011-0","volume":"22","author":"Y Luo","year":"2007","unstructured":"Luo, Y., Huang, L., Zhong, H.: Secure two-party point-circle inclusion problem. J. Comput. Sci. Technol. 22(1), 88\u201391 (2007)","journal-title":"J. Comput. Sci. Technol."},{"key":"284_CR30","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) Theory of Cryptography volume 4948 of Lecture Notes in Computer Science, pp. 155\u2013175. Springer, Berlin Heidelberg (2008)","DOI":"10.1007\/978-3-540-78524-8_10"},{"issue":"3","key":"284_CR31","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s00145-011-9098-x","volume":"25","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. J. Cryptol. 25(3), 383\u2013433 (2012)","journal-title":"J. Cryptol."},{"key":"284_CR32","doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Secure two-party k-means clustering. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS \u201907, pp. 486\u2013497, New York, NY, USA, ACM (2007)","DOI":"10.1145\/1315245.1315306"},{"issue":"3","key":"284_CR33","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J Feigenbaum","year":"2006","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. ACM Trans. Algorithms 2(3), 435\u2013472 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"284_CR34","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"284_CR35","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/1721654.1721674","volume":"53","author":"S Yekhanin","year":"2010","unstructured":"Yekhanin, S.: Private information retrieval. Commun. ACM 53(4), 68\u201373 (2010)","journal-title":"Commun. ACM"},{"key":"284_CR36","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, EC \u201999, pp. 129\u2013139. ACM, New York, NY, USA (1999)","DOI":"10.1145\/336992.337028"},{"key":"284_CR37","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS\u201913, pp. 789\u2013800, New York, NY, USA, ACM (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"284_CR38","doi-asserted-by":"crossref","unstructured":"Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: a review and open problems. In: Proceedings of the 2001 Workshop on New Security Paradigms, NSPW \u201901, pp. 13\u201322, New York, NY, USA, ACM (2001)","DOI":"10.1145\/508171.508174"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-015-0284-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-015-0284-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-015-0284-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T16:44:50Z","timestamp":1566578690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-015-0284-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,21]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10207-015-0284-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,21]]}}}