Processing system, processing method, and processing program

By limiting generational backups to only the necessary storage servers in a distributed storage system using secret sharing, the system reduces data capacity increases and enhances backup efficiency, addressing the inefficiencies in existing secret sharing methods.

WO2024228288A1PCT designated stage expired Publication Date: 2024-11-07NTT COMM CORP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2024/007381
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-01
Filing Date
2024-02-28
Publication Date
2024-11-07

AI Technical Summary

Technical Problem

Secret sharing methods for data storage, while ensuring security through fragmentation and parity data, result in increased data capacity due to generational backups, as all storage servers typically perform backups, leading to inefficient capacity usage.

Method used

Implement a distributed storage system where only the same number of storage servers as the number of fragment or parity data required for data restoration perform generational backups, reducing the increase in data capacity during backup processes.

Benefits of technology

This approach maintains capacity efficiency by limiting backups to only the necessary shares, thereby reducing the overall data capacity increase and enhancing backup efficiency compared to conventional methods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2024007381_07112024_PF_FP_ABST
    Figure JP2024007381_07112024_PF_FP_ABST
Patent Text Reader

Abstract

This processing system comprises: a client (10) that uploads data to be stored; and a secret distributed storage for distributing and storing fragment data, obtained by dividing the uploaded data, across multiple storage servers (30-1), (30-2), (30-3). This secret distributed storage has a distribution server (20) that encrypts the uploaded data, divides the encrypted data into multiple sets of fragment data, generates multiple sets of parity data to guarantee redundancy, and distributes and stores each set of the fragment data and each set of the parity data into the multiple storage servers (30-1), (30-2), (30-3). Of all the storage servers (30-1), (30-2), (30-3), only the storage servers (30-2), (30-3), which have the same number of sets of fragment data and / or parity data as required for data restoration, perform generation backup of the fragment data or the parity data stored therein.
Need to check novelty before this filing date? Find Prior Art

Description

Processing system, processing method, and processing program

[0001] The present invention relates to a processing system, a processing method, and a processing program.

[0002] When handling personal or important information, secure storage of data is necessary. Encrypting data using symmetric key cryptography or public key cryptography is one method of securely storing data, but there is a risk that the data may be restored in the future if the ciphertext is stolen from the server. Therefore, a technology called secret sharing has been proposed, which makes it impossible to restore the data from the stolen ciphertext alone, even if a single server is attacked.

[0003] JP 2013-140310 A

[0004] Dai Igarashi, Kota Tsuyuzaki, and Yuto Kawahara, "SHSS: An Ultra-Fast Secret Sharing Library for Object Storage," Research Report, Security Psychology and Trust (SPT), 2015-SPT-14, vol. 26, pp.1-8, [online], [Retrieved February 22, 2023], Internet <URL: https: / / ipsj.ixsq.nii.ac.jp / ej / ?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=142625&item_no=1&page_id=13&block_id=8> Adi Shamir, "How to share a secret," Communications of the ACM, vol. 22, issue 11, pp.612--613, Nov., 1979 [online], [Retrieved February 22, 2023], Internet <URL: https: / / dl.acm.org / doi / abs / 10.1145 / 359168.359176>

[0005] Secret sharing is a technique for encrypting input data by dividing it into pieces of data (e.g., called shares) and storing each piece of data on different servers. Each piece of data cannot be restored by itself.

[0006] In secret sharing, input data is divided into fragmented data and parity data of the same size as the fragmented data is generated. The data size (total capacity) when saved in secret sharing format is as follows: (Total capacity) = (Fragmented file size) x (Number of fragmented files) Note that the number of fragmented files is the sum of both the fragments and the parity. In this case, the fragmented file size differs depending on the method.

[0007] When the most space-efficient computational method is adopted for secret sharing, its capacity efficiency is calculated as n / k, where k is the number of fragments required for restoration and n is the total number of fragment files. The minimum configuration for the computational method is when (k, n) = (2, 3), so its capacity efficiency is 1.5 times. Even with the most space-efficient computational method, if each fragment data is backed up over generations, the 1.5 times data capacity increases by an additional generation.

[0008] The present invention has been made in consideration of the above, and aims to provide a processing system, processing method, and processing program that can reduce the increase in data volume due to generation backup when storing data using secret sharing.

[0009] In order to solve the above-mentioned problems and achieve the objective, the processing system of the present invention is a processing system having a client that uploads data to be stored, and a secret distribution storage that divides the uploaded data into fragment data and stores it in a distributed manner across multiple storage servers, wherein the secret distribution storage has a distributed server that encrypts the uploaded data, divides it into multiple fragment data, generates multiple parity data to ensure redundancy, and stores each fragment data and each parity data in a distributed manner across the multiple storage servers, and is characterized in that, of all the storage servers, only the same number of storage servers as the number of fragment data and / or parity data required to restore the data perform generational backup of the stored fragment data or parity data.

[0010] According to the present invention, in data storage using secret sharing, it is possible to reduce the increase in data volume due to generation backup.

[0011] Fig. 1 is a diagram showing an overview of distributed storage in a general secret sharing storage. Fig. 2 is a block diagram showing an example of the configuration of a processing system according to an embodiment. Fig. 3 is a diagram explaining an overview of processing according to an embodiment. Fig. 4 is a diagram explaining an overview of processing according to an embodiment. Fig. 5 is a sequence diagram showing an example of the processing procedure of a processing method according to an embodiment. Fig. 6 is a diagram showing a computer that executes a program.

[0012] Hereinafter, embodiments of a processing system, a processing method, and a processing program according to the present application will be described in detail with reference to the accompanying drawings. Note that the processing system, the processing method, and the processing program according to the present application are not limited to these embodiments.

[0013] In the following embodiments, the processing flow of a processing system, a processing method, and a processing program according to the embodiments will be described in order, and finally, the effects of the embodiments will be described.

[0014] [Embodiment] First, an embodiment will be described. In the embodiment, an example will be described in which data to be stored is distributed and stored in a plurality of storage servers.

[0015] In an embodiment, the distributed server encrypts the uploaded data, then divides it into multiple fragmented data (e.g., called shares), and generates parity data to ensure redundancy. The original data cannot be restored with one share (fragmented data) and one parity data, but the original data can be restored by collecting the required number of fragmented data and parity data. Note that, if the required number of fragmented data can be collected, the original data can be restored with either only fragmented data, only parity data, or both fragmented data and parity data.

[0016] The distributed server stores each piece of fragmented data and each piece of parity data in a distributed manner across multiple storage servers at each base. In this embodiment, generational backup is not performed on all storage servers, but rather, of all storage servers, only the same number of storage servers as the number of fragmented data and / or parity data required to restore the data perform generational backup of the stored fragmented data or parity data, thereby reducing the increase in data volume due to generational backup.

[0017] Hereinafter, an example in which the secret sharing is applied to computational secret sharing will be described. Note that the embodiment can be applied to any technique in which data cannot be restored with one share (fragment data or parity data) but data can be restored by collecting the required number of fragment data and / or parity data, such as Shamir's threshold secret sharing, additive secret sharing, and Lamp (Shamir's) secret sharing.

[0018] [Outline of Distributed Storage] Next, an outline of distributed storage in a general secret sharing storage will be described with reference to Fig. 1. Fig. 1 is a diagram showing an outline of distributed storage in a general secret sharing storage.

[0019] First, when upload data is uploaded from a client to the secret sharing storage, the distribution server encrypts the upload data and divides it into fragmented data ((1) in Figure 1).

[0020] The distribution server divides the encrypted upload data into k pieces of fragment data F1, F2, ..., Fk, and generates m pieces of parity data P1, ..., Pm (fragment data) of the same size as the fragment data F1, F2, ..., Fk. At this time, there is no need to distinguish between the fragment data and the parity data. Then, the data can be restored if k pieces of any data are available.

[0021] The distributed server then distributes and stores the fragmented data F1, F2, ..., Fk and the parity data P1, ..., Pm on disks 1, 2, k+1, ... of different storage servers 1, ..., k+1, .... Hereinafter, the fragmented data and parity data will not be distinguished from each other, and both will be described as shares.

[0022] It is impossible to obtain information about the original data from each share alone ((2) in FIG. 1). However, if there are k shares out of the k pieces of fragmented data F1, F2, ..., Fk and the m pieces of parity data P1, ..., Pm, it is possible to obtain information about the original data. In other words, with k shares, the original data can be restored.

[0023] Therefore, in this embodiment, only k storage servers, the same number as the number of divisions k, perform generational backup of the shares they store. In this case, it is possible to reduce the increase in data volume due to generational backup compared to when all storage servers perform generational backup.

[0024] [Configuration of Processing System] Next, the configuration of a processing system according to an embodiment will be described. Fig. 2 is a block diagram showing an example of the configuration of a processing system according to an embodiment. Fig. 2 and subsequent figures will explain an example in which (k, n) = (2, 3), which is the minimum configuration of a computational secret sharing scheme, that is, an example in which uploaded data is divided into two fragmented data pieces and one parity data piece is generated, and each piece is distributed and stored in three storage servers.

[0025] 2, a processing system according to an embodiment includes a client 10 that uploads data to be stored, and a secret sharing storage. The secret sharing storage includes a distribution server that distributes and stores fragmented data obtained by dividing the uploaded data across multiple storage servers, and multiple storage servers.

[0026] 2, a client 10 is provided in facility A, and data communication is possible via a relay device 40. One storage server 30-1 to one storage server 30-3 are provided in each of a first data center (DC), a second DC, and a third DC. The configuration shown in FIG. 2 is merely an example, and the specific configuration and the number of devices are not particularly limited.

[0027] The client 10 acquires data D1 to be stored and uploads the acquired data D1 to be stored to the distributed server 20. For example, an operator of the client 10 selects and uploads data to be uploaded via a Web UI (User Interface) screen for the processing system displayed in a Web browser.

[0028] The distribution server 20 encrypts the uploaded data D1, divides it into k pieces of fragmented data, and generates m pieces of parity data having the same size as the divided fragmented data.

[0029] 2, the distribution server 20 encrypts the uploaded data D1, divides it into two pieces of fragmented data, and generates one piece of parity data of the same size as the divided fragmented data. The distribution server 20 distributes and stores the two pieces of fragmented data and one piece of parity data, i.e., three shares D1-1 to D1-3, across multiple storage servers 30-1 to 30-3.

[0030] Each share is meaningless data, and the original data D1 cannot be restored with just one share, so information is not leaked. However, if the number of shares equal to or greater than the number of divisions of data D1 is gathered, the original data D1 can be restored. In other words, if two of the three shares D1-1 to D1-3 are gathered, the original data D1 can be restored.

[0031] Storage server 30-2 is provided in the second DC, and storage server 30-3 is provided in the third DC. The second DC and the third DC are connected to facility A via a relay device 40 of the first DC. The second DC and the third DC are provided in a closed network. In addition, for example, a distributed server 60 is provided in the second DC.

[0032] The storage server 30-1 stores the share D1-1, the storage server 30-2 stores the share D1-2, and the storage server 30-3 stores the share D1-3.

[0033] In this embodiment, of all storage servers, only k storage servers, the same number as the number of divisions, perform generational backup of the shares they store. In the example of Figure 2, of the three storage servers 30-1 to 30-3, only two storage servers installed at two bases perform generational backup of the shares they store.

[0034] 3 and 4 are diagrams for explaining an overview of the processing of the embodiment. Specifically, as shown in Fig. 3, only the storage servers 30-2 and 30-3 in the closed network perform generational backup of the shares D1-2 and D1-3 stored therein to the backup storages 50-2 and 50-3 ((1) and (2) in Fig. 3).

[0035] The distributed server 20 divides the encrypted data D1 into two pieces, generates one piece of parity data of the same size as the divided fragment data, and stores it in a distributed manner across each of the storage servers 30-1 to 30-3. Therefore, the data capacity of the shares to be stored in a distributed manner is 1.5 times the data capacity of the data D1 (0.5 times x 3). If all of these shares D1-1 to D1-3 are backed up over generations, a data capacity of 1.5 times the data capacity of the original data D1 x the number of generations acquired is required.

[0036] In contrast, in the embodiment, the targets for generational backup are only shares D1-2 and D1-3 stored by storage server 30-2 and storage server 30-3. Therefore, the data capacity of the target for generational backup is the same as the data capacity of the original data D1 (0.5 times + 0.5 times), and only increases with the number of generations acquired. Therefore, in the embodiment, it is possible to maintain the same capacity efficiency as conventional generational backup. For example, when acquiring generational backups for three generations, the data capacity only increases three times the data capacity of the original data D1.

[0037] As shown in Figure 4, even if the original data D1 is infected with malware ((1) in Figure 4), the original data D1 can be restored from the backup of shares D1-2 and D1-3 in backup storages 50-2 and 50-3 ((2) in Figure 4).

[0038] The second DC and the third DC are installed in a closed network, i.e., a network that is physically and logically separated from facility A, so the generationally backed up shares D1-2 and D1-3 are not affected by malware infection. Therefore, the original data D1 can be properly restored from the backup of shares D1-2 and D1-3 in backup storages 50-2 and 50-3 of the second DC and the third DC in the closed network.

[0039] 5 is a sequence diagram showing an example of a processing procedure of a processing method according to an embodiment. As shown in FIG. 5, the client 10 acquires data D1 to be stored (step S1). Then, the client 10 uploads the data D1 to the distribution server 20 (step S2).

[0040] The distribution server 20 encrypts the data D1, divides it into two pieces of fragmented data, and generates one piece of parity data of the same size as the divided fragmented data (step S3).

[0041] The distribution server 20 stores the share D1-1 in the storage server 30-1 (steps S4 and S5).

[0042] The distribution server 20 stores the share D1-2 in the storage server 30-2 via the relay device 40 (steps S6 to S8).

[0043] The distribution server 20 stores the share D1-3 in the storage server 30-3 via the relay device 40 (steps S9 to S11).

[0044] Then, the storage server 30-2 and the storage server 30-3 store the shares D1-2 and D1-3 in the backup storages 50-2 and 50-3 (steps S12 to S15), thereby backing up the generations.

[0045] [Effects of the embodiment] As described above, in the embodiment, the distribution server 20 encrypts the uploaded data, divides it into a plurality of fragmented data, generates a plurality of parity data to ensure redundancy, and stores each fragmented data and each parity data in a distributed manner across a plurality of storage servers. Then, in the embodiment, of all the storage servers, only the same number of storage servers as the number of shares required to restore the data perform generational backup of the stored fragmented data or parity data.

[0046] Traditionally, secret sharing stores data in a way that ensures redundancy, which means that the amount of data increases compared to the original file. The data volume of the original file plus the increased data volume increases in proportion to the number of generations of backups.

[0047] In contrast, in the embodiment, generational backup is not performed by all storage servers, but only the number of storage servers equal to the number of shares required for data restoration performs generational backup. Therefore, according to the embodiment, generational backup is performed only for the minimum number of shares required for restoration, thereby suppressing the increase in capacity due to backup compared to conventional methods and enabling efficient backup. In particular, when (k, n) = (2, 3), which is the minimum configuration of the computational secret sharing scheme, only the number of acquired generations increases. Therefore, in the embodiment, capacity efficiency can be maintained compared to conventional generational backup, and the increase in data capacity due to generational backup can be reduced.

[0048] [System Configuration, etc.] The components of each device shown in the figures are conceptual functional units and do not necessarily have to be physically configured as shown. In other words, the specific form of distribution and integration of each device is not limited to that shown in the figures, and all or part of the devices can be functionally or physically distributed and integrated in any unit depending on various loads, usage conditions, etc. Furthermore, all or any part of the processing functions performed by each device can be realized by a CPU (Central Processing Unit) or a GPU (Graphics Processing Unit) and a program analyzed and executed by the CPU or GPU, or can be realized as hardware using wired logic.

[0049] Furthermore, among the processes described in this embodiment, all or part of the processes described as being performed automatically can be performed manually, or all or part of the processes described as being performed manually can be performed automatically using a known method.In addition, the information including the processing procedures, control procedures, specific names, various data and parameters shown in the above documents and drawings can be changed as desired unless otherwise specified.

[0050] [Program] It is also possible to create a program in which the processes executed by the client 10 and storage servers 30-1 to 30-3 described in the above embodiment are written in a computer-executable language. For example, it is also possible to create a program in which the processes executed by the client 10 and storage servers 30-1 to 30-3 in the above embodiment are written in a computer-executable language. In this case, the same effects as those of the above embodiment can be achieved by having a computer execute the program. Furthermore, such a program may be recorded on a computer-readable recording medium, and the program recorded on the recording medium may be read and executed by a computer to achieve the same processes as those of the above embodiment.

[0051] 6 is a diagram showing a computer that executes a program. As shown in the example of FIG. 6, a computer 1000 includes, for example, a memory 1010, a CPU 1020, a hard disk drive interface 1030, a disk drive interface 1040, a serial port interface 1050, a video adapter 1060, and a network interface 1070, and these components are connected by a bus 1080.

[0052] As shown in FIG. 6, the memory 1010 includes a read-only memory (ROM) 1011 and a random access memory (RAM) 1012. The ROM 1011 stores a boot program such as a basic input / output system (BIOS). The hard disk drive interface 1030 is connected to a hard disk drive 1090 as shown in FIG. 6. The disk drive interface 1040 is connected to a disk drive 1100. A removable storage medium such as a magnetic disk or optical disk is inserted into the disk drive 1100. The serial port interface 1050 is connected to a mouse 1110 and a keyboard 1120, for example. The video adapter 1060 is connected to a display 1130, for example.

[0053] 6, the hard disk drive 1090 stores, for example, an OS (Operating System) 1091, an application program 1092, a program module 1093, and program data 1094. That is, the above-mentioned programs are stored in the hard disk drive 1090, for example, as program modules in which instructions to be executed by the computer 1000 are written.

[0054] The various data described in the above embodiment are stored as program data, for example, in the memory 1010 or the hard disk drive 1090. The CPU 1020 then reads the program module 1093 and the program data 1094 stored in the memory 1010 or the hard disk drive 1090 into the RAM 1012 as necessary, and executes various processing procedures.

[0055] The program module 1093 and program data 1094 related to the program are not limited to being stored in the hard disk drive 1090, and may be stored in, for example, a removable storage medium and read by the CPU 1020 via a disk drive or the like. Alternatively, the program module 1093 and program data 1094 related to the program may be stored in another computer connected via a network (such as a local area network (LAN) or a wide area network (WAN)) and read by the CPU 1020 via the network interface 1070.

[0056] The above-described embodiments and their modifications are included in the technology disclosed in this application, as well as in the scope of the invention described in the claims and their equivalents.

[0057] 10 Client 30-1 to 30-3 Storage server 40 Relay device 50-1 to 50-3 Backup storage

Claims

1. A processing system having a client which uploads data to be stored, and a secret sharing storage which divides the uploaded data into fragment data and stores them in a distributed manner across a number of storage servers, wherein the secret sharing storage has a distributed server which encrypts the uploaded data, divides it into a number of fragment data, generates a number of parity data to ensure redundancy, and stores each fragment data and each parity data in a distributed manner across the multiple storage servers, wherein, of all the storage servers, only the same number of storage servers as the number of fragment data and / or parity data required to restore the data perform generational backup of the stored fragment data or parity data.

2. The processing system described in claim 1, characterized in that the distributed server encrypts the uploaded data, divides it into k pieces of fragmentary data, generates m pieces of parity-added data of the same size as the divided fragmentary data, and stores each fragmentary data and each parity data in a distributed manner across the multiple storage servers, and the data can be restored based on the k pieces of fragmentary data and / or the parity data.

3. The distributed server encrypts the uploaded data, then divides it into two fragment data, generates two parity data of the same size as the divided fragment data, and stores each fragment data and each parity data in three storage servers respectively located at three bases, and the processing system described in claim 2 is characterized in that only two of the three storage servers located at two bases perform generational backup of the stored fragment data or parity data.

4. The processing system according to claim 1, characterized in that the same number of storage servers as the number of the fragmented data and / or the parity data required for restoring the data are provided in a closed network.

5. A processing method executed by a processing system having a client that uploads data to be stored, a distributed server that distributes and stores fragment data obtained by dividing the uploaded data among multiple storage servers, and the multiple storage servers and secret distributed storage, comprising the steps of: the distributed server encrypting the uploaded data, dividing it into multiple fragment data, generating multiple parity data to ensure redundancy, and distributing and storing each fragment data and each parity data among the multiple storage servers; and a step of only storage servers, of all storage servers, in a number equal to the number of fragment data and / or parity data required to restore the data, performing generational backup of the fragment data or parity data stored therein.

6. A processing program for causing a computer to execute a method, comprising the steps of: causing a computer acting as a distributed server that divides uploaded data into fragment data and distributes and stores the fragment data among a plurality of storage servers to execute the steps of: encrypting the uploaded data, dividing the data into a plurality of fragment data, generating a plurality of parity data to ensure redundancy, and distributing and storing each fragment data and each parity data among the plurality of storage servers; and causing each computer acting as a storage server, the number of which is equal to the number of fragment data and / or parity data required for data restoration, among all storage servers, to execute a step of performing a generational backup of the stored fragment data or parity data.

Citation Information

Patent Citations

  • Data distribution device, distributed data conversion device, and data restoration device

    JP2013140310A

  • Business enterprise backup and recovery system and method

    US20050021869A1