A NEW PRIVACY-PRESERVING EUCLID-DISTANCE PROTOCOL AND ITS APPLICATIONS IN WSNS  

作　　者：Chen Ping Ji Yimu Wang Ruchuan Huang Haiping Zhang Dan 

机构地区：[1]College of Computer,Nanjing University of Posts and Telecommunications [2]Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks [3]Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education,Nanjing University of Posts and Telecommunications

出　　处：《Journal of Electronics(China)》2013年第2期190-197,共8页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation ofChina(No.61170065,61003039);Postdoctoral Foundation(2012M511753,1101011B);Science & Technology Innovation Fund for Higher Education Institutions of Jiangsu Province(CXLX12_0486);the Priority Academic Program Development of Jiangsu Higher Education Institutions(yx002001)

摘　　要：Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.Recently, privacy concerns become an increasingly critical issue. Secure multi-party com- putation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively com- puting the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks （WSNs）, based on the novel Euclid-distance protocol and Density-Based Clustering Protocol （DBCP）, so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location infor- mation to the opposite side.

关 键 词：Secure multi-party computation PRIVACY-PRESERVING Euclid-distance protocol Wireless Sensor Networks (WSNs) Density-Based Clustering Protocol (DBCP) 

分 类 号：TP305[自动化与计算机技术—计算机系统结构]