KR102134848B1 - Method for encrypting data using individual encryption key - Google Patents

Abstract

A data security method is provided. According to the present invention, the data security method comprises the steps of: obtaining, by a server, first data from a first user terminal; dividing, by the server, the obtained first data; shuffling, by the server, the divided data in a preset method; obtaining, by the server, second data including information on the division of the obtained first data and information on the preset method; encrypting, by the server, at least one of third data of the divided first data and the second data using a first encryption key; transmitting, by the server, the encrypted data to the first user terminal; and transmitting, by the server, the remaining divided data other than the third data among the divided first data to an external server.

Description

Method for encrypting data using individual encryption key}

The present invention relates to a data security method and system.

The importance of data security is increasing day by day. Although studies related to stronger data security methods are being conducted, the stronger security method has the disadvantage that it takes a long time to encrypt and decrypt by applying a complex encryption algorithm. This disadvantage becomes more pronounced as the size of the data to be encrypted increases. That is, there is a problem in that data processing speed is very low when large data is encrypted with a complex algorithm. Therefore, there is a need for an efficient data security method.

On the other hand, Block Chain (Block Chain) refers to a data distribution processing technology that distributes and stores all data subject to management by all users participating in the network. It is also called'Distributed Ledger Technology' (DLT) or'Public Ledger' in that it is a technology shared by all network participants rather than being held by a trading entity or a specific institution. . Blockchain is a name given as a block that contains the contents of a transaction, which is a chain.

Blockchain takes the core concept of decentralization, which aims for peer-to-peer (P2P) transactions, away from the existing financial system that secures and manages all transactions at financial institutions. P2P is a communication network that connects between personal computers without a server or client, and each connected computer acts as a server and client and shares information.

Blockchain has the feature of decentralization because it uses distributed computing resources rather than a central system. In addition, the blockchain can be transparently managed for all transactions occurring on the network. All transactions can be tracked from the time the transaction occurs, anyone can access the public transaction records, and the effect of training and reducing regulatory costs can be obtained. In addition, blockchain has a feature that it cannot be forged. Blockchain creates blocks using information from previous blocks. Blocks are structures that are all connected like a chain, so if you want to manipulate a specific transaction of a block, you must also change the information of all the blocks created later. Since it is virtually impossible to hack 51% of the blockchain network at the same time, it is regarded as the most reliable technology for forgery and alteration. Also, the blockchain has the characteristics of scalability. Most blockchain technology is open source software and has high scalability.

Registered Patent Publication No. 10-1252549, May 31, 2010

The problem to be solved by the present invention is to provide a method and system for data security.

The problems to be solved by the present invention are not limited to the problems mentioned above, and other problems not mentioned will be clearly understood by those skilled in the art from the following description.

A data security method according to an aspect of the present invention for solving the above-described problems, the server, obtaining the first data from the first user terminal; Dividing the obtained first data by the server; The server shuffling the divided data in a preset method; Obtaining, by the server, second data including information on the obtained first data partition and information on the preset method; Encrypting, by the server, at least one third data and the second data among the divided first data using a first encryption key; The server, transmitting the encrypted data to the first user terminal; And transmitting, by the server, the remaining divided data other than the third data among the divided first data to an external server.

At this time, the server, receiving a request to download the first data; Transmitting, by the external server, the divided data excluding the third data among the divided first data to the server according to the request; The server requesting the at least one third data and the second data to the first user terminal; Decrypting the encrypted and stored data when the request of the external server is valid by the first user terminal; Transmitting, by the first user terminal, the decrypted second data and third data to the external server; And the external server reconstructing the first data divided based on the second data. It may include.

In this case, the dividing step includes: sequentially adding an index to the divided data, and the shuffling step randomly shuffles the divided data to which the index is added, and the second data is , May include index information of the divided data.

In this case, in the reconstructing of the first data, the divided first data may be reconstructed based on the index included in the second data.

At this time, the shuffling step may shuffle the divided first data according to a preset algorithm, and the reconstructing step may reconstruct the partitioned first data by inverse transforming the preset algorithm.

At this time, the second data and the third data may be respectively encrypted by different encryption keys.

At this time, when the first data is shared by the first user terminal and the second user terminal, the server may generate a second encryption key for at least one of the fourth data and the fourth data among the divided first data. Encryption using; The server, transmitting the encrypted data to the second user terminal; It may further include.

At this time, the server, receiving a request to download the first data; Transmitting, by the external server, the remaining divided data excluding the third data and the fourth data among the divided first data to the server according to the request; The server requesting the second data, the third data, and the fourth data to the plurality of user terminals; Decrypting the encrypted and stored data when the request of the server is valid by the first user terminal and the second user terminal; Transmitting the decrypted data to the server by the first user terminal and the second user terminal; And the server reconstructing the divided first data based on the second data and the third data and the fourth data received from the first user terminal and the second user terminal; It may include.

At this time, when the first user terminal and the second user terminal, the request of the server is valid, the step of decrypting the encrypted and stored data is set among the users of the first user terminal and the second user terminal And decrypting the encrypted and stored data when more than one user agrees to the decryption.

At this time, the second data, the third data, and the fourth data may be stored in the blockchain.

According to various embodiments of the present disclosure described above, there is an effect of increasing security and speeding up data transmission even if a small amount of data is encrypted.

The effects of the present invention are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art from the following description.

1 is an exemplary view for schematically explaining a platform according to an embodiment of the present invention.
2 is a block diagram for explaining the system according to the present invention in detail.
3 is a flowchart illustrating a data security method according to an embodiment of the present invention.
4 is a flowchart illustrating a data reconstruction method according to an embodiment of the present invention.
5 is a flowchart illustrating a method of shuffling data according to an embodiment of the present invention.
6 is a flowchart illustrating a method of shuffling data according to another embodiment of the present invention.
7 is a flowchart illustrating a data security method when a plurality of users share first data according to an embodiment of the present invention.
8 is a flowchart illustrating a data security method when a plurality of users share first data according to an embodiment of the present invention.
9 is a configuration diagram of an apparatus according to an embodiment.

Advantages and features of the present invention, and methods for achieving them will be clarified with reference to embodiments described below in detail together with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but may be implemented in various different forms, and only the present embodiments allow the disclosure of the present invention to be complete, and are common in the art to which the present invention pertains. It is provided to fully inform the skilled person of the scope of the present invention, and the present invention is only defined by the scope of the claims.

The terminology used herein is for describing the embodiments and is not intended to limit the present invention. In the present specification, the singular form also includes the plural form unless otherwise specified in the phrase. As used herein, “comprises” and/or “comprising” does not exclude the presence or addition of one or more other components other than the components mentioned. Throughout the specification, the same reference numerals refer to the same components, and “and/or” includes each and every combination of one or more of the components mentioned. Although "first", "second", etc. are used to describe various components, it goes without saying that these components are not limited by these terms. These terms are only used to distinguish one component from another component. Therefore, it goes without saying that the first component mentioned below may be the second component within the technical spirit of the present invention.

Unless otherwise defined, all terms (including technical and scientific terms) used in this specification may be used in a sense that can be commonly understood by those skilled in the art to which the present invention pertains. In addition, terms that are defined in a commonly used dictionary are not ideally or excessively interpreted unless specifically defined.

The term "part" or "module" as used in the specification means a hardware component such as software, FPGA or ASIC, and "part" or "module" performs certain roles. However, "part" or "module" is not meant to be limited to software or hardware. The "unit" or "module" may be configured to be in an addressable storage medium or may be configured to reproduce one or more processors. Thus, as an example, “part” or “module” means components such as software components, object-oriented software components, class components and task components, processes, functions, attributes, Includes procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, database, data structures, tables, arrays and variables. The functionality provided within components and "parts" or "modules" can be combined into a smaller number of components and "parts" or "modules" or into additional components and "parts" or "modules" Can be further separated.

The spatially relative terms “below”, “beneath”, “lower”, “above”, “upper”, and the like are shown in the figure as one figure. It can be used to easily describe a correlation between a component and other components. The spatially relative terms should be understood as terms including different directions of components in use or operation in addition to the directions shown in the drawings. For example, if a component shown in the drawing is turned over, a component described as "below" or "beneath" of another component will be placed "above" of the other component. Can. Thus, the exemplary term “below” can include both the directions below and above. The component can also be oriented in other directions, so that spatially relative terms can be interpreted according to the orientation.

In the present specification, the computer means all kinds of hardware devices including at least one processor, and may be understood as a meaning encompassing a software configuration operating in a corresponding hardware device according to an embodiment. For example, a computer may be understood as meaning including, but not limited to, a smart phone, a tablet PC, a desktop, a notebook, and a user client and application running on each device.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Each step described in this specification is described as being performed by a computer, but the subject of each step is not limited thereto, and according to an embodiment, at least some of the steps may be performed in different devices.

1 is an exemplary view for schematically explaining a platform according to an embodiment of the present invention.

As shown in Figure 1, the platform connects the client and the worker, and can provide various services in the middle. In one embodiment, the platform may receive a request for a data operation from a requester, and allocate a requester's data operation to a worker by matching an operator corresponding to the request. In the process of data task allocation, the platform can use artificial intelligence models to provide optimized UX/UI tools to workers.

In another embodiment, the platform may build a system for increasing the security of data transmitted between the client and the worker. For example, the platform may encrypt the data provided by the client and provide it to the worker, and encrypt the work generated by the worker and provide it to the client.

In addition to this, the platform may inspect the work created by the worker using an artificial intelligence model to request the worker to rework or deliver the work to the client.

2 is a block diagram for explaining the system according to the present invention in detail.

2, the system 1 may include a first user terminal to a sixth user terminal 11 to 16, a server 20 and an external server 21. At this time, at least one terminal of the first user terminal to the sixth user terminal 11 to 16 is a terminal corresponding to the client disclosed in FIG. 1, and another at least one terminal is a terminal corresponding to the seller disclosed in FIG. 1. Can. Further, the server 20 may be a server corresponding to the platform disclosed in FIG. 1. For convenience of description, in the present disclosure, the first user terminal to the third user terminal 11 to 13 are user terminals corresponding to the sponsor, and the fourth user terminal to sixth user terminals 14 to 16 correspond to the seller. Although viewed as a user terminal, it is not limited thereto.

At this time, the first user terminal 11 may transmit data to the server 20. The server 20 shuffles the divided data and can create a file having a small data size that stores information about the divided data and information about the shuffle. The server 20 may encrypt the corresponding file and transmit it to the first user terminal 11, and the first user terminal 11 has an effect of securing the entire data only with a file having a small data size.

Meanwhile, the server 20 may transmit the remaining data other than the divided data provided to the user terminal among the divided data to the external server 21. At this time, the data received by the external server 21 is randomly mixed, and it is difficult to infer the original data. Therefore, even if an attacker hacks data stored in the external server 21, it is possible to protect the original data because the information on the original data transmitted by the first user terminal 11 is unknown. Also, even if an attacker hacks the encrypted data stored in the first user terminal 11, the original data cannot be obtained without decrypting the encrypted data or without the divided data stored in the external server 21.

Meanwhile, of course, in the system 1 according to the present invention, the server 20 and the external server 21 may be implemented as one server.

3 is a flowchart illustrating a data security method according to an embodiment of the present invention.

In step S105, the server 20 may acquire the first data. In this case, the first data may be data provided from the first user terminal 11.

In step S110, the server 20 may divide the acquired first data. In one embodiment, the server 20 may divide the first data into a preset size or a preset number. Specifically, the server 20 divides the first data into 10 pieces of divided data, and the size of the 10 pieces of divided data may be the same. Alternatively, the server 20 divides the first data into 10 divided data, and the size of the 10 divided data may be divided differently.

Alternatively, the server 20 may divide the first data into a predetermined size (for example (100KB, or 10MB, etc.). In this case, the number of data divided according to the size of the first data will be different. .

Alternatively, the server 20 may divide a part of the first data into a predetermined size, but the rest of the data may be divided in an arbitrary manner.

In step S115, the server 20 may shuffle the divided first data. At this time, when the server 20 shuffles the divided first data, information on the shuffle may be obtained. That is, the server 20 may obtain shuffle information for reconstructing shuffled data back to the original state. The server 20 may obtain shuffle information by shuffling the divided data according to a predetermined algorithm or by adding index information to the divided data.

In step S120, the server 20 may obtain second data including split information and shuffle information for the split first data.

The split information may include information indicating that the data is split from the first data, and the shuffle information may include information related to how the split data is shuffled.

In step S125, the server 20 may encrypt at least one third data among the second data and the divided first data.

That is, the server 20 may encrypt the second data for reconstructing the first data so that the first data cannot be reconstructed without decryption. In addition, the server 20 may encrypt the third data that is part of the first data, so that other users may not reconstruct the complete first data even though they know that the path to the second data is known.

Meanwhile, the second data and the third data may be encrypted using different encryption keys or may be encrypted using different encryption methods to improve security.

Meanwhile, in the above-described embodiment, the second data and the third data are described as being encrypted by the server 20, but the present invention is not limited thereto. In another embodiment, the server 20 transmits the second data and the third data to the first user terminal 11, and the first user terminal 11 uses the encryption key of the second data and second data. Of course, you can encrypt data. Hereinafter, the server 20 will be described as performing data encryption, but it is needless to say that various user terminals can perform the corresponding process.

In step S130, the server 20 may transmit the encrypted data to the first user terminal (11).

At this time, the server 20 may improve security by deleting the second data and the third data. Meanwhile, as described above, when encryption is performed in the first user terminal 11, step S130 may be omitted.

Meanwhile, the first user terminal 11 may store encrypted data in a blockchain. By storing the data in a blockchain, forgery and alteration is impossible, and an effect of improving security exists. As described later, when multiple users share the first data, it is possible to effectively manage the encrypted data. Details of this will be described later.

In step S135, the server 20 may transmit the remaining divided data other than the third data among the divided first data to the external server 21.

That is, the server 20 may store the remaining data other than the third data among the divided first data in the external server 21 having relatively weak security. Even when the external server 21 is hacked by an attacker, 1) there is no information on how to arrange the divided data, and 2) even if there is information, the third data does not exist, so the complete first data can be reconstructed. Will not. Furthermore, as described above, there is an effect that it is difficult for an attacker to infer the third data by dividing the first data through various methods to dynamically set the size of the third data.

Meanwhile, in step S125, and in step S155, which will be described later, in order to further improve security, an encryption and decryption process is performed in the secure world of the server 20, and the remaining steps can be performed in the normal world.

Secure world means a secure data processing architecture, normal world means a general data processing architecture, and two worlds operate selectively, and two worlds cannot be used simultaneously.

In one embodiment, "ARM Trustzone Architecture" may be used as the server 20. As the "ARM Trustzone Architecture", two divided runtime-architectures from ARM for microprocessor systems are known. This runtime-architecture includes two runtime environments. One of them, the non-secure runtime environment, may be referred to as a “normal zone” or a “normal world”. The insecure runtime environment can be controlled by a normal operating system. Another runtime environment, the secure runtime environment, may be referred to as a "Trustzone" or "TrustedWorld" or "Secure World. The secure runtime environment is controlled by a safe operating system. .

Here, the normal operating system may be, for example, an ordinary operating system such as Android, Windows phone, Symbian, etc., and the safe operating system is a security kernel in which security functions are integrated in an existing operating system, such as MOBICORE, RedCastle, etc. (security kernel). According to the ARM trust zone, the above-described non-secure runtime environment and secure runtime environment may be defined as a virtual execution environment.

4 is a flowchart illustrating a data reconstruction method according to an embodiment of the present invention.

In step S140, the server 20 may receive a first data download request. At this time, the server 20 may receive a request to download the first data from the fourth user terminal 14. In one embodiment, when the fourth user terminal 14 is a worker terminal to work using the first data of the first user terminal 11, the server 20 first data to the fourth user terminal 14 A download request can be received. In another embodiment, when the server 20 determines that the fourth worker terminal 14 is suitable for performing the work among the multiple worker terminals, the server 20 itself may generate a first data download request.

In step S145, the external server 21 may transmit the remaining divided data excluding the third data among the divided first data to the server 20. However, the present invention is not limited thereto, and the external server 21 may directly transmit the remaining divided data excluding the third data among the divided first data to the fourth user terminal 14.

In step S150, the server 20 may request the second data and the third data from the first user terminal 11. That is, since the second data and the third data must exist to reconstruct and reconstruct the first data, the server 20 may request the second and third data from the first user terminal 11.

In step S155, if the request is valid, the first user terminal 11 may decrypt the encrypted data.

At this time, the method for determining whether the request is valid may vary. In one embodiment, upon receiving a request from the server 20, the first user terminal 11 may request a preset password or key from the server 20. When the password or the key is valid, the first user terminal 11 may obtain the second data and the third data by decrypting the data encrypted with its own key.

In step S160, the first user terminal 11 may transmit the decrypted second data and third data to the server 20.

At this time, if the security of the communication channel for transmitting the second data and the third data is not guaranteed, the first user terminal 11 encrypts the second data and the third data with a public key shared with the server 20 Can transmit. The server 20 may obtain the second data and the third data by decrypting the data encrypted with its own secret key.

In step S165, the server 20 may reconstruct the divided first data based on the second data. That is, since the server 20 receives the third data from the first user terminal 11 and the remaining divided first data from the external server 21, the server 20 has all of the divided first data. In addition, since the second data has information on how the divided data is shuffled, the server 20 may reconstruct and reconstruct the divided first data.

Additionally, the server 20 may transmit the restored first data to the fourth user terminal 14, of course.

On the other hand, in another embodiment according to the present invention, the external server 21 stores the divided first data excluding the third data, and stores a plurality of different divided (but insufficient) data in the same way. It can be. At this time, the external server 21 may randomly store the divided first data and the remaining divided data. When the data is stored in the above manner, the external server 21 stores a plurality of divided data without distinction, so that an attacker may not know what the divided first data is.

To identify the divided first data among the plurality of data, the server 20 may add an arbitrary index to each of the divided first data. Furthermore, it goes without saying that all divided data stored in the external server 21 may have different indexes. The added indexes are different for each of the divided first data, and it is not known whether the corresponding data is the divided first data only by the index of the divided data. Accordingly, the server 20 may generate information about the table in which the indexes added are sorted according to the order of the first partitioned data. The generated segmentation information may be included in the second data. At this time, the index may be inserted at a specific location of the divided data, and such location information may also be included in the division information. Furthermore, the segmentation information may further include index size information.

For example, it may be assumed that the first data is divided into first-first data, first-second data, and first-third data. For example, 1-1 data may be 0010, 1-2 data may be 1111, and 1-3 data may be 0000. In this case, it is assumed that the specific location information may be, for example,'after the second bit of data', and the size of the index is 2 bits. In this case, the index added to the 1-1 data may be 00, the index added to the 1-2 data may be 01, and the index added to the 1-3 data may be 10.

The server 20 may generate an arbitrary index from the index size information and generate an index according to the location information. Finally, the 1-1 data will be 00(00)10, the 1-2 data will be 11(01)11, and the 1-3 data will be 00(10)00. Did)

The server 20 may store the information that the'index starts after the first two bits and has a size of 2 bits' as second data. That is, the second data has information that the third and fourth bits are indexes. Furthermore, the second data may further include 000110 data. The first two digits of 000110 are the index of the 1-1 data, the next two digits are the index of the 1-2 data, and the last two digits are the index of the 1-3 data.

The server 20 may extract an index from all data existing in the external server 21 based on the location information of the index, and obtain the divided first data based on the extracted index. In the above description, since the size of the index is 2 bits, a plurality of identical indexes may be generated, but this is for convenience only, and when the size of the index increases beyond a preset value, the frequency of occurrence of the same index is significantly lowered. On the other hand, even if the divided data having the same index exists, since the divided data existing in the external server 21 all have different indexes, in this case, a plurality of partitioned data having the same index using size information of the divided data The divided first data may be found (that is, size information of the divided first data may also be stored in the second data).

5 is a flowchart illustrating a method of shuffling data according to an embodiment of the present invention.

In step S210, the server 20 may sequentially add indexes to the divided data.

In step S220, the server 20 may randomly shuffle indexed data (S220).

Of course, as described above, the index can be inserted in a specific size at a specific location of the divided data. Because the location and size information is encrypted, an attacker cannot know what the index is.

In step S230, the server 20 may reconstruct the divided first data based on the index included in the second data.

In the above example, when the server 20 acquires the 1-1 data having the index 00, the 1-3 data having the index 10, and the 1-2 data having the index 01, the index information included in the second data Using 000110, data can be sorted and restored in the order of 1-1 data, 1-2 data, and 1-3 data.

6 is a flowchart illustrating a method of shuffling data according to another embodiment of the present invention.

* In step S310, the server 20 may shuffle the divided first data according to a preset algorithm. At this time, the preset algorithm may be, for example, an algorithm that mixes odd-numbered data with even-numbered data after division, or may be an algorithm that sorts in ascending or descending order according to the order of the number of 0s or 1s among the divided data (this Case, if the number of 0 or 1 is the same, it may be arranged in the original order).

The server 20 may encrypt the second data by including information about a predetermined algorithm in the second data. In this case, the divided first data (except the third data) will be stored in the external server 21 according to the shuffled order.

In step S320, the server 20 may reconstruct the divided first data by inversely transforming a predetermined algorithm.

In the case of the embodiment of FIG. 6, the external server 21 must store the divided first data in a shuffled order, and as described above, it will not be possible to mix and manage all data arbitrarily.

7 is a flowchart illustrating a data security method when a plurality of users share first data according to an embodiment of the present invention.

Specifically, the first data may be data shared by a plurality of user terminals. In this case, when requesting the first data download, the first data should be downloaded only with the consent of all or a predetermined number of users.

For convenience of description, hereinafter, a plurality of user terminals will be described as being limited to the case of the first user terminal 11 and the second user terminal 12, but the idea according to the present invention may also be applied to three or more user terminals. Of course it can.

In step S410, the server 20 may encrypt the fourth data among the divided first data using the second encryption key.

That is, as in the case of the first user terminal, the server 20 may encrypt the fourth data, which is at least one of the divided first data, and second data including split information and shuffle information. At this time, the second data including the segmentation information and shuffle information may be the same as the second data provided to the first user terminal 11, but is not limited thereto.

In an embodiment, the first user terminal and the second user terminal 12 may obtain the second data including the division information and shuffle information by dividing the data, and encrypt only their own data. Specifically, the second data is divided into 2-1 data and 2-2 data, and the first user terminal 11 encrypts the 2-1 data and the third data, and the second user terminal 12 Can encrypt the 2-2 data and the 4th data. In this case, the 2-1 data and the 2-2 data may have overlapping parts, but are not limited thereto. In addition, the 2-1 data and the 2-2 data may be determined according to the share ratio of the first data of the first user terminal 11 and the share of the second data of the second user terminal 12, of course to be. That is, the less data for the second data, the more difficult it is to reconstruct the first data (by hacking, etc.), so the second data may be divided according to the stake. Alternatively, the 2-1 data may include segmentation information among the second data, and the 2-2 data may include shuffle information among the second data.

Meanwhile, when there are a plurality of user terminals sharing the first data, only a specific user terminal among the plurality of user terminals may receive information on the second data. For example, there are three user terminals sharing the first data, and only two of the terminals can receive the encrypted data for the second data. The other user terminal may have only at least one segmented data among the divided first data.

In step S420, the server 20 may transmit the encrypted data to the second user terminal 12.

On the other hand, when a plurality of user terminals share encrypted data, encrypted data possessed by each user terminal may be stored in the blockchain. Each user terminal may be one of a plurality of nodes constituting the blockchain network, and the encrypted data may be recorded on a transaction in the blockchain to prevent data forgery and tampering in multiple user terminals. To this end, each node may include a block generator, and through the block generator, data stored in the blockchain can be managed.

At this time, the block generation unit may further store an encrypted data as well as a protocol for decrypting and transmitting the encrypted data to the server 20 in the blockchain. For example, when the second data and the third data are requested from the user terminal having specific data, the second data and the third data decrypted according to the rules stored in the blockchain by the block generation unit to the server 20 Can transmit. In this case, the specific data is an arbitrary terminal generated for decoding by user terminals sharing the first data, and a user terminal having specific data is a terminal receiving specific data from user terminals sharing the first data ( For example, it may be a fourth user terminal 14).

8 is a flowchart illustrating a data security method when a plurality of users share first data according to an embodiment of the present invention.

In step S430, the server 20 may receive a first data download request.

At this time, the server 20 may receive a request to download the first data from the fourth user terminal 14. In one embodiment, when the fourth user terminal 14 is a worker terminal to work using the first data of the first user terminal 11 and the second user terminal 12, the server 20 is the fourth user The terminal 14 may receive a request for downloading the first data. In another embodiment, when the server 20 determines that the fourth worker terminal 14 is suitable for performing the work among the multiple worker terminals, the server 20 itself may generate a first data download request.

In step S440, the server 20 may download the remaining divided data other than the third data and the fourth data among the divided first data.

However, the present invention is not limited thereto, and the external server 21 may directly transmit the remaining divided data excluding the third data among the divided first data to the fourth user terminal 14.

In step S450, the server 20 may request the second data, the third data, and the fourth data from the first user terminal 11 and the second user terminal 12, respectively.

In step S460, if the request is valid, the first user terminal 11 and the second user terminal 12 may decrypt the encrypted data.

In step S470, the first user terminal 11 and the second user terminal 12 may transmit the encrypted data to the server 20.

In step S480, the server 20 may reconstruct the divided first data based on the received second data and divided data.

In this case, if the encrypted data is not received from either the first user terminal 11 or the second user terminal, reconstruction of the first data is impossible, so that the shared first data can be more safely managed.

Meanwhile, in the above-described embodiment, the server 20 has been described as dividing the first data and encrypting the second data and the third data, but is not limited thereto. That is, the operation of the above-described server 20 can be performed in the first user terminal 11, of course.

In one embodiment, the first user terminal 11 may divide the first data and generate second data including the division information and shuffle information. The first user terminal 11 may transmit the divided data excluding the third data to the server 20 and encrypt the second data and the third data.

When the first download request is received from the server 20, the first user terminal verifies the validity of the request and, if valid, decrypts the encrypted data and transmits the obtained second data and third data to the server 20 Can.

The server 20 may reconstruct the first data based on the divided data received from the external server 21 and the second data and third data received from the first user terminal 11.

9 is a configuration diagram of an apparatus according to an embodiment.

The processor 102 may include one or more cores (not shown) and a connection passage (for example, a bus) that transmits and receives signals to and from a graphic processing unit (not shown) and/or other components. .

On the other hand, the processor 102 is a RAM (Random Access Memory, not shown) and a ROM (Read-Only Memory) that temporarily and/or permanently stores signals (or data) processed inside the processor 102. , Not shown). In addition, the processor 102 may be implemented in the form of a system on chip (SoC) including at least one of a graphic processing unit, RAM, and ROM.

The memory 104 may store programs (one or more instructions) for processing and controlling the processor 102. Programs stored in the memory 104 may be divided into a plurality of modules according to functions.

The steps of a method or algorithm described in connection with an embodiment of the present invention may be implemented directly in hardware, a software module executed by hardware, or a combination thereof. The software modules may include random access memory (RAM), read only memory (ROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), flash memory, hard disk, removable disk, CD-ROM, or It may reside on any type of computer readable recording medium well known in the art.

The components of the present invention may be implemented as a program (or application) to be executed in combination with a hardware computer, and stored in a medium. The components of the present invention may be implemented in software programming or software components, and similarly, embodiments include C, C++, including various algorithms implemented in a combination of data structures, processes, routines or other programming components. , Can be implemented in programming or scripting languages such as Java, assembler, etc. Functional aspects can be implemented with algorithms running on one or more processors.

The embodiments of the present invention have been described above with reference to the accompanying drawings, but those skilled in the art to which the present invention pertains may be implemented in other specific forms without changing the technical spirit or essential features of the present invention. You will understand. Therefore, it should be understood that the above-described embodiments are illustrative in all respects and not restrictive.

11: first user terminal
12: second user terminal
13: third user terminal
14: fourth user terminal
15: fifth user terminal
16: 6th user terminal
20: Server
21: external server

Claims (1)

In the data encryption method using an individual encryption key,
The server, obtaining the first data from the first user terminal;
Dividing the obtained first data by the server;
The server shuffling the divided data in a preset method;
Obtaining, by the server, second data including information on the obtained first data partition and information on the preset method;
Encrypting, by the server, at least one third data and the second data among the divided first data using a first encryption key;
The server, transmitting the encrypted data to the first user terminal;
Deleting, by the server, the second data and the at least one third data stored in the server; And
Transmitting, by the server, other divided data excluding the third data among the divided first data to an external server; Including,
The server comprises: receiving a request to download the first data;
Transmitting, by the external server, the remaining divided data excluding the third data among the divided first data to the server according to the request;
The server requesting the at least one third data and the second data to the first user terminal;
Decrypting the encrypted and stored data when the request of the external server is valid by the first user terminal;
Transmitting, by the first user terminal, the decrypted second data and third data to the external server; And
The external server, reconstructing the first data divided based on the second data; Including,
The dividing step,
Sequentially adding an index to the divided first data, and adding the index to a predetermined position of each of the divided first data; Including,
The shuffling step,
Shuffle the divided data to which the index is added,
The second data includes index information of the divided first data,
The index information includes table information in which indexes added according to the order of the divided first data, position information for adding to each of the divided first data, and size information of the index,
Reconstructing the first data divided based on the second data,
Extracting an index from each of the divided first data based on the location information;
Reconstructing the divided first data based on the extracted index and the table information; Including,
Encrypting using the first encryption key,
Encrypted in the secure world environment, the secure runtime environment of the ARM trustzone architecture,
The second data and the third data, each data encryption method using a separate encryption key, characterized in that each encrypted by a different encryption key.

Images