检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾玮妮[1,2] 林亚平[2] 何施茗[2] 余建平[3]
机构地区:[1]中国船舶重工集团公司第716研究所,江苏连云港222006 [2]湖南大学信息科学与工程学院,湖南长沙410082 [3]湖南师范大学数学与计算机科学学院,湖南长沙410082
出 处:《通信学报》2012年第10期16-25,共10页Journal on Communications
基 金:国家自然科学基金资助项目(60973031;60903168);国家教育部博士点基金资助项目(20100161110025);湖南省教育厅资助科研项目(10B062);湖南师范大学青年优秀人才培养计划基金资助项目(ET51102)~~
摘 要:提出对聚合中的传感数据提供隐私保护的分布式机制。基于同余的代数特性定义了隐私保护元,无需通信即可实现传感数据的隐私性,且聚合值在簇内得以准确还原。给出了隐私保护元生成方法,该方法无需通信,且支持动态变化的聚合节点。分析表明,与集中式机制相比,避免了基站获取隐私数据及单点失效问题,对分组丢失环境有着更强的健壮性,且通信开销更低;与分布式机制相比,在提高隐私保护有效性的同时通信开销更低。A distributed mechanism was proposed to protect the data privacy during the data aggregation phase. The con- tributions of this mechanism are: 1) Privacy-preserving element taking advantage of the algebraic properties of congru- ence was defined. In privacy- preserving elements, privacy data could be preserved without the extra data exchange, and the aggregation result could be recovered from the perturbed data in the cluster head. 2) A flexible method for generating the privacy- preserving element was given. Thus, nodes could generate their privacy-preserving element without the extra data exchange, and the method was adapted to the dynamic reporting nodes. Extensive analysis showed that: compared with the centralized mechanism, the proposed mechanism has a better resistance to data loss, can avoid the single point problem and also consumes less communication overhead; compared with the other distributed mechanisms, the proposed mechanism is able to preserve privacy more efficiently while consuming less communication overhead.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13