Privacy-preserving Range Searching

Yifei Yao · Journal of Chinese Computer Systems · 2009

Cooperative computation could occur between non-trusted parties,and privacy concerns often prevent different parties from sharing their data in order to do cooperative computation tasks. Secure multi-party computation deals with this problem. It protects participants' privacy in cooperative computation while ensuring correctness of the computation. This paper addresses the problem of privacy preserving range searching,which is an important problem in privacy preserving computational geometry and plays an important role in many applications. Three solutions are presented in this paper for two types of range searching problem which have different security consideration and complexity,and their correctness and security are also analyzed. In the end,privacy preserving range searching is applied to solve privacy preserving DBSCAN clustering problem.

Read the paper · More papers on PaperTik