ePrints

Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage [适用于再生编码分布式存储的轻量型隐私保护审计方案]

Lookup NU author(s): Guangjun Liu, Dr Changyu Dong

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

© 2021, Editorial Board of Journal on Communications. All right reserved. 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.

Publication metadata

Author(s): Liu G, Guo W, Xiong J, Liu X, Dong C

Publication type: Article

Publication status: Published

Journal: Tongxin Xuebao/Journal on Communications

Year: 2021

Volume: 42

Issue: 7

Pages: 220-230

Print publication date: 25/07/2021

Acceptance date: 02/08/2018

ISSN (print): 1000-436X

Publisher: Journal on Communications

URL: https://doi.org/10.11959/j.issn.1000-436x.2021116

DOI: 10.11959/j.issn.1000-436x.2021116

Altmetrics

Share