Journal on Communications ›› 2021, Vol. 42 ›› Issue (7): 220-230.doi: 10.11959/j.issn.1000-436x.2021116

• Correspondences • Previous Articles     Next Articles

Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage

Guangjun LIU1, Wangmei GUO2, Jinbo XIONG3, Ximeng LIU4, Changyu DONG5   

  1. 1 School of Information Engineering, Xi’an University, Xi’an 710065, China
    2 State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China
    3 College of Mathematics and Informatics, Fujian Normal University, Fuzhou 350117, China
    4 College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China
    5 School of Computing, Newcastle University, Newcastle NE4 5TG, UK
  • Revised:2021-03-01 Online:2021-07-25 Published:2021-07-01
  • Supported by:
    The National Natural Science Foundation of China(61872088);The National Natural Science Foundation of China(U1905211);The National Natural Science Foundation of China(62072109);The National Natural Science Foundation of China(U1804263);The Natural Science Foundation of Fujian Province(2019J01276);The Natural Science Foundation of Shaanxi Province(2021JQ-196);The China Postdoctoral Science Foundation(2019M663629);The Xi’an Science and Technology Project(2020KJWL02)

Abstract:

To reduce the security implementation cost of the outsourcing data audit mechanism for the regenerating-coding-based distributed storage systems, an orthogonal algebraic coding method was put forward to construct a lightweight privacy-preserving audit scheme based on linear homomorphic authentication.The homomorphic authentication tags were generated with the orthogonalization between the file encoded data and the private secret key vector, and the privacy protection of the auditing response message was achieved by using the random masking that was constructed by randomizing the orthogonal basis vectors of the specific sub-vector of the user’s secret key.The work realized the effective integration of algebraic coding, privacy protection, and security auditing.Theoretical analysis shows that the proposed scheme can realize the information-theoretic security in the regenerating-coding-based storage applications.Compared with the existing works, the proposed scheme is of low computational complexity and communication overhead, and better performance advantages.

Key words: data auditing, privacy protection, regenerating code, network coding, distributed storage

CLC Number: 

No Suggested Reading articles found!