A SCHEME OF DATA CONFIDENTIALITY AND FAULT-TOLERANCE IN CLOUD STORAGE

被引:0
作者
Fu, Yongkang [1 ,3 ]
Sun, Bin [1 ,2 ]
机构
[1] Beijing Univ Posts & Telecommun, Informat Secur Ctr, State Key Lab NetWorking & Switching Technol, Beijing 100876, Peoples R China
[2] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
[3] Beijing Univ Posts & Telecommun, Natl Engn Lab Disaster Backup & Recovery, Beijing 100876, Peoples R China
来源
2012 IEEE 2ND INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENT SYSTEMS (CCIS) VOLS 1-3 | 2012年
关键词
Cloud Storage; Data security; Data redundancy; Byzantine faults; Tornado code;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The off-premises storage paradigm that comes with cloud storage has incurred great concerns on the security of data, especially the integrity and confidentiality of data. The untrusted cloud providers' complete control over data may endanger data confidentiality, at the same time the invaders or accident of storage device may also damage the availability of data. Our research is mainly concentrated on the confidentiality of data, the recovery of loss data and the repair of error data. We provide a security scheme for the data stored in a remote cloud storage system, and the scheme is based on symmetric encryption technology and erasure codes. Boot password is adopted to avoid the problem of key preservation and management which is used in traditional symmetric encryption technology and tornado code is introduced as the basis for the redundant system to overcome the lost data recovery issues. To the end, keyed-Hash which adds additional error correction function to the tornado code is brought forth to solve the problem of tampering of data. The simulation results show that the scheme is efficient in recovering loss data and provide good resistance to the Byzantine faults, meanwhile it has high computing efficiency, especially when processing a big file.
引用
收藏
页码:228 / 233
页数:6
相关论文
共 12 条
  • [1] Druschel P, 2001, P 8 IEEE WORKSH HOT, VVIII
  • [2] LOW-DENSITY PARITY-CHECK CODES
    GALLAGER, RG
    [J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
  • [3] Hendricks James, 2007, Operating Systems Review, V41, P73, DOI 10.1145/1323293.1294269
  • [4] Kotla R., 2007, 2007 USENIX ANN TECH, P1
  • [5] Luby M., 1998, P 9 ANN ACM SLAM S D, p234~245
  • [6] Luby M. G., 1997, P 29 ANN ACM S THEOR, P150, DOI [DOI 10.1145/258533.258573, 10.1145/258533.258573]
  • [7] Efficient erasure correcting codes
    Luby, MG
    Mitzenmacher, M
    Shokrollahi, MA
    Spielman, DA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 569 - 584
  • [8] Patterson D. A., 1988, P ACM SIGMOD INT C M, P109, DOI DOI 10.1145/50202.50214
  • [9] POLYNOMIAL CODES OVER CERTAIN FINITE FIELDS
    REED, IS
    SOLOMON, G
    [J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02): : 300 - 304
  • [10] Resch J. K., 2011, 9 USENIX FAST