Processing system, processing method, and processing program

The processing system addresses the inefficiency in secret sharing by encrypting and distributing data across multiple servers, performing backups only on the necessary servers, thereby reducing data capacity growth during generational backups.

JP2024160634APending Publication Date: 2024-11-14NTT COMM CORP
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
JP2023075852
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-01
Publication Date
2024-11-14

AI Technical Summary

Technical Problem

Secret sharing methods increase data capacity by 1.5 times due to generational backups, even with the most space-efficient computational methods, as the data is fragmented and parity data is generated, leading to inefficient storage.

Method used

A processing system that encrypts and divides data into fragment and parity data, storing them in multiple servers, with only the necessary number of servers performing generational backups to maintain capacity efficiency.

Benefits of technology

Reduces the increase in data capacity due to generational backups by ensuring only the required number of servers perform backups, maintaining capacity efficiency equivalent to conventional methods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024160634000001_ABST
    Figure 2024160634000001_ABST
Patent Text Reader

Abstract

To provide a processing system, method, and program for reducing an increase in data capacity due to generation backup in storing data using secret distribution.SOLUTION: A processing system comprises: a client 10 that uploads data D1 to be stored: a secret distributed storage for distributing and storing fragment data obtained by dividing the uploaded data in a plurality of storage servers 30-1 to 30-3. The secret distributed storage includes a distribution server that encrypts the uploaded data, then divides the encrypted data into a plurality of pieces of fragment data, generates a plurality of pieces of parity data to guarantee redundancy, and distributes and stores each fragment data and each parity data into the plurality of storage servers. Of all the storage servers, only the storage servers, which have the same number of pieces 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.SELECTED DRAWING: Figure 2
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

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

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

[0003] [Patent Document 1] JP 2013-140310 A [Non-patent literature]

[0004] [Non-Patent Document 1] Dai Igarashi, Kota Tsuyuzaki, Yuto Kawahara, “SHSS: An ultra-fast secret sharing library for object storage”, Research Report on 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> [Non-Patent Document 2] 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> Summary of the Invention [Problem to be solved by the invention]

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

[0006] In secret sharing, the input data is divided into fragment data and parity data of the same size as the fragment data is generated. The data size (total capacity) when saved in secret sharing format is as follows: (Total capacity) = (Fragment file size) x (Number of fragment files) The number of fragment files is the sum of the number of fragments and the number of parity bits. The size of the fragment files varies depending on the method.

[0007] When the most space-efficient computational method is used 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 by generation, the 1.5 times data capacity will increase by the number of generations.

[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. [Means for solving the problem]

[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 sharing storage that divides the uploaded data into fragment data and stores it in a distributed manner across multiple storage servers, wherein the secret sharing storage has a distributed server that encrypts the uploaded data, divides it into multiple fragment data, generates multiple parity data to ensure redundancy, and distributes and stores each fragment data and each parity data across the multiple storage servers, and 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 data perform generational backup of the fragment data or parity data stored. Effect of the Invention

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

[0011] [Figure 1] FIG. 1 is a diagram showing an overview of distributed storage in a typical secret sharing storage. [Diagram 2] FIG. 2 is a block diagram illustrating an example of a configuration of a processing system according to an embodiment. [Diagram 3] FIG. 3 is a diagram for explaining an outline of the process according to the embodiment. [Figure 4] FIG. 4 is a diagram for explaining an outline of the process according to the embodiment. [Diagram 5]FIG. 5 is a sequence diagram illustrating an example of a processing procedure of the processing method according to the embodiment. [Figure 6] FIG. 6 is a diagram illustrating a computer that executes a program. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[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 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 Mode] First, an embodiment will be described. In the embodiment, a case where data to be stored is distributed and stored in a plurality of storage servers will be described as an example.

[0015] In an embodiment, the distribution server encrypts the upload data, then divides it into a plurality of fragment data (for example, called shares), and generates parity data to ensure redundancy. The original data cannot be restored with one share (fragment data) and one parity data, but the original data can be restored by collecting the number of fragment data and parity data required for restoration. Note that, if the number required for restoration can be collected, the original data can be restored with either only fragment data, only parity data, or both fragment data and parity data.

[0016] The distributed server distributes and stores each piece of fragment data and each piece of parity data in a plurality of storage servers at each base. In the embodiment, generational backup is not performed in all storage servers, but only the same number of storage servers as the number of fragment data and / or parity data required for data restoration among all storage servers perform generational backup of the stored fragment data or parity data, thereby reducing an increase in data volume due to generational backup.

[0017] Hereinafter, an example of application to computational secret sharing will be described as secret sharing. Note that the embodiment can be applied to any technology that cannot restore data with one share (fragment data or parity data), but can restore data by collecting the required number of fragment data and / or parity data, such as Shamir's threshold secret sharing, additive secret sharing, and lamp-type (Shamir's) secret sharing.

[0018] [Explanation of distributed storage overview] Next, an overview of distributed storage in a general secret sharing storage will be described with reference to Fig. 1. Fig. 1 is a diagram showing an overview 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 fragment data (Figure 1 (1)).

[0020] The distributed 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. In this case, there is no need to distinguish between the fragment data and the parity data. And the data can be restored with k pieces of any of the data.

[0021] Then, the distributed server 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, no distinction will be made between fragmented data and parity data, and both will be described as shares.

[0022] It is impossible to obtain information about the original data from each share alone ((2) in Figure 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, it is possible to restore the original data.

[0023] Therefore, in the embodiment, only k storage servers, the same number as the division number 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] [Processing system configuration] 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 of the case where (k, n)=(2, 3), which is the minimum configuration of the computational secret sharing scheme, that is, an example in which uploaded data is divided into two fragment data and one parity data is generated, and each of the fragment data is distributed and stored in three storage servers.

[0025] 2, the processing system according to the 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 in a plurality of storage servers, and a plurality of storage servers.

[0026] 2, a configuration will be described in which a client 10 is provided in facility A, and storage servers 30-1 to 30-3 are provided in each of a first DC, a second DC, and a third DC, which are capable of data communication via a relay device 40. Note that 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 WebUI screen for the processing system displayed on a Web browser.

[0028] The distribution server 20 encrypts the uploaded data D1, then 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, then 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, in 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 no information is leaked. However, the original data D1 can be restored by collecting the same number of shares as the number of divisions of the data D1 or more. In other words, the original data D1 can be restored by collecting two shares out of the three shares D1-1 to D1-3.

[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 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] Then, 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 the embodiment, among all the 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 Fig. 2, among the three storage servers 30-1 to 30-3, only two storage servers provided at two bases perform generational backup of the shares they store.

[0034] 3 and 4 are diagrams for explaining an outline of the process according to the embodiment. Specifically, as shown in Fig. 3, only the storage server 30-2 and the storage server 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] In the distributed server 20, the encrypted data D1 is divided into two, one parity data of the same size as the divided fragment data is generated, and the data is distributed and stored in each of the storage servers 30-1 to 30-3. Therefore, the data capacity of the shares to be distributed and stored is 1.5 times that of the data D1 (0.5 times x 3). When all of these shares D1-1 to D1-3 are backed up by generation, 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 of generation 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 of generation backup is the same amount (0.5 times + 0.5 times) as the data capacity of the original data D1, and only increases by the number of generations acquired. Therefore, in the embodiment, it is possible to maintain the same capacity efficiency as conventional generation backup. For example, when acquiring generation backups for three generations, the data capacity increases only three times the data capacity of the original data D1.

[0037] As shown in FIG. 4, even if the original data D1 is infected with malware (FIG. 4(1)), 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 (FIG. 4(2)).

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

[0039] [Processing Procedure] 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, client 10 acquires data D1 to be stored (step S1). Then, client 10 uploads data D1 to distribution server 20 (step S2).

[0040] Distribution server 20 encrypts 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] Distribution server 20 stores share D1-1 in storage server 30-1 (steps S4 and S5).

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

[0043] Distribution server 20 stores share D1-3 in storage server 30-3 via 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] Thus, in the embodiment, the distributed server 20 encrypts the uploaded data, then divides it into a plurality of fragmented data, generates a plurality of parity data to ensure redundancy, and distributes and stores each fragmented data and each parity data in a plurality of storage servers. In the embodiment, among all the storage servers, only the storage servers whose number is equal to the number of shares required for data restoration perform generational backup of the fragmented data or parity data that they store.

[0046] Traditionally, secret sharing stored data in a way that guaranteed redundancy, which resulted in a larger amount of data than the original file, and the data capacity of the original file plus the increased amount of data increased in proportion to the number of generations of backups.

[0047] In contrast, in the embodiment, instead of all storage servers performing generation backup, only the same number of storage servers as the number of shares required for data restoration perform generation backup. Therefore, according to the embodiment, by performing generation backup only for the minimum number of shares required for restoration, it is possible to suppress the increase in capacity due to backup compared to the conventional method, and to perform backup efficiently. In particular, in the case of (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, it is possible to maintain capacity efficiency more than conventional generation backup, and reduce the increase in data capacity due to generation backup.

[0048] [System configuration, etc.] In addition, each component of each device shown in the figure is a functional concept, and does not necessarily have to be physically configured as shown in the figure. In other words, the specific form of distribution and integration of each device is not limited to that shown in the figure, and all or a part of it can be functionally or physically distributed and integrated in any unit according to various loads and usage conditions. Furthermore, each processing function performed by each device can be realized in whole or in part by a CPU or GPU 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 by 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 arbitrarily unless otherwise specified.

[0050] [program] Also, a program can be created in which the processes executed by the client 10 and the storage servers 30-1 to 30-3 described in the above embodiment are written in a language executable by a computer. For example, a program can be created in which the processes executed by the client 10 and the storage servers 30-1 to 30-3 in the above embodiment are written in a language executable by a computer. In this case, the computer executes the program, thereby obtaining the same effects as those of the above embodiment. Furthermore, such a program can be recorded on a computer-readable recording medium, and the program recorded on the recording medium can be read and executed by a computer, thereby achieving the same processes as those of the above embodiment.

[0051] Fig. 6 is a diagram showing a computer that executes a program. As shown in 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] The memory 1010 includes a ROM (Read Only Memory) 1011 and a RAM 1012, as exemplified in Fig. 6. The ROM 1011 stores a boot program such as a BIOS (Basic Input Output System). The hard disk drive interface 1030 is connected to a hard disk drive 1090, as exemplified 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 an 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 1091, an application program 1092, a program module 1093, and program data 1094. That is, the above programs are stored in, for example, the hard disk drive 1090 as program modules in which instructions to be executed by the computer 1000 are written.

[0054] Moreover, 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. Then, the CPU 1020 reads out 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] Note that the program module 1093 and program data 1094 relating 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 relating to the program may be stored in another computer connected via a network (such as a local area network (LAN) or 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. [Explanation of symbols]

[0057] 10 Client 30-1~30-3 Storage Server 40 Relay Device 50-1~50―3 Backup Storage

Claims

1. A processing system having a client that uploads data to be stored, and a secret sharing storage that distributes and stores fragmented data obtained by dividing the uploaded data in a plurality of storage servers, The secret sharing storage includes: A distribution server that encrypts the uploaded data, divides it into a plurality of fragmented data, generates a plurality of parity data for redundancy, and distributes and stores each of the fragmented data and each of the parity data in the plurality of storage servers. having A processing system characterized in that, among all storage servers, only the same number of storage servers as the number of fragment data and / or parity data required for data restoration perform generational backup of the fragment data or parity data stored therein.

2. the distribution server encrypts the uploaded data, divides it into k pieces of fragment data, generates m pieces of parity-added data having the same size as the divided fragment data, and distributes and stores each of the fragment data and each of the parity data in the plurality of storage servers; 2. The processing system according to claim 1, wherein the data can be restored based on the k pieces of fragmented data and / or the parity data.

3. the distributed server encrypts the uploaded data, divides it into two pieces of fragmented data, generates two pieces of parity data having the same size as the divided fragmented data, and distributes and stores each of the fragmented data and each of the parity data in three storage servers provided at three bases, 3. The processing system according to claim 2, wherein, of the three storage servers, only two of the storage servers provided at two locations perform generational backup of the fragmented data or parity data stored therein.

4. 2. The processing system according to claim 1, wherein the storage servers, the number of which is equal to 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 distribution server that distributes and stores fragmented data obtained by dividing the uploaded data in a plurality of storage servers, and the plurality of storage servers and a secret distribution storage, comprising: a step of the distributed server encrypting the uploaded data, dividing the data into a plurality of fragmented data, generating a plurality of parity data for ensuring redundancy, and distributing and storing each of the fragmented data and each of the parity data in the plurality of storage servers; Among all the storage servers, only the storage servers whose number is equal to the number of the fragmented data and / or the parity data required for data restoration perform generational backup of the fragmented data or the parity data stored therein; A processing method comprising the steps of:

6. A processing program for causing a computer to execute the method, A computer that acts as a distributed server that divides the uploaded data into fragmented data and stores them in multiple storage servers. a step of encrypting the uploaded data, dividing the data into a plurality of fragmented data, generating a plurality of parity data for ensuring redundancy, and distributing and storing each of the fragmented data and each of the parity data in the plurality of storage servers; Run the command, Among all the storage servers, the number of storage servers is equal to the number of the fragmented data and / or the parity data required for data restoration, A step of performing generational backup of the stored fragment data or parity data. A processing program characterized by executing the above.

Citation Information

Patent Citations

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

    JP2013140310A