Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage
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 authenticatio...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2021-07-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021116/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539310017314816 |
---|---|
author | Guangjun LIU Wangmei GUO Jinbo XIONG Ximeng LIU Changyu DONG |
author_facet | Guangjun LIU Wangmei GUO Jinbo XIONG Ximeng LIU Changyu DONG |
author_sort | Guangjun LIU |
collection | DOAJ |
description | 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. |
format | Article |
id | doaj-art-c74df7bdb4034e91bcf0cdcba3badd3e |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2021-07-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-c74df7bdb4034e91bcf0cdcba3badd3e2025-01-14T07:22:38ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2021-07-014222023059744322Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storageGuangjun LIUWangmei GUOJinbo XIONGXimeng LIUChangyu DONGTo 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021116/data auditingprivacy protectionregenerating codenetwork codingdistributed storage |
spellingShingle | Guangjun LIU Wangmei GUO Jinbo XIONG Ximeng LIU Changyu DONG Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage Tongxin xuebao data auditing privacy protection regenerating code network coding distributed storage |
title | Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage |
title_full | Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage |
title_fullStr | Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage |
title_full_unstemmed | Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage |
title_short | Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage |
title_sort | lightweight privacy protection data auditing scheme for regenerating coding based distributed storage |
topic | data auditing privacy protection regenerating code network coding distributed storage |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2021116/ |
work_keys_str_mv | AT guangjunliu lightweightprivacyprotectiondataauditingschemeforregeneratingcodingbaseddistributedstorage AT wangmeiguo lightweightprivacyprotectiondataauditingschemeforregeneratingcodingbaseddistributedstorage AT jinboxiong lightweightprivacyprotectiondataauditingschemeforregeneratingcodingbaseddistributedstorage AT ximengliu lightweightprivacyprotectiondataauditingschemeforregeneratingcodingbaseddistributedstorage AT changyudong lightweightprivacyprotectiondataauditingschemeforregeneratingcodingbaseddistributedstorage |