Abstract
Privacy Preserving Computation Geometry is an important direction in the application of Secure Multi-party Computation and contains many research subjects, such as intersection problem, point-inclusion problem, convex hull, rang searching and so on. Particularly, point-inclusion problem is of great practical significance in our daily life. In this paper, we will devote our attention to the point-segment position problem in point-inclusion and aim to determine the relationship of a point and a segment. In our solution, we present a concise secure protocol based on two basic protocols, secure scalar product protocol and secure comparison protocol. Compared with precious solutions, which may disclose at least one inside point, our protocol performs better in terms of preserving privacy. It will not reveal any inside point, which is crucially significant in some special occasion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, pp. 160–164. IEEE Computer Society Press, Los Alamitos (1982)
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–229. ACM Press, New York (1987)
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–20 (2001)
Goldreich, O.: Secure multi-party computation. (manuscript version 1.3) (2002), http://theory.lcs.mit.edu/~oded
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 15(4), 578–582 (2006)
Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. Journal of Cryptology 16(3), 143–184 (2003)
Atllah, M.J., Du, W.: Secure multi-party computation on geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 165–179. Springer, Heidelberg (2001)
Ramon, J., Katzenbesser, S.: A secure multimensional point inclusion protocol. In: MM&Sec 2007, Texas, USA, pp. 109–120. ACM, New York (2007)
Sang, Y., Shen, H.: A scheme for testing privacy state in perasive sensor network. In: NINA 2005 (2005)
Hui, K.C.: A robust point inclusion algorithm regions bounded by parametric curve segments. Computer-aided design 29, 771–778 (1997)
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–105. IEEE Press, Los Alamitos (2009)
Amirbekyan, A., Estivill-Castro, V.: A new efficient private preserving scalar product protocol. In: 6th Australasian Data Mining Conference (AusDM 2007), pp. 209–214 (2007)
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–8 (2002)
Wang, I.-C., Shen, C., et al.: Towards empirical aspects of secure scalar product. In: International Conference on Information Security and Assurance, pp. 573–578 (2008)
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–127. ACM Press, New York (1999)
Ioannidis, I., Grama, A.: An efficient protocol for Yao’s millionaires’ problem. In: Proceedings of the 36th Hawaii International Conference on System Sciences, HICSS 2003 (2003)
Lin, H.Y., Tzeng, W.G.: An efficient solution to the millionaires’ problem based on hormonoorphic encryption. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 456–466. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Y., Sun, H., Zhang, H., Wen, Q. (2010). A Secure Protocol for Point-Segment Position Problem. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-16515-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16514-6
Online ISBN: 978-3-642-16515-3
eBook Packages: Computer ScienceComputer Science (R0)