基于区块链的电力数据容灾备份方案
Disaster Tolerance and Backup Scheme of Power Data Based on Blockchain
查看参考文献19篇
|
文摘
|
对于种类众多、数量庞大并且安全性要求较高的电力数据,数据容灾备份应具有可扩展性和隐私保护性。为此,基于区块链不可篡改、去中心化和可追溯的特点,将其与AONT和门限秘密分享等密码学技术相结合,提出一种新的电力数据容灾备份方案,并在开源区块链平台以太坊上进行原型系统实现。分析与实验结果表明,该方案能够保证备份数据的一致性、不可篡改性和机密性,并且可扩展性强,可在减少基础设施建设开销的同时规避单点失效的风险。 |
|
其他语种文摘
|
Due to the large volume, various types and high security requirements of power data, its disaster tolerance and backup scheme should provide scalability and privacy protection. Blockchain is tamper-resistant, decentralized and traceable,which caters to such requirements. Therefore,this paper proposes a new blockchain-based disaster recovery and backup scheme of power data, integrating AONT, threshold secret sharing and other cryptographic technologies. The prototype system is implemented on an open-source blockchain platform, Ethereum. Experimental and Analysis results show that the scheme can ensure the consistency,tamper resistance and confidentiality of backup data. It is highly scalable,reducing the construction cost of infrastructure as well as the risk of single point of failure. |
|
来源
|
计算机工程
,2019,45(11):9-15 【扩展库】
|
|
DOI
|
10.19678/j.issn.1000-3428.0053925
|
|
关键词
|
区块链
;
电力数据
;
容灾备份
;
数据安全保护
;
门限秘密分享
;
AONT技术
|
|
地址
|
1.
广州供电局有限公司, 广州, 510620
2.
中国科学院信息工程研究所, 信息安全国家重点实验室, 北京, 100093
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1000-3428 |
|
学科
|
自动化技术、计算机技术 |
|
基金
|
国家自然科学基金
|
|
文献收藏号
|
CSCD:6615930
|
参考文献 共
19
共1页
|
|
1.
顾启超. 一种多点容灾系统的设计与实现.
计算机应用研究,2008,25(8):2427-2429
|
被引
1
次
|
|
|
|
|
2.
陈鹏. 远程容灾系统的设计与实现.
计算机工程与设计,2011,32(10):3247-3250
|
被引
1
次
|
|
|
|
|
3.
Hots S. Internet protocols for network attached peripherals.
Proceedings of the 6th IEEE/NASA Conference on Mass Storage Systems and Technologies,1998:1-15
|
被引
1
次
|
|
|
|
|
4.
Watson R W. High performance storage system scalability: architecture,implementation and experience.
Proceedings of IEEE Conference on Mass Storage Systems and Technologies,2005:145-159
|
被引
1
次
|
|
|
|
|
5.
Wood T. Disaster recovery as a cloud service: economic benefits and deployment challenges.
Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing,2010:8-15
|
被引
2
次
|
|
|
|
|
6.
Wood T. PipeCloud: using causality to overcome speed-of-light delays in cloud-based disaster recovery.
Proceedings of the 2nd ACM Symposium on Cloud Computing,2011
|
被引
1
次
|
|
|
|
|
7.
Vrable M. Cumulus: filesystem backup to the cloud.
ACM Transactions on Storage,2009,5(4):1-28
|
被引
4
次
|
|
|
|
|
8.
Khan J I. Peer-to-peer enterprise data backup over a Ren cloud.
Proceedings of International Conference on Information Technology: New Generations,2011:959-964
|
被引
1
次
|
|
|
|
|
9.
He Dian. Replicate distribution method of minimum cost in cloud storage for Internet of things.
Proceedings of International Conference on Network Computing and Information Security,2011:89-92
|
被引
1
次
|
|
|
|
|
10.
Benet J.
IPFS-content addressed, versioned, P2P file system,2018
|
被引
1
次
|
|
|
|
|
11.
Nakamoto S.
Bitcoin: a peer-to-peer electronic cash system,2018
|
被引
37
次
|
|
|
|
|
12.
邵奇峰. 企业级区块链技术综述.
软件学报,2019:1-22
|
被引
1
次
|
|
|
|
|
13.
张亮. 区块链技术综述.
计算机工程,2019,45(5):1-12
|
被引
67
次
|
|
|
|
|
14.
Kraft D. Difficulty control for blockchain-based consensus systems.
Peer-to-Peer Networking and Applications,2016,9(2):397-413
|
被引
19
次
|
|
|
|
|
15.
Watanabe H. Blockchain contract: a complete consensus using blockchain.
Proceedings of the 4th Global Conference on Consumer Electronics,2016:577-578
|
被引
1
次
|
|
|
|
|
16.
Zheng Zibin. An overview of blockchain technology: architecture, consensus, and future trends.
Proceedings of IEEE International Congress on Big Data,2017
|
被引
2
次
|
|
|
|
|
17.
Merkle R C. A digital signature based on a conventional encryption function.
Proceedings of CRYPTO ' 87,1987:369-378
|
被引
1
次
|
|
|
|
|
18.
Rivest R L. All-or-nothing encryption and the package transform.
Proceedings of 1997 Fast Software Encryption Workshop,1997:210-218
|
被引
1
次
|
|
|
|
|
19.
Pagh R. Cuckoo hashing.
Proceedings of European Symposium on Algorithms,2001:121-133
|
被引
1
次
|
|
|
|
|
了解气象卫星更多信息，请访问