Abstract
Intersection and union of convex polygons are basic issues in computational geometry, they can settle lots of matters such as economy and military affairs. To solve the problem that traditional method of making the polygons public could not satisfy the requirements of personal privacy, the protocol to compute intersection and union of convex polygons in secure two-party computation(STC) model was investigated. Along with the scan line algorithm and secret comparison protocol, the protocol completes the calculation without leaking so much information. The security and complexity analysis of the protocol are also given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Du, W., Mikhail, J.A.: Privacy-preserving Cooperative Scientific Computation. In: 14th IEEE Computer Security Foundations Workshop, Nova Scotia, Canada, pp. 273–282 (2001)
Yao, Y., Huang, L., Luo, Y.: Privacy-preserving Matrix Rank Computation and Its Applications. Chinese Journal of Electronics 17(3), 481–486 (2008)
Li, S., Dai, Y.: Secure Two-Party Computational Geometry. Journal of Computer Science and Technology 20(2), 259–263 (2005)
Yao, A.C.: Protocol for Secure Computations (extended abstract). In: 21st Annual IEEE Symposium on the Foundations of Computer Science, pp. 160–164. IEEE Press, New York (1982)
Yehuda, L., Benny, P.: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In: 26th Annual International Conference on Advances in Cryptology, Barcelona, Spain, pp. 52–78 (2007)
Hawashin, B., Fotouhi, F., Truta, T.M.: A Privacy Preserving Efficient Protocol for Semantic Similarity Join Using Long String Attributes. In: Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society, PAIS 2011, article 6. ACM, New York (2011)
Dowsley, R., van de Graaf, J., Marques, D., Nascimento, C.A.: A Two-Party Protocol with Trusted Initializer for Computing the Inner Product. In: Chung, Y., Yung, M. (eds.) WISA 2010. LNCS, vol. 6513, pp. 337–350. Springer, Heidelberg (2011)
Hardt, M., Talwar, K.: On the Geometry of Differential Privacy. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 705–714. ACM, New York (2010)
Eppstein, D., Goodrich, M.T., Tamassia, R.: Privacy-preserving Data-oblivious Geometric Algorithms for Geographic Data. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2010, pp. 13–22. ACM, New York (2010)
Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient Robust Private Set Intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 125–142. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yao, Y., Tian, M., Ning, S., Yang, W. (2011). Protocol to Compute Polygon Intersection in STC Model. In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_81
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)