基于二叉树的簇内分层密钥管理方案

A Key Management Scheme based on Intra-cluster Hierarchical Binary-tree Structure

通过对基于分簇的数据融合隐私保护算法CPDA的分析,提出了一种基于簇内分层随机密钥管理方案.它使用二叉树的逻辑结构,对簇内节点进行重新组织后,传输各自的切片数据,再通过建立密钥树的逻辑层次结构.对整个组密钥进行管理最终实现了在数据融合的同时,保护数据安全通过实验分析,相比于分簇隐私数据融合协议CPDA在具有更好的隐私保护性的同时,更低的数据通信量以及良好的可扩展性.

Through the analysis of the privacy-preserving data aggregation algorithm （CPDA）, this paper proposes a Key Management Scheme based on hierarchical duster, which uses the logic structure of Binary-tree to organize the nodes and transmit slice data. In addition, we design a scheme to build the logical key binary tree by certain rules and can achieve privacy protection when data aggregate. Compared to CPDA, the analysis results show that our scheme cap. obtain higher privacy protection, lower communication overhead and better scalability.