WO2018032375A1 - 一种用于区块链可生存存储系统及其方法 - Google Patents

一种用于区块链可生存存储系统及其方法 Download PDF

Info

Publication number
WO2018032375A1
WO2018032375A1 PCT/CN2016/095579 CN2016095579W WO2018032375A1 WO 2018032375 A1 WO2018032375 A1 WO 2018032375A1 CN 2016095579 W CN2016095579 W CN 2016095579W WO 2018032375 A1 WO2018032375 A1 WO 2018032375A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
blockchain
information
transaction
file
Prior art date
Application number
PCT/CN2016/095579
Other languages
English (en)
French (fr)
Inventor
张丛
Original Assignee
深圳市樊溪电子有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市樊溪电子有限公司 filed Critical 深圳市樊溪电子有限公司
Publication of WO2018032375A1 publication Critical patent/WO2018032375A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/78—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/56—Provisioning of proxy services

Definitions

  • the invention relates to the transaction data security problem of a blockchain, in particular to a survivable storage system of a blockchain.
  • blockchain is a secure account book database, composed of data blocks, users can constantly update and upgrade here.
  • the platform looks for data.
  • the blockchain can speed up transaction processing, reduce costs, reduce middlemen, improve market insight, and increase business transparency.
  • Computing and storage are the two basic tasks of computer systems. With the explosive growth of information, storage components will experience direct storage based on single-server, to cluster-based grid storage based on LAN, and finally to WAN-based data grids.
  • Blockchain technology is the most extreme development at present. The intrinsic characteristics of this data storage medium include intelligent storage. The quality of storage service can guarantee service differentiation and performance guarantee for user applications.
  • Storage is object-oriented mass storage, and Network storage must be confidential and complete.
  • the existing Internet does not have a good or convenient way to ensure the confidentiality, integrity, availability, and data of the data stored in the blockchain and the data stored on the storage device. Non-repudiation and the reliability of the entire network storage system, especially the generation of trusted computing technology in blockchain in recent years, puts higher demands on network storage security.
  • It is an object of the present invention to provide a survivable storage system for a blockchain comprising: (1) a threshold device for implementing a threshold scheme for storing transaction data at different storage points by encoding, copying, and dividing, The client sets an agent to interpret the user's command and the corresponding server response connected to the blockchain node; (2) the data processing and information recovery device receives the data of the implementation threshold, restores the transaction information, and ensures the blockchain System security; (3) atomic retention mechanism device, reducing the availability of multiple users accessing the same file at the same time.
  • the threshold scheme is used instead of the encryption technology, or the combination of the threshold scheme and the encryption technology is used for data security trust encryption.
  • information is divided into b shares, any a share can recover information, but any less than p shares cannot recover information.
  • the integrity provided by the survivable storage system does not depend on a specific data provided by any specific server.
  • the intruder destroys the data or changes the data
  • the client agent cannot obtain the required transaction data or cannot restore the original data.
  • File any no more than (ba) server is attacked and can not be used, the blockchain can still enable users to read the transaction data file normally, at least one file is correctly written, any greater than or equal to a is less than or equal to b
  • the correct file writing can ensure the correctness of the blockchain transaction.
  • the selection of a is limited to be less than the number of transaction data shares stored by the blockchain node for 10 minutes, thereby reducing the possibility of data being modified and being modified, reducing the time and power overhead of the server processing.
  • the blockchain survival storage system of the invention can reduce the possibility of data being modified and modified, reduce the processing time and power overhead of the server, and can still effectively protect part of the transaction data when the server is compromised.
  • FIG. 1 is a schematic structural diagram of a blockchain survivable storage system according to an embodiment of the present invention.
  • the essence of a transaction is a relational data structure that contains information about the value transfer of the trading participants. These transaction information is called the accounting ledger.
  • the transaction needs to go through three creation, verification, and writing blockchains. The transaction must be digitally signed to ensure the legality of the transaction.
  • Block All transaction information is stored in the block, and a transaction information is a record, which is stored as a separate record in the blockchain.
  • the block consists of a block header and a data part.
  • the block header field contains various characteristics of the block itself, such as the previous block information, the merkle value, and the timestamp.
  • the block header hash value and block height are the two most important indicators for identifying the block.
  • the block primary identifier is its cryptographic hash value, a digital fingerprint obtained by performing a second hash calculation on the block header by the SHA algorithm.
  • the resulting 32-byte hash value is called the block hash value, or the block header hash value, and only the block header is used for calculation.
  • the block hash value can uniquely and unambiguously identify a block, and any node can independently obtain the block hash value by simply hashing the block header.
  • Blockchain A data structure in which blocks are chained in an orderly fashion.
  • a blockchain is like a vertical stack, with the first block being the first block at the bottom of the stack, and each block is then placed on top of the other blocks.
  • a block When a block is written to a blockchain, it will never change and is backed up to another blockchain server.
  • Embodiment Referring to FIG. 1, a survivable storage system and method for a blockchain can still effectively protect part of transaction data when the server is compromised.
  • the basic idea is to use a threshold scheme to encode, copy, and split.
  • Store transaction data at different storage points, on the user side, set up an agent explain the user's commands and the corresponding different server responses to the blockchain nodes.
  • a threshold scheme is used instead of encryption technology, or a threshold scheme + encryption technology for data security trust encryption.
  • a (p-a-b) threshold scheme information is divided into b shares, any a share can recover information, but any less than p copies can not recover information. Therefore, even if any less than p shares of information are obtained by the intruder, the system is still safe.
  • the integrity provided by the survivable storage system does not depend on any data provided by any specific server, because the a piece of data for restoring the original information may come from any of the b servers.
  • the intruder destroys the data or changes the data, the client's agent will not be able to get the required transaction data or the original file.
  • the blockchain After no more than (b-a) servers are attacked and cannot be used, the blockchain still enables the user to read the transaction data files normally. For "write", at least one file must be correctly written. Any correct file writing with a ratio equal to or greater than b can ensure the correctness of the blockchain transaction. The more copies are successfully written, the more the number of copies is successfully written. The higher the availability of the blockchain. Since the transaction data is divided and stored in multiple places and multiple users may access the transaction data at the same time, the survivable storage system sets the atomicity retention mechanism device so that the availability of multiple users simultaneously accessing the same file is reduced.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Accounting & Taxation (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Strategic Management (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Storage Device Security (AREA)

Abstract

一种用于区块链的可生存存储系统，包括：门限装置，用于实施门限方案，通过编码、复制和分割把交易数据存储在不同的存储点，在用户端，设置一个代理解释用户的命令和相应的与区块链节点相连的不同的服务器反应；数据处理和信息恢复装置，接收实施门限方案的数据，恢复交易信息，保证区块链的系统安全；以及原子性保持机制装置，降低多个用户同时访问同一文件时的可用性。该区块链可生存存储系统及其方法，降低数据被破解修改的可能性，减小服务器处理的时间和功率开销，在服务器被攻陷的情况下仍然能有效保护部分交易数据。

Description

一种用于区块链可生存存储系统及其方法 技术领域
本发明涉及区块链的交易数据安全问题，特别是一种区块链的可生存存储系统。
背景技术
2009年比特币的出现带来了一种颠覆性的成果--区块链技术，区块链是一个安全的帐簿类数据库，由一个个数据区块组成，使用者可以在这个不断更新升级的平台查找数据，对于金融机构来说，区块链能加快交易处理过程、降低成本、减少中间人、提高市场洞察力，增加业务透明度。
计算和存储是计算机系统的两大基本任务，随着信息的爆炸性增长，存储部件会经历基于单服务器的直连存储，到基于局域网的集群网格存储，最后发展到基于广域网的数据网格，区块链技术是目前发展的最末端，这种数据存储介质的本征特质包括智能化的存储，存储服务质量可以保证为用户应用提供服务区分和性能保证，存储是面向对象的海量存储，以及网络存储必须保证是机密完整和安全的，现有的互联网还没有很好的或者方便的办法保证区块链传输过程中的数据和保存在存储设备上的数据的保密性、完整性、可用性、不可抵赖性以及整个网络存储系统的可靠性能，尤其是近年来区块链可信计算技术的产生，对网络存储安全又提出更高的要求。
发明内容
本发明的目的在于提供一种用于区块链的可生存存储系统，包括：(1)门限装置，用于实施门限方案，通过编码、复制和分割把交易数据存储在不同的存储点，在用户端，设置一个代理解释用户的命令和相应的与区块链节点相连的不同的服务器反应；(2)数据处理和信息恢复装置，接收实施门限方案的数据，恢复交易信息，保证区块链的系统安全；(3)原子性保持机制装置，降低多个用户同时访问同一文件时的可用性。
优选的，可以采用门限方案替代加密技术，或者门限方案加加密技术的复合方式进行数据安全信任加密。
优选的，对于一个(p-a-b)的门限方案：信息被分成b份，任何a份可以恢复信息，但任何小于p份都无法恢复信息。
优选的，可生存存储系统提供的完整性不依赖任何具体的服务器提供的a份数据，当入侵者毁掉数据或者更改数据后，客户端的代理无法得到所需的a份交易数据或者无法恢复原文件，任何不多于(b-a)个服务器遭到攻击并无法使用后，区块链仍能使用户正常读交易数据文件，至少要有a份文件被正确写入，任何大于等于a小于等于b个的正确文件写入均能保证区块链交易的正确性。
优选的，a的选择限制为不能大于区块链节点10分钟存储的交易数据份额数，从而降低数据被破解修改的可能性，减小服务器处理的时间和功率开销。
本发明的区块链可生存存储系统，降低数据被破解修改的可能性，减小服务器处理的时间和功率开销，在服务器被攻陷的情况下仍然能有效保护部分交易数据。
根据下文结合附图对本发明具体实施例的详细描述，本领域技术人员将会更加明了本发明的上述以及其他目的、优点和特征。
附图说明
后文将参照附图以示例性而非限制性的方式详细描述本发明的一些具体实 施例。附图中相同的附图标记标示了相同或类似的部件或部分。本领域技术人员应该理解，这些附图未必是按比例绘制的。本发明的目标及特征考虑到如下结合附图的描述将更加明显，附图中：
图1为根据本发明实施例的区块链可生存存储系统的结构示意图。
具体实施方式
在进行具体实施方式的说明之前，为了更为清楚的表达所论述的内容，首先定义一些非常重要的概念。
交易：交易的实质是个关系数据结构，这个数据结构中包含交易参与者价值转移的相关信息。这些交易信息被称为记账总账簿。交易需经过三个创建、验证、写入区块链。交易必须经过数字签名，保证交易的合法性。
区块：所有的交易信息存放于区块中，一条交易信息就是一条记录，作为一个独立的记录存放于区块链中。区块由区块头部和数据部分组成，区块头字段包含区块本身的各种特性，例如前一区块信息，merkle值及时间戳等。其中区块头哈希值和区块高度是标识区块最主要的两个指标。区块主标识符是它的加密哈希值，一个通过SHA算法对区块头进行二次哈希计算而得到的数字指纹。产生的32字节哈希值被称为区块哈希值，或者区块头哈希值，只有区块头被用于计算。区块哈希值可以唯一、明确地标识一个区块，并且任何节点通过简单地对区块头进行哈希计算都可以独立地获取该区块哈希值。
区块链：由区块按照链式结构有序链接起来的数据结构。区块链就像一个垂直的堆栈，第一个区块作为栈底的首区块，随后每个区块都被放置在其他区块之上。当区块写入区块链后将永远不会改变，并且备份到其他的区块链服务器上。
实施例：参见图1，一种用于区块链的可生存存储系统及方法，在服务器被攻陷的情况下仍然能有效保护部分交易数据，基本思想是采用门限方案，通过编码、复制和分割把交易数据存储在不同的存储点，在用户端，设置一个代理 解释用户的命令和相应的与区块链节点相连的不同的服务器反应。
采用门限方案替代加密技术，或者门限方案+加密技术的方式进行数据安全信任加密。对于一个(p-a-b)的门限方案：信息被分成b份，任何a份可以恢复信息，但任何小于p份都无法恢复信息。因此，即使任何小于p份的信息被入侵者得到，系统仍然是安全的。
可生存存储系统提供的完整性不依赖任何具体的服务器提供的a份数据，因为恢复原信息的a份数据可能来自b个服务器的任何a个。当入侵者毁掉数据或者更改数据后，客户端的代理就无法得到所需的a份交易数据或者无法恢复原文件。任何不多于(b-a)个服务器遭到攻击并无法使用后，区块链仍能使用户正常读交易数据文件。对于“写”，至少要有a份文件被正确写入，任何大于等于a小于等于b个的正确文件写入均能保证区块链交易的正确性，成功写入的份数越多，区块链的可用性越高。因为交易数据被分割存放在多处和多个用户可能同时访问交易数据，因此可生存存储系统设置原子性保持机制装置，从而使得多个用户同时访问同一文件时可用性降低。
对于不同门限方案p，a，b的选择，由于必须对至少m个服务器广播然后在客户端恢复数据之后才能提供给用户，而不是只需要向一个服务器发请求就可以，因此选择a的时候不能大于区块链节点10分钟存储的交易数据份额数，从而降低数据被破解修改的可能性，减小服务器处理的时间和功率开销。
虽然本发明已经参考特定的说明性实施例进行了描述，但是不会受到这些实施例的限定而仅仅受到附加权利要求的限定。本领域技术人员应当理解可以在不偏离本发明的保护范围和精神的情况下对本发明的实施例能够进行改动和修改。

Claims (10)

  1. 一种用于区块链的可生存存储系统，其特征在于包括：
    (1)门限装置，用于实施门限方案，通过编码、复制和分割把交易数据存储在不同的存储点，在用户端，设置一个代理解释用户的命令和相应的与区块链节点相连的不同的服务器反应；
    (2)数据处理和信息恢复装置，接收实施门限方案的数据，恢复交易信息，保证区块链的系统安全；
    (3)原子性保持机制装置，用于降低多个用户同时访问同一文件时的可用性。
  2. 根据权利要求1所述的一种用于区块链的加密存储系统，其特征在于：所述系统采用门限方案替代加密技术，或者门限方案加加密技术的复合方式进行数据安全信任加密。
  3. 根据权利要求1所述的一种用于区块链的加密存储系统，其特征在于：所述系统对于一个(p-a-b)的门限方案：信息被分成b份，任何a份可以恢复信息，但任何小于p份都无法恢复信息。
  4. 根据权利要求3所述的一种用于区块链的加密存储系统，其特征在于：所述可生存存储系统提供的完整性不依赖任何具体的服务器提供的a份数据，当入侵者毁掉数据或者更改数据后，客户端的代理无法得到所需的a份交易数据或者无法恢复原文件，任何不多于(b-a)个服务器遭到攻击并无法使用后，区块链仍能使用户正常读交易数据文件，至少要有a份文件被正确写入，任何大于等于a小于等于b个的正确文件写入均能保证区块链交易的正确性。
  5. 根据权利要求1所述的一种用于区块链的加密存储系统，其特征在于：所述a的选择限制为不能大于区块链节点10分钟存储的交易数据份额数，从而降低数据被破解修改的可能性，减小服务器处理的时间和功率开销。
  6. 一种用于区块链的可生存存储方法，其特征在于包括以下步骤：(1) 门限装置，用于实施门限方案，通过编码、复制和分割把交易数据存储在不同的存储点，在用户端，设置一个代理解释用户的命令和相应的与区块链节点相连的不同的服务器反应；
    (2)数据处理和信息恢复装置，接收实施门限方案的数据，恢复交易信息，保证区块链的系统安全；
    (3)原子性保持机制装置，用于降低多个用户同时访问同一文件时的可用性。
  7. 根据权利要求6所述的一种用于区块链的加密存储方法，其特征在于：所述方法采用门限方案替代加密技术，或者门限方案加加密技术的复合方式进行数据安全信任加密。
  8. 根据权利要求6所述的一种用于区块链的加密存储方法，其特征在于：所述方法对于一个(p-a-b)的门限方案：信息被分成b份，任何a份可以恢复信息，但任何小于p份都无法恢复信息。
  9. 根据权利要求8所述的一种用于区块链的加密存储方法，其特征在于：所述可生存存储方法提供的完整性不依赖任何具体的服务器提供的a份数据，当入侵者毁掉数据或者更改数据后，客户端的代理无法得到所需的a份交易数据或者无法恢复原文件，任何不多于(b-a)个服务器遭到攻击并无法使用后，区块链仍能使用户正常读交易数据文件，至少要有a份文件被正确写入，任何大于等于a小于等于b个的正确文件写入均能保证区块链交易的正确性。
  10. 根据权利要求7所述的一种用于区块链的加密存储方法，其特征在于：所述a的选择限制为不能大于区块链节点10分钟存储的交易数据份额数，从而降低数据被破解修改的可能性，减小服务器处理的时间和功率开销。
PCT/CN2016/095579 2016-08-13 2016-08-16 一种用于区块链可生存存储系统及其方法 WO2018032375A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610666887.7A CN106302720B (zh) 2016-08-13 2016-08-13 一种用于区块链可生存存储系统及其方法
CN2016106668877 2016-08-13

Publications (1)

Publication Number Publication Date
WO2018032375A1 true WO2018032375A1 (zh) 2018-02-22

Family

ID=57671110

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/095579 WO2018032375A1 (zh) 2016-08-13 2016-08-16 一种用于区块链可生存存储系统及其方法

Country Status (2)

Country Link
CN (1) CN106302720B (zh)
WO (1) WO2018032375A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115437852A (zh) * 2022-11-07 2022-12-06 四川大学 一种基于灾备恢复和文件分区表的快速区块链系统及方法

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10740733B2 (en) 2017-05-25 2020-08-11 Oracle International Corporaton Sharded permissioned distributed ledgers
EP3729305A4 (en) * 2017-12-19 2021-08-25 Blockchain IT Solutions Pty Ltd SYST &XC8; ME AND PROC &XC9; D &XC9; SETTING UP AN R &XC9; BUCKET OF COMPUTER
CN109379397B (zh) * 2018-08-31 2019-12-06 阿里巴巴集团控股有限公司 基于区块链的交易共识处理方法及装置、电子设备
CN109379184A (zh) * 2018-09-28 2019-02-22 北京金山安全软件有限公司 一种区块链私钥的存储方法、装置及电子设备
CN111079193B (zh) * 2018-10-19 2023-03-28 华为云计算技术有限公司 数据存储方法、数据查询方法、装置及设备
CN109919756B (zh) * 2019-02-22 2023-04-18 西南财经大学 基于Merkle树回溯定位技术的转账系统、查验方法及交易方法
CN110417750B (zh) * 2019-07-09 2020-07-03 北京健网未来科技有限公司 基于区块链技术的文件读取和存储的方法、终端设备和存储介质
CN110597824A (zh) * 2019-09-20 2019-12-20 腾讯科技（深圳）有限公司 一种基于区块链网络的数据存储方法以及装置
CN111026770B (zh) * 2019-10-29 2023-08-04 京东科技信息技术有限公司 区块链节点的账本处理方法、装置、服务器及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105391757A (zh) * 2015-10-09 2016-03-09 南京工程学院 一种高安全性的软件安装方法
CN105630609A (zh) * 2016-02-24 2016-06-01 杭州复杂美科技有限公司 区块链的打包存储方法
CN105812126A (zh) * 2016-05-19 2016-07-27 齐鲁工业大学 健康区块链数据加密密钥的轻量级备份与高效恢复方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101236590B (zh) * 2008-03-07 2010-11-03 北京邮电大学 一种基于门限密码体制的软件分割保护的实现方法
CN105653983B (zh) * 2015-12-30 2018-11-09 中国农业大学 基于云存储的信息分配、还原、完整性验证方法及装置
CN105406966B (zh) * 2015-12-30 2018-11-09 中国农业大学 一种门限秘密信息分配、还原、完整性验证方法及装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105391757A (zh) * 2015-10-09 2016-03-09 南京工程学院 一种高安全性的软件安装方法
CN105630609A (zh) * 2016-02-24 2016-06-01 杭州复杂美科技有限公司 区块链的打包存储方法
CN105812126A (zh) * 2016-05-19 2016-07-27 齐鲁工业大学 健康区块链数据加密密钥的轻量级备份与高效恢复方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115437852A (zh) * 2022-11-07 2022-12-06 四川大学 一种基于灾备恢复和文件分区表的快速区块链系统及方法
CN115437852B (zh) * 2022-11-07 2023-02-03 四川大学 一种基于灾备恢复和文件分区表的快速区块链系统及方法

Also Published As

Publication number Publication date
CN106302720B (zh) 2019-12-13
CN106302720A (zh) 2017-01-04

Similar Documents

Publication Publication Date Title
WO2018032375A1 (zh) 一种用于区块链可生存存储系统及其方法
CN110062034B (zh) 一种区块链大文件安全存储方法及系统
US20200374126A1 (en) Method for storing an object on a plurality of storage nodes
CN106131048B (zh) 一种用于区块链的非信任远程交易文件安全存储系统
WO2018032377A1 (zh) 一种用于区块链的只读安全文件存储系统及其方法
Anderson et al. Fast and secure laptop backups with encrypted de-duplication
US8285878B2 (en) Block based access to a dispersed data storage network
WO2018032376A1 (zh) 一种用于区块链自安全存储系统及其方法
TWI729880B (zh) 可信賴執行環境中基於錯誤校正編碼的共享區塊鏈資料儲存
US8667273B1 (en) Intelligent file encryption and secure backup system
US8621240B1 (en) User-specific hash authentication
US9256499B2 (en) Method and apparatus of securely processing data for file backup, de-duplication, and restoration
US10742633B2 (en) Method and system for securing data
TW202111586A (zh) 可信賴執行環境中基於錯誤校正編碼的共享區塊鏈資料儲存
US9122882B2 (en) Method and apparatus of securely processing data for file backup, de-duplication, and restoration
US11249672B2 (en) Low-cost backup and edge caching using unused disk blocks
GB2567146A (en) Method and system for secure storage of digital data
Periasamy et al. Efficient hash function–based duplication detection algorithm for data Deduplication deduction and reduction
US20120250857A1 (en) Method and apparatus of securely processing data for file backup, de-duplication, and restoration
WO2018032378A1 (zh) 一种用于区块链的程控加密文件存储系统及其方法
CN109582646A (zh) 一种用于文件拆分的冗余和恢复方法及系统
Tian et al. Sed‐Dedup: An efficient secure deduplication system with data modifications
Singh et al. SSSFS: A stackable survivable storage file system
AU2021105507A4 (en) Platform independent backup and restore for mobile devices using blockchain technology
Tilak et al. Cloud Based Deduplication Using Middleware Approach

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16913135

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16913135

Country of ref document: EP

Kind code of ref document: A1