Private and fault-tolerant storage of segmented data

• US 10,671,308 B2
• Filed: 08/07/2018
• Issued: 06/02/2020
• Est. Priority Date: 08/07/2018
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Natarajan, Senthilnathan, Jayachandran, Praveen, Viswanathan, Balaji
• Primary Examiner(s): Simonetti, Nicholas J
• Application Number:
  US16/056,778
• Publication Number:
  US 20200050386A1
• Time in Patent Office: 665 Days
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 21/602 Providing cryptographic facilities or services
• CPC Class Codes: G06F 21/64 Protecting data integrity, e.g. using checksums, certificates or signatures
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0623 in relation to content
• CPC Class Codes: G06F 3/0643 Management of files
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: H04L 63/123 received data contents, e.g. message integrity
• CPC Class Codes: H04L 67/1097 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]
• CPC Class Codes: H04L 9/085 Secret sharing or secret splitting, e.g. threshold schemes
• CPC Class Codes: H04L 9/321 involving a third party or a trusted authority
• CPC Class Codes: H04L 9/3239 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/50 using hash chains, e.g. blockchains or hash trees

Abstract

An example operation may include one or more of receiving a request comprising a file segmented into a plurality of segments corresponding to a plurality of storage nodes, identifying a segment from among the plurality of segments which is designated for the storage node from among remaining segments designated for other storage nodes, storing the identified segment in a local storage of the storage node, hashing the identified segment, and transmitting a response to a client system which includes the hashed identified segment.

Claims

1. A storage node, comprising:

a storage device;

a network interface configured to receive a request that includes data of a plurality of segments that correspond to a plurality of storage nodes, respectively, where the request includes a segment designated for the storage node and hashes of remaining segments designated for other storage nodes; and

a processor configured to store the designated segment in the storage device of the storage node, hash the designated segment, and control the network interface to transmit an endorsement response which includes the hashed designated segment and the hashes of the remaining segments to a computing system associated with the request.

2. The storage node of claim 1, wherein the plurality of segments are received via a transient field of a blockchain proposal message.

3. The storage node of claim 1, wherein the plurality of segments comprise n segments corresponding to n storage nodes, q of the n segments can be used to recover the entire file, and q is less than n.

4. The storage node of claim 1, wherein the designated segment is labeled with an identifier of the storage node while the hashes of the remaining segments are labeled with respective identifiers of the other storage nodes.

5. The storage node of claim 1, wherein the processor is further configured to commit the hashed designated segment and the hashes of the remaining segments to a data block within a hash-linked chain of data blocks.

6. The storage node of claim 5, wherein the processor commits the hashed designated segment in response to receipt of a request from an orderer node.

7. The storage node of claim 1, wherein the processor simulates the designated segment and controls the network interface to transmit an endorsement of the storage node based on the simulation of the designated segment to a client system that submitted the request.

8. A method of a storage node, comprising:

receiving a request comprising data of a plurality of segments corresponding to a plurality of storage nodes, respectively, where the request includes a segment designated for the storage node and hashes of remaining segments designated for other storage nodes;

storing the designated segment in a local storage of the storage node;

hashing the designated segment; and

transmitting an endorsement response which includes the hashed designated segment and hashes of the remaining segments to a computing system associated with the request.

9. The method of claim 8, wherein the plurality of segments are received via a transient field of a blockchain proposal message.

10. The method of claim 8, wherein the plurality of segments comprise n segments corresponding to n storage nodes, q of the n segments can be used to recover the entire file, and q is less than n.

11. The method of claim 8, wherein the designated segment is labeled with an identifier of the storage node while the hashes of the remaining segments are labeled with respective identifiers of the other storage nodes.

12. The method of claim 8, further comprising committing the hashed designated segment and the hashes of the remaining segments to a data block within a hash-linked chain of data blocks.

13. The method of claim 12, wherein the committing is performed in response to receiving a request from an orderer node.

14. The method of claim 8, wherein the transmitting the endorsement response comprises simulating the designated segment and transmitting an endorsement of the storage node based on the simulation of the designated segment to a client system that submitted the request.

15. A non-transitory computer readable medium comprising program instructions that when executed cause a computer to perform a method comprising:

receiving a request comprising data of a plurality of segments corresponding to a plurality of storage nodes, respectively, where the request includes a segment designated for the storage node and hashes of remaining segments designated for other storage nodes;

storing the designated segment in a local storage of the storage node;

hashing the designated segment; and

transmitting an endorsement response which includes the hashed designated segment and the hashes of the remaining segments to a computing system associated with the request.

16. The non-transitory computer readable medium of claim 15, wherein the plurality of segments are received via a transient field of a blockchain proposal message.

17. The non-transitory computer readable medium of claim 15, wherein the plurality of segments comprise n segments corresponding to n storage nodes, q of the n segments can be used to recover the entire file, and q is less than n.

18. The non-transitory computer readable medium of claim 15, wherein the designated segment is labeled with an identifier of the storage node while the hashes of the remaining segments are labeled with respective identifiers of the other storage nodes.

19. The non-transitory computer readable medium of claim 15, wherein the method further comprises committing the hashed designated segment and the hashes of the remaining segments to a data block within a hash-linked chain of data blocks.

20. The non-transitory computer readable medium of claim 15, wherein the transmitting the endorsement response comprises simulating the designated segment and transmitting an endorsement of the storage node based on the simulation of the designated segment to a client system that submitted the request.