位置:成果数据库 > 期刊 > 期刊详情页
A NEW PRIVACY-PRESERVING EUCLID-DISTANCE PROTOCOL AND ITS APPLICATIONS IN WSNS
  • ISSN号:0217-9822
  • 期刊名称:《电子科学学刊:英文版》
  • 时间:0
  • 分类:TP305[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China, [2]Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China, [3]Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • 相关基金:Supported by the National NaturM Science Foundation of China (No. 61170065, 61003039), Postdoctoral Founda- tion (2012M511753, 1101011B), Science & Technology Innovation Fund for Higher Education Institutions of Jiangsu Province (CXLX12_0486), and 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.

同期刊论文项目
期刊论文 84 会议论文 1 专利 11 著作 1
期刊论文 81 会议论文 2
同项目期刊论文
期刊信息
  • 《电子科学学刊:英文版》
  • 主管单位:中国科学院
  • 主办单位:中国科学院电子学研究所
  • 主编:朱敏慧
  • 地址:北京2702信箱
  • 邮编:100080
  • 邮箱:jc@mail.ie.ac.cn
  • 电话:010-62551772
  • 国际标准刊号:ISSN:0217-9822
  • 国内统一刊号:ISSN:11-2003/TN
  • 邮发代号:
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,荷兰文摘与引文数据库,英国科学文摘数据库
  • 被引量:73