用于云存储的安全容错编码

doi:10.3969/j.issn.1000-436x.2014.03.012

Abstract

Abstract:

A secure regenerating code,called SRCS was proposed to solve the security problem during the process of the fault-tolerant of storage systems,especially the storage system in an extremely open environment such as cloud computing and cloud storage.SRCS achieves the security of the encoding matrix in the regenerating code using the threshold public-key encryption with low redundancy and high efficiency.It is proven that SRCS is secure in the semi-adaptive model using decisional BDHE assumption.

Key words: regenerating codes, fault-tolerant, cloud computing, cloud storage, threshold public-key encryption, decisional BDHE assumption

Peng-xu TAN,Yue CHEN,Ju-long LAN,Hong-yong JIA. Secure fault-tolerant code for cloud storage[J]. Journal on Communications, 2014, 35(3): 109-115.

Figures/Tables 1

References 18

[1]	DEAN J . Experiences with mapreduce,an abstraction for large-scale computation[A]. PACT 2006[C]. Seattle, 2006. 16-20.
[2]	WEATHERSPOON H , KUBIATOWICZ J D . Erasure coding vs replication:a quantitative comparison[A]. The 1st International Workshop on Peer to Peer Systems (IPTPS)[C]. Cambridge,MA,USA, 2002. 1-6.
[3]	WU Y N , DIMAKIS A G , RAMCHANDRANY K . Deterministic regenerating codes for distributed storage[A]. Allerton Conference on Control,Computing and Communication,Urbana-Champaign[C]. Allerton House,Illinois,USA, 2007. 1-8.
[4]	WU Y N . Existence and construction of capacity-achieving network codes for distributed storage[J]. IEEE Journal on Selected Areas in Communications, 2010,28(2): 277-288.
[5]	DIMAKIS A G , ALEXANDROS G . A survey on network codes for distributed storage[J]. Computing Research Repository, 2011,99(3): 476-489.
[6]	HU Y C , XU Y L , WANG X Z . MCR:a mutual cooperative recovery mechanism in peer-to-peer storage systems[A]. The 2nd IEEE International Conference on Broadband Network ＆ Multimedia Technology, Hefei,China, 2009. 681-686.
[7]	HU Y C , XU Y L , WANG X Z , et al. Cooperative recovery of distributed storage systems from multiple losses with network coding[J]. IEEE Journal on Selected Areas in Communications, 2010,28(2): 268-276.
[8]	SHUM K W , HU Y C . Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems[A]. IEEE International Symposium on Information Theory[C]. Saint-Petersburg,Russia, 2011. 1442-1446.
[9]	SHUM K W . Cooperative regenerating codes for distributed storage systems[A]. IEEE International Conference on Communications (ICC)[C]. Hong Kong,China, 2011. 1-5.
[10]	KERMARREC A M , SCOUARNECY N L , STRAUBY G . Repairing multiple failures with coordinated and adaptive regenerating codes[A]. In International Symposium on Network Coding (NetCod)[C]. Rennes,France, 2011. 1-6.
[11]	LI J , WANG X , LI B C . Pipelined regeneration with regenerating codes for distributed storage systems[A]. International Symposium on Network Coding (NetCod)[C]. Rennes,France, 2011. 1-6.
[12]	GKANTSIDIS C , RODRIGUEZ P R . Cooperative security for network coding file distribution[A]. The 25th IEEE International Conference on Computer Communications[C]. Barcelona,Spain, 2006. 1-13.
[13]	LI Q M , LUI J C S . On the security and efficiency of content distribution via network coding[J]. IEEE Transactions on Dependable and Secure Computing, 2012,9(2): 211-221.
[14]	LIN H Y , TZENG W G . A secure decentralized erasure code for distributed networked storage[J]. IEEE Transactions on Parallel and Distributed Systems, 2010,21(11): 1586-1594.
[15]	DIMAKIS A G , PRABHAKARAN V , RAMCHANDRAN K . Decentralized erasure codes for distributed networked storage[J]. IEEE Trans Information Theory, 2006,52(6): 2809-2816.
[16]	QIN B , WU Q H . Provably secure threshold public-key encryption with adaptive security and short ciphertexts[J]. Information Sciences, 2012,210: 67-80.
[17]	RASHMI K V , SHAH N B . Optimal exact-regenerating codes for distributed storage at the MpSR and MBR points via a product-matrix construction[J]. IEEE Transactions on Information Theory, 57(8): 5227-5239.
[18]	BONEH D . Hierarchical identity based encryption with constant size ciphertext[A]. EUROCRYPT[C]. Heidelberg, 2005. 440-456.

Metrics

Recommended 0

No Suggested Reading articles found!

Secure fault-tolerant code for cloud storage

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 18

Related Articles 15

Metrics

Recommended 0

[1]	Ling MA, Qiliang FAN, Ting XU, Guanchen GUO, Shenglin ZHANG, Yongqian SUN, Yuzhi ZHANG. Scheduling framework based on reinforcement learning in online-offline colocated cloud environment [J]. Journal on Communications, 2023, 44(6): 90-102.
[2]	Guanxiong HA, Qiaowen JIA, Hang CHEN, Chunfu JIA. Data popularity-based encrypted deduplication scheme without third-party servers [J]. Journal on Communications, 2022, 43(8): 17-29.
[3]	Huaqun WANG, Zhe LIU, Debiao HE, Jiguo LI. Identity-based provable data possession scheme for multi-source IoT terminal data in public cloud [J]. Journal on Communications, 2021, 42(7): 52-60.
[4]	Jianhong ZHANG, Menglong WU, Jing WANG, Pei LIU, Zhengtao JIANG, Changgen PENG. Secure and verifiable multi-keyword searchable encryption scheme in cloud [J]. Journal on Communications, 2021, 42(4): 139-149.
[5]	Ruiqi LI, Chunfu JIA, Yafei WANG. Multi-key homomorphic proxy re-encryption scheme based on NTRU and its application [J]. Journal on Communications, 2021, 42(3): 11-22.
[6]	Tao FENG, Fanqi KONG, Chunyan LIU, Rong MA, Albettar Maher. Dual verifiable cloud storage scheme based on blockchain [J]. Journal on Communications, 2021, 42(12): 192-201.
[7]	Chunfu JIA, Guanxiong HA, Shaoqiang WU, Hang CHEN, Ruiqi LI. AONT-and-NTRU-based rekeying scheme for encrypted deduplication [J]. Journal on Communications, 2021, 42(10): 67-80.
[8]	Jiawei ZHANG, Jianfeng MA, Zhuo MA, Teng LI. Time-based and privacy protection revocable and traceable data sharing scheme in cloud computing [J]. Journal on Communications, 2021, 42(10): 81-94.
[9]	Wenjuan WANG, Xuehui DU, Dibin SHAN. Construction method of attack scenario in cloud environment based on dynamic probabilistic attack graph [J]. Journal on Communications, 2021, 42(1): 1-17.
[10]	Youliang TIAN,Qin LUO. Verifiable multi-keyword search scheme based on improved Merkle-Tree authentication method [J]. Journal on Communications, 2020, 41(9): 118-129.
[11]	Na WANG,Kun ZHENG,Junsong FU,Jian LI. Method of ciphertext retrieval in mobile edge computing based on block segmentation [J]. Journal on Communications, 2020, 41(7): 95-102.
[12]	Lindong ZHAO,Wenqin ZHUANG,Jianxin CHEN,Liang ZHOU. Hierarchical task offloading in heterogeneous cellular network:modeling and optimization [J]. Journal on Communications, 2020, 41(4): 34-44.
[13]	Junfeng TIAN,Yanbiao WANG,Xinfeng HE,Juntao ZHANG,Wanhe YANG,Ya’nan PANG. Survey on the causal consistency of data [J]. Journal on Communications, 2020, 41(3): 154-167.
[14]	Wenlong KE,Yong WANG,Miao YE,Junqi CHEN. Priority differentiated multicast flow scheduling method in Ceph cloud storage network [J]. Journal on Communications, 2020, 41(11): 40-51.
[15]	Bing LIANG,Wen JI. Multiuser computation offloading for edge-cloud collaboration using submodular optimization [J]. Journal on Communications, 2020, 41(10): 25-36.