Advertisement

Research on Secure Multi-party Computational Geometry

  • Tao Geng
  • Shoushan Luo
  • Yang Xin
  • Xiaofeng Du
  • Yixian Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7030)

Abstract

With rapid growth of the internet, a plenty of collaboration opportunities exist when organizations and individuals share information or cooperate to compute in a distributed system. The cooperation may occur between mutually untrusted parties or competitors. This problem is referred to Secure Multi-party Computation (SMC) problem. Secure multi-party computational geometry (SMCG) is a new field of SMC. Due to the widely potential applications, the research of SMCG becomes more and more attractive. In this paper, research frameworks of SMCG are demonstrated. From an applied viewpoint, some basic and key techniques for building secure protocols to solve SMCG problems are described. At the same time, future research orientations of the SMCG are proposed in the end.

Keywords

Cryptograph secure multi-party computation computational geometry 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yao, A.-C.: Protocols for Secure Computation. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 160–164 (1982)Google Scholar
  2. 2.
    Goldwasser, S.: Multi-party Computations: Past and Present. In: 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 1–6 (1997)Google Scholar
  3. 3.
    Du, W.-L., Atallah, J.M.: Secure Multi-party Computation Problems and Their Applications: A Review and Open Problems. In: New Security Paradigms Workshop, pp. 11–20 (2001)Google Scholar
  4. 4.
    Atallah, M.J., Du, W.: Secure Multi-party Computational Geometry. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 165–179. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Luo, Y.-L., Huang, L.-S., et al.: Privacy Protection in the Relative Position Determination for two Spatial Geometric Objects. Journal of Computer Research and Development 43, 410–416 (2006)CrossRefGoogle Scholar
  6. 6.
    Luo, Y.-L., Huang, L.-S., et al.: A Protocol for Privacy-Perserving Intersect-Deternimation of Two Polygons. ACTA Electronica Sinica 35, 685–691 (2007)Google Scholar
  7. 7.
    Luo, Y.-L., Huang, L.-S., Zhong, H.: Secure Two-Party Point-Circle Inclusion Problem. Journal of Computer Science and Technology 22, 88–91 (2007)CrossRefGoogle Scholar
  8. 8.
    Luo, Y.-L., Huang, L.-S., et al.: Privace-Preserving Cross Product Protocol and Its Applications. Chinese Journal of Computers 30, 248–254 (2007)Google Scholar
  9. 9.
    Li, S.-D., Dai, Y.-Q.: Secure Two-Party Computational Geometry. Journal of Computer Science and Technology 20, 258–263 (2005)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Li, S.-D., Dai, Y.-Q., et al.: Secure mutli-paty computations of geometric intersections. Journal of Tsinghua University 47, 1692–1695 (2007)zbMATHGoogle Scholar
  11. 11.
    Li, S.-D., Si, T.-G., Dai, Y.-Q.: Secure Multi-party Computation of Set-Inclusion and Graph-Inclusion. Journal of Computer Research and Development 42, 1647–1653 (2005)CrossRefGoogle Scholar
  12. 12.
    Li, S.-D., Dai, Y.-Q., et al.: A Secure Multi-party Computation Solution to Intersection Problems of Sets and Rectangles. Progress in Natural Science 16, 538–545 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Liu, W., Luo, S.-S., et al.: A Study of Secure Two-Party Circle Computation Problem. Journal of Beijing University of Posts and Telecommunications 32, 32–35 (2009)Google Scholar
  14. 14.
    Liu, W., Luo, S.-S., Chen, P.: Privacy-Preserving Point-Line Relation Determination Protocol and Its Applications. Journal of Beijing University of Posts and Telecommunications 32, 72–75 (2008)Google Scholar
  15. 15.
    Luo, S.-S., Liao, G.-C., Liu, W.: A Privacy-Preserving Triangle Inequality Determination Protocol and its Applications. Journal of Beijing University of Posts and Telecommunications 32, 47–51 (2009)Google Scholar
  16. 16.
    Tong, L., Luo, W.-J., et al.: Privacy-Preserving Segment-Ellipse Intersect-Determination Protocol. In: 2nd International Conference on E-Business and Infromation System Security, pp. 1–4 (2010)Google Scholar
  17. 17.
    Goldreich, O.: Secure Multi-party Computation (draft), http://www.wisdom.weizmann.ac.il/~oded/pp.html
  18. 18.
    Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM 28, 637–647 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Naor, M., Pinka, B.: Oblivious Transfer and Polynomial Evaluation. In: 31st ACM Symposium on Theory of Computing, USA, pp. 245–254 (1999)Google Scholar
  20. 20.
    Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28, 270–299 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: 6th ACM Conference on Computer and Communications Security, pp. 120–127 (1999)Google Scholar
  22. 22.
    Luo, Y.-L., Lei, S., Zhang, C.-Y.: Privacy-Preserving Protocols for String Matching. In: 4th International Conference on Network and System Security, pp. 481–485 (2010)Google Scholar
  23. 23.
    Liu, W., Luo, S.-S., Wang, Y.-B.: Secure Multi-Party Comparing Protocol Based on Muti-Threshold Secret Sharing Scheme. In: 6th International Conference on Wireless Communications Networking and Mobile Computing, pp. 1–4 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tao Geng
    • 1
    • 2
    • 3
  • Shoushan Luo
    • 1
    • 2
    • 3
  • Yang Xin
    • 1
    • 2
    • 3
  • Xiaofeng Du
    • 1
    • 2
    • 3
  • Yixian Yang
    • 1
    • 2
    • 3
  1. 1.Information Security CenterBeijing University of Posts and TelecommunicationsChina
  2. 2.National Engineering Laboratory for Disaster Backup and RecoveryChina
  3. 3.Beijing Safe-Code Technology Co. Ltd.China

Personalised recommendations