一种容错的传感器网络数据融合隐私保护算法
由于网络通信具有易错的特点,提出一种具有容错性的隐私保护数据聚集算法。通过椭圆曲线加密方案对节点数据进行加密,保证数据的隐私性,采用加同态加密技术,实现了端到端的聚集加密,节省能耗和带宽。同时,构造轨道图拓扑结构,使得每个节点有多个父节点,当节点与主父节点发生链路失效时,其他父节点能够修复聚集值。仿真实验结果显示,提出的方案在适当增加通信量的情况下,具有较高的数据安全性、很好的容错性和高精度的聚集值。...
        Saved in:
      
    
          | Published in | 计算机应用研究 Vol. 31; no. 5; pp. 1499 - 1502 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | Chinese | 
| Published | 
            Engineering Technology Research Center on Network & Information Security,Anhui Normal University,Wuhu Anhui 241003,China
    
        2014
     College of Mathematics & Computer Science,Anhui Normal University,Wuhu Anhui 241003,China  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1001-3695 | 
| DOI | 10.3969/j.issn.1001-3695.2014.05.052 | 
Cover
| Summary: | 由于网络通信具有易错的特点,提出一种具有容错性的隐私保护数据聚集算法。通过椭圆曲线加密方案对节点数据进行加密,保证数据的隐私性,采用加同态加密技术,实现了端到端的聚集加密,节省能耗和带宽。同时,构造轨道图拓扑结构,使得每个节点有多个父节点,当节点与主父节点发生链路失效时,其他父节点能够修复聚集值。仿真实验结果显示,提出的方案在适当增加通信量的情况下,具有较高的数据安全性、很好的容错性和高精度的聚集值。 | 
|---|---|
| Bibliography: | 51-1196/TP wireless sensor networks ; privacy-preserve; data aggregation ; fault-tolerant WANG Tao-chun, LUO Yong-long, ZUO Kai-zhong( 1. a. College of Mathematics & Computer Science, b. Engineering Technology Research Center on Network & Information Security, Anhui Nor- real University, Wuhu Anhui 241003, China) Due to the failure-prone nature of communications, this paper proposed a fault-tolerant and privacy-preserving data aggregation algorithm, which employed an elliptic curve cryptography-based additively homomorphic encryption algorithm to of- fer end-to-end privacy of sensing data, and then savd energy and bandwidth. Meanwhile, construction track graph topology, each node had more than one parent node, so that when a link error in the primary edge, the backup parent could recover the correct aggregate values. The theoretical analysis and simulation results illustrate this scheme has good privacy of data, low communication overhead and high precision aggregate values.  | 
| ISSN: | 1001-3695 | 
| DOI: | 10.3969/j.issn.1001-3695.2014.05.052 |