{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:20:18Z","timestamp":1725567618498},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642165146"},{"type":"electronic","value":"9783642165153"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16515-3_27","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T12:03:44Z","timestamp":1286971424000},"page":"212-219","source":"Crossref","is-referenced-by-count":2,"title":["A Secure Protocol for Point-Segment Position Problem"],"prefix":"10.1007","author":[{"given":"Yi","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongxiang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoyan","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","first-page":"160","volume-title":"Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"},{"key":"27_CR2","first-page":"218","volume-title":"Proceedings of the 19th ACM Symposium on Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play mental game. In: Proceedings of the 19th ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"27_CR3","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 New Security Paradigms Workshop, Cloudcroft, New Mexico, USA, pp. 11\u201320 (2001)","DOI":"10.1145\/508171.508174"},{"key":"27_CR4","unstructured":"Goldreich, O.: Secure multi-party computation. (manuscript version 1.3) (2002), http:\/\/theory.lcs.mit.edu\/~oded"},{"issue":"4","key":"27_CR5","first-page":"578","volume":"15","author":"Y. Luo","year":"2006","unstructured":"Luo, Y., Huang, L., Zhong, H., et al.: A Secure protocol for determining whether a point is inside a convex polygon. Chinese Journal of Electronics\u00a015(4), 578\u2013582 (2006)","journal-title":"Chinese Journal of Electronics"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology\u00a016(3), 143\u2013184 (2003)","journal-title":"Journal of Cryptology"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Algorithms and Data Structures","author":"M.J. Atllah","year":"2001","unstructured":"Atllah, M.J., Du, W.: Secure multi-party computation on geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 165\u2013179. Springer, Heidelberg (2001)"},{"key":"27_CR8","first-page":"109","volume-title":"MM&Sec 2007","author":"J. Ramon","year":"2007","unstructured":"Ramon, J., Katzenbesser, S.: A secure multimensional point inclusion protocol. In: MM&Sec 2007, Texas, USA, pp. 109\u2013120. ACM, New York (2007)"},{"key":"27_CR9","unstructured":"Sang, Y., Shen, H.: A scheme for testing privacy state in perasive sensor network. In: NINA 2005 (2005)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1016\/S0010-4485(97)00023-7","volume":"29","author":"K.C. Hui","year":"1997","unstructured":"Hui, K.C.: A robust point inclusion algorithm regions bounded by parametric curve segments. Computer-aided design\u00a029, 771\u2013778 (1997)","journal-title":"Computer-aided design"},{"key":"27_CR11","first-page":"100","volume-title":"IEEE International Symposium on Information Engineering and Electronic Commerce, IEEC 2009","author":"Y. Ye","year":"2009","unstructured":"Ye, Y., Huang, L., Yang, W., Zhou, Z.: Efficient secure protocol to determine whether a point is inside a convex hull. In: IEEE International Symposium on Information Engineering and Electronic Commerce, IEEC 2009, pp. 100\u2013105. IEEE Press, Los Alamitos (2009)"},{"key":"27_CR12","unstructured":"Amirbekyan, A., Estivill-Castro, V.: A new efficient private preserving scalar product protocol. In: 6th Australasian Data Mining Conference (AusDM 2007), pp. 209\u2013214 (2007)"},{"key":"27_CR13","unstructured":"Du, W., Zhan, Z.: Building decision tree lassifier on private data. In: IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, pp. 1\u20138 (2002)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Wang, I.-C., Shen, C., et al.: Towards empirical aspects of secure scalar product. In: International Conference on Information Security and Assurance, pp. 573\u2013578 (2008)","DOI":"10.1109\/ISA.2008.78"},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/319709.319726","volume-title":"Proceedings of the 6th ACM Conference on Computer and Communications Security","author":"C. Cachin","year":"1999","unstructured":"Cachin, C.: Efficient private bidding and auctions with an obvious third party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 120\u2013127. ACM Press, New York (1999)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for Yao\u2019s millionaires\u2019 problem. In: Proceedings of the 36th Hawaii International Conference on System Sciences, HICSS 2003 (2003)","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11496137_31","volume-title":"Applied Cryptography and Network Security","author":"H.Y. Lin","year":"2005","unstructured":"Lin, H.Y., Tzeng, W.G.: An efficient solution to the millionaires\u2019 problem based on hormonoorphic encryption. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 456\u2013466. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16515-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T19:38:36Z","timestamp":1636659516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16515-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642165146","9783642165153"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16515-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}