A secure multi-party computation solution to intersection problems of sets and rectangles

Abstract Secure multi-party computation (SMC) is a research focus in international cryptographic community. At present' there is no SMC to the intersection problem of sets. In this paper' we first propose a SMC solution to this problem. Applying Cantor encoding method to computational geometry problems' and based on the solution to set-intersection problem' we further propose solutions to points inclusion problem and intersection problem of rectangles and further prove their privacy-preserving property with widely accepted simulation paradigm. Compared with the known solutions' these new solutions are of less computational complexity and less communication complexity' and have obvious superiority in computational and communication complexity. * Supported by National Natural Science Foundation of China (Grant No.90304014) and Hi-tech Research and Development Program of china (Grant No 2005AA114160)

[1]  Wenliang Du,et al.  Secure Multi-party Computational Geometry , 2001, WADS.

[2]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[3]  Yunghsiang Sam Han,et al.  Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification , 2004, SDM.

[4]  Peter Winkler,et al.  Comparing information without leaking it , 1996, CACM.

[5]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[6]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[7]  Shundong Li,et al.  Secure Two-Party Computational Geometry , 2005, Journal of Computer Science and Technology.

[8]  Wenliang Du,et al.  Privacy-preserving cooperative scientific computations , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..