Data Chunks Adjustment Mechanism for Privacy Protection

被引:0
作者
Shi Y.-L. [1 ]
Chen Y. [1 ]
Sun S.-B. [1 ]
Cui L.-Z. [1 ]
机构
[1] School of Computer Science and Technology, Shandong University, Jinan
来源
Jisuanji Xuebao/Chinese Journal of Computers | 2017年 / 40卷 / 12期
关键词
Cloud computing; Data adjustment; Data chunk; Load capacity; Optimal adjustment strategy; Privacy protection;
D O I
10.11897/SP.J.1016.2017.02719
中图分类号
学科分类号
摘要
In the cloud computing environment, the data of the tenant are divided into several data chunks and these data chunks are stored on different data nodes by means of the privacy protection mechanism based on chunk-confusion, in order to realize the privacy protection of data. Although this method can realize the privacy protection of the tenant's data in the plaintext state, due to tenant's privacy needs and data demands are variable, the underlying data chunks structure and storage location in the cloud will change, which makes there still exist a risk of leakage of privacy under the privacy protection mechanism based on chunk-confusion. For example, the store mode of data chunk is {post-code, age, disease}, which means that these three properties can be placed together and it will not reveal the privacy of the tenant' data. When the tenant suddenly adds a new attribute (the worker number) in the store mode of data chunk, if an attacker gets information about this chunk and happens to know an patient's the worker number, then this attacker may know the patient's condition, which is what tenant do not want to see. Therefore, based on chunk-confusion based the mechanism of privacy protection, the paper proposed a kind of mechanism of data chunks adjustment for privacy protection. In the first place, according to the privacy constraints updated by the tenant, the mechanism splits data chunks that go against the privacy constraints in the original privacy protection strategy. In the process of splitting data chunks, the data storage structure of data chunks is kept unchanged as far as possible based on the less dynamic principle to reduce the cost of data transfer and the adjustment cost of privacy protection strategy. In the second place, combined with the privacy constraints, data chunks that do not violate the privacy constraints are reassembled into the new data chunks to enhance the processing efficiency of data and to generate the privacy protection adjusting strategy. In addition, because of the diversity of the data chunks segmentation results, the resulting feasible privacy strategies are not unique. Therefore, considering the privacy requirements, performance requirements, load demands and unequal equalization, the paper proposed an optimal algorithm to select the optimal adjustment strategy to meet all requirements, realizing when the data chunks are adjusted, it can not only reduce the performance and load capacity of the system, but also enhance the effect of privacy protection. Finally, the adjustment mechanism completes the data migration and placement according to the optimized adjustment strategy of privacy protection. In order to verify the effectiveness and performance of the adjustment mechanism of data chunks based on privacy protection proposed in this paper, we designed the simulation experiment from the point of view of the accuracy and privacy of optimal privacy protection strategy, system performance and load, etc. Experimental results prove that the privacy protection adjustment mechanism proposed in this paper can not only find an optimal strategy for privacy protection, but also meet the system's performance and load requirements, and enhances the privacy protection effect of the tenant's data. © 2017, Science Press. All right reserved.
引用
收藏
页码:2719 / 2733
页数:14
相关论文
共 21 条
[1]  
Zhang H., Huang T., Liu S.-Y., Wang L.-N., A privacy-preserving bucket partition mechanism in cloud, Chinese Journal of Computers, 39, 2, pp. 429-440, (2016)
[2]  
Kauthale K., Sunil-D-Rathod, Vertically partitioning of database for secured data release, International Journal of Computer Applications, 117, 21, pp. 1-5, (2015)
[3]  
Mohammed N., Alhadidi D., Benjamin C.-M.-F., Debbabi M., Secure two-party differentially private data release for vertically partitioned data, IEEE Transactions on Dependable and Secure Computing, 11, 1, pp. 59-71, (2014)
[4]  
Wang L.-X., Liu L.-F., Liu S.-L., Et al., A secured distributed and data fragmentation model for cloud storage, Proceedings of the 2013 International Conference on Precision Mechanical Instruments and Measurement Technology, pp. 2693-2699, (2013)
[5]  
Li L., Li Q.-Z., Shi Y.-L., Zhang K., SAPS-A single attribute protection scheme for SaaS, Information, 15, 1, pp. 275-282, (2012)
[6]  
Zhang K., Li Q.-Z., Shi Y.-L., Research on data combination privacy preservation mechanism for SaaS, Chinese Journal of Computers, 33, 11, pp. 2044-2054, (2010)
[7]  
Shao Y.-L., Shi Y.-L., A novel cloud data fragmentation cluster-based privacy preserving mechanism, IJGDC: International Journal of Grid and Distributed Computing, 7, 4, pp. 21-32, (2014)
[8]  
Zhang K., Abraham A., Shi Y.-L., Data combination privacy preservation adjusting mechanism for software as a service, Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics, pp. 2007-2012, (2013)
[9]  
Saroj S.-K., Chauhan S.-K., Sharma A.-K., Vats S., Threshold cryptography based data security in cloud computing, Proceedings of the 2015 IEEE International Conferenceon Computational Intelligence & Communication Technology, pp. 202-207, (2015)
[10]  
Xiong J.-B., Li F.-H., Ma J.-F., Liu X.-M., A full lifecycle privacy protection scheme for sensitive data in cloud computing, Peer-to-Peer Networking and Applications, 8, 6, pp. 1-13, (2014)