KR102023038B1 - Data security methods and systems - Google Patents

Abstract

Provided is a data security method. The data security method includes: a step in which a server obtains first data from a first user terminal; a step in which the server divides the obtained first data; a step in which the server shuffles the divided data through a preset method; a step in which the server obtains second data including information about the division of the first data and information about the preset method; a step in which the server encodes at least one third datum of the divided first data and the second data by using a first password key; a step in which the server transmits the encoded data to the first user terminal; and a step in which the server transmits the rest of the divided first data excluding the third datum to an external server. Therefore, the present invention is capable of increasing security as well as data transmission rates.

Description

DATA SECURITY METHODS AND SYSTEMS

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

The importance of data security is increasing day by day. Although studies on stronger data security methods have been conducted, there are disadvantages in that stronger security methods take longer to encrypt and decrypt by applying complex encryption algorithms. This disadvantage is more prominent as the size of the data to be encrypted increases. In other words, if a large data is encrypted using a complex algorithm, there is a problem that the data processing speed becomes very low. Thus, there is a need for an efficient data security method.

On the other hand, block chain refers to a data distribution processing technology in which all users participating in the network distribute and store all data managed. It is also called 'Distributed Ledger Technology (DLT)' or 'Public Transaction Book' in that the ledger containing transaction information is not held by a trading entity or a specific institution but is divided among all network participants. . Blockchain is a name given as a chain of blocks containing transactions.

Blockchain focuses on the decentralization of the P2P (Peer to Peer) transaction, which breaks away from the existing financial system that secures and manages all transactions in financial institutions. P2P is a communication network connecting personal computers without a server or client, and each connected computer acts as a server and a client and shares information.

Blockchain is decentralized because it uses distributed computing resources rather than a central system. In addition, the blockchain can transparently manage all transactions occurring on the network. All transactions can be tracked from the time of the transaction, anyone has access to public transaction records, and the benefits of cultivating transactions and reducing regulatory costs. In addition, blockchain is characterized by the forgery is impossible. The blockchain creates a block using the information of the previous block. Because blocks are all connected like a chain, manipulating a particular transaction in a block also requires changing the information in all subsequently created blocks. Hacking 51% of blockchain networks simultaneously is virtually impossible, making it the most reliable technology for forgery and alteration. In addition, the blockchain is characterized by scalability. Most blockchain technologies are open source software and are highly scalable.

Patent Application Publication No. 10-1252549, 2010.05.31

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

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

According to an aspect of the present invention, there is provided a data security method comprising: obtaining, by a server, first data from a first user terminal; Dividing, by the server, the obtained first data; The server shuffling the divided data in a predetermined method; Acquiring, by the server, second data including information on the obtained first data division and information on the preset method; Encrypting, by the server, at least one third data and the second data of 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 except for the third data among the divided first data to an external server.

At this time, the server, the step of receiving a request for downloading the first data; Transmitting, by the external server, the remaining divided data except for the third data among the divided first data to the server according to the request; Requesting, by the server, the at least one third data and the second data to the first user terminal; Decrypting, by the first user terminal, the encrypted and stored data when the request of the external server is valid; Transmitting, by the first user terminal, the decoded second data and third data to the external server; And reconstructing, by the external server, first data divided based on the second data; It may include.

In this case, the dividing may include adding an index to the divided data sequentially, and the shuffling may randomly shuffle the divided data to which the index is added, and the second data may include: It may include index information of the divided data.

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

In this case, the step of shuffling, shuffles the divided first data according to a preset algorithm, and the reconstructing may reconstruct the divided first data by inversely transforming the preset algorithm.

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

In this case, when the first data is shared by the first user terminal and the second user terminal, the server may convert the second encryption key into at least one fourth data and the fourth data among the divided first data. Encrypting using; The server, transmitting the encrypted data to the second user terminal; It may further include.

At this time, the server, the step of receiving a request for downloading the first data; Transmitting, by the external server, the remaining divided data except for the third data and the fourth data among the divided first data to the server according to the request; Requesting, by the server, the second data, third data, and fourth data from the plurality of user terminals; Decrypting, by the first user terminal and the second user terminal, the encrypted and stored data when the request of the server is valid; Transmitting the decrypted data to the server by the first user terminal and the second user terminal; And reconstructing, by the server, first data divided 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.

In this case, when the request of the server is valid, the first user terminal and the second user terminal decrypting the encrypted and stored data may be preset among a user of the first user terminal and the second user terminal. If more than one user agrees to decrypt, decrypting the encrypted and stored data; may include.

In this case, 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, even if a small amount of data is encrypted, security can be improved and data transmission speed can be increased.

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 in detail the system according to the present invention.
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 block diagram of an apparatus according to an embodiment.

Advantages and features of the present invention and methods for achieving them will be apparent with reference to the embodiments described below in detail with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, but can be embodied in various different forms, and the present embodiments only make the disclosure of the present invention complete, and those of ordinary skill in the art to which the present invention belongs. It is provided to fully inform the skilled worker of the scope of the invention, which is defined only by the scope of the claims.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. In this specification, the singular also includes the plural unless specifically stated otherwise in the phrase. As used herein, "comprises" and / or "comprising" does not exclude the presence or addition of one or more other components in addition to the mentioned components. Like reference numerals refer to like elements throughout, and "and / or" includes each and all combinations of one or more of the mentioned components. Although "first", "second", etc. are used to describe various components, these components are of course not limited by these terms. These terms are only used to distinguish one component from another. Therefore, of course, the first component mentioned below may be a second component within the technical spirit of the present invention.

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

As used herein, the term "part" or "module" refers to a hardware component such as software, FPGA, or ASIC, and the "part" or "module" plays 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 play one or more processors. Thus, as an example, a "part" or "module" may include components such as software components, object-oriented software components, class components, and task components, processes, functions, properties, Procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. Functions provided within components and "parts" or "modules" may be combined into smaller numbers 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 " It can be used to easily describe a component's correlation with other components. Spatially relative terms are to be understood as including terms in different directions of components in use or operation in addition to the directions shown in the figures. For example, when flipping a component shown in the drawing, a component described as "below" or "beneath" of another component may be placed "above" the other component. Can be. Thus, the exemplary term "below" can encompass both an orientation of above and below. Components may be oriented in other directions as well, so spatially relative terms may be interpreted according to orientation.

In the present specification, the computer refers to any kind of hardware device including at least one processor, and according to an embodiment, it may be understood as a meaning encompassing a software configuration that operates on the hardware device. For example, a computer may be understood as including, but not limited to, a smartphone, a tablet PC, a desktop, a notebook, and a user client and an application running on each device.

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

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

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, it can provide a variety of services in the middle. In one embodiment, the platform may receive a request for a data task from the requester, and match the worker corresponding to the request to allocate the client's data task to the worker. During data task assignment, the platform can use artificial intelligence models to provide workers with optimized UX / UI tools.

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

In addition, the platform may use the artificial intelligence model to inspect the work generated by the worker, request the worker to rework, or deliver it to the client.

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

As disclosed in FIG. 2, the system 1 may include first to sixth user terminals 11 to 16, a server 20, and an external server 21. In this case, at least one terminal of the first to sixth user terminals 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 be. In addition, 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 to third user terminals 11 to 13 are user terminals corresponding to the client, and the fourth to sixth user terminals 14 to 16 correspond to the seller. It is seen as a user terminal, but is not limited thereto.

In this case, the first user terminal 11 may transmit data to the server 20. The server 20 may shuffle the divided data and create a file having a small data size storing information about the divided data and information about the shuffle. The server 20 may encrypt the file and transmit the encrypted file to the first user terminal 11, and the first user terminal 11 may secure the entire data using only a file having a small data size.

Meanwhile, the server 20 may transmit the remaining data except 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 has a characteristic that it is difficult to infer the original data as randomly mixed data. Therefore, even if the attacker hacks the data stored in the external server 21, it is not possible to know the information about the original data transmitted by the first user terminal 11 can protect the original data. In addition, even if the attacker hacks the encrypted data stored in the first user terminal 11, the original data cannot be obtained if the encrypted data cannot be decrypted or if there is no divided data stored in the external server 21.

Meanwhile, 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 operation S105, the server 20 may acquire first data. In this case, the first data may be data provided from the first user terminal 11.

In operation S110, the server 20 may divide the obtained first data. In one embodiment, the server 20 may divide the first data into a predetermined size or a predetermined number. In detail, the server 20 divides the first data into 10 pieces of divided data, and the sizes of the 10 pieces of divided data may be the same. Alternatively, the server 20 may divide the first data into ten pieces of divided data, and the sizes of the ten pieces of divided data may be divided differently.

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

Alternatively, the server 20 may divide some of the first data into a predetermined size but divide the remaining data in any manner.

In operation S115, the server 20 may shuffle the divided first data. At this time, when the server 20 shuffles the divided first data, the server 20 may obtain information about the shuffle. That is, the server 20 may obtain shuffle information for reconstructing the shuffled data again. The server 20 may obtain shuffle information by using a method of shuffling divided data or adding index information to the divided data according to a predetermined algorithm.

In operation S120, the server 20 may acquire second data including split information and shuffle information about the divided first data.

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

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

That is, the server 20 may encrypt the second data for reconstructing the first data to prevent reconstruction of the first data without decryption. In addition, the server 20 may encrypt the third data that is part of the first data to prevent another user from reconstructing the complete first data even if another user knows the route to the second data.

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 server 20 encrypts the second data and the third data, 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, the first user terminal 11 using the encryption key of the second data and the first 3 Of course you can encrypt your data. Hereinafter, the server 20 will be described as performing data encryption, but various user terminals may perform the corresponding process.

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

In this case, the server 20 may delete the second data and the third data to improve security. On the other hand, 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 the blockchain. By storing data in the blockchain, forgery is impossible and security is improved. As described below, when a plurality of users share the first data, the encrypted data can be managed effectively. Details thereof will be described later.

In operation S135, the server 20 may transmit the remaining divided data except the third data among the divided first data to the external server 21.

That is, the server 20 may store the remaining data except the third data among the divided first data in the external server 21 having relatively low security. Even if the external server 21 is hacked by an attacker, 1) there is no information on how to arrange the divided data, and 2) the third data does not exist even if the information exists, so that the complete first data can be reconstructed. There will be no. 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 and flexibly setting the size of the third data.

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

Secure world refers to a secure data processing architecture. Normal world refers to a general data processing architecture. Two worlds operate selectively and two worlds cannot be used simultaneously.

In one embodiment, server 20 may use " ARM Trustzone Architecture ". The "ARM Trustzone Architecture" is known as ARM-divided runtime architecture for two microprocessor systems. This runtime-architecture includes two runtime environments. One such non-secure runtime environment may be referred to as a "normal zone" or a "normal world". The insecure runtime environment can be controlled by the 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 secure operating system. .

Here, the normal operating system may be a conventional operating system, for example, Android, Windows Phone, Symbian, etc., the safety operating system, for example, a security kernel incorporating security functions within the existing operating system, such as MOBICORE, RedCastle, etc. It may be an operating system in which a (security kernel) is inserted. According to the ARM trust zone, the non-secure runtime environment and the secure runtime environment described above may be defined as virtual execution environments.

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

In operation S140, the server 20 may receive a first data download request. In this case, the server 20 may receive a request for downloading 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 sends the 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 to perform a task among the various worker terminals, the server 20 itself may generate a first data download request.

In operation S145, the external server 21 may transmit the remaining divided data except 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 divided data except for the third data among the divided first data to the fourth user terminal 14.

In operation 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 be present to reconstruct and restore the first data, the server 20 may request the second user and the 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.

In this case, the method of determining whether the request is valid may vary. In an 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 key.

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

In this case, when 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 secret key.

In operation 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 receives 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 has been shuffled, the server 20 may reconstruct and restore the divided first data.

In addition, the server 20 may transmit the restored first data to the fourth user terminal 14.

On the other hand, in another embodiment according to the present invention, the external server 21 stores the divided first data except the third data, and stores the plurality of other divided (but insufficient) data in the same manner. There may be. In this case, the external server 21 may randomly store the divided first data and the remaining divided data. When storing data in the above manner, the external server 21 may store a plurality of divided data without distinction so that the attacker may not know what the divided first data is.

In order to identify the first data divided among the plurality of data, the server 20 may add an arbitrary index to each of the divided first data. Furthermore, it is a matter of course that all the divided data stored in the external server 21 may have different indices. The added indexes are different for each of the divided first data, and only the index of the divided data does not determine whether the corresponding data is the divided first data. Accordingly, the server 20 may generate, as partition information, information about a table in which the added indexes are sorted according to the order of the divided first data. The generated split information may be included in the second data. In this case, the index may be inserted at a specific position of the divided data, and such position information may also be included in the partition information. Furthermore, the split information may further include size information of the index.

For example, it may be assumed that the first data is divided into 1-1 data, 1-2 data, and 1-3 data. For example, the 1-1 data may be 0010, the 1-2 data may be 1111, and the 1-3 data may be 0000. In this case, it is assumed that the specific location information may be 'after the second bit of data', for example, and the size of the index is 2 bits. At this time, 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. Was

The server 20 may store the information 'the index starts after the first two bits and has a size of 2 bits' as the second data. That is, the second data has information that the third and fourth bits are indexes. Furthermore, the second data may further include data of 000110. The first two digits of 000110 are indices of the 1-1 data, the next two digits are indices of the 1-2 data, and the last two digits are indices 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 first data divided 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. However, this is for convenience of description only. When the size of the index becomes larger than a preset value, the frequency of occurrence of the same index is significantly lowered. On the other hand, even if there is a case where the fragment data having the same index exists, since all the fragment data existing in the external server 21 has a different index, in this case a plurality of having the same index by using the size information of the divided data The divided first data may be found in the data (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 operation S210, the server 20 may sequentially add an index to the divided data.

In operation S220, the server 20 may randomly shuffle the data to which the index is added (operation S220).

As described above, the index may be inserted in a specific size at a specific position of the divided data. Since location and size information is encrypted, an attacker cannot know what an index is.

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

In the above-described example, when the server 20 obtains the first-first data having the index 00, the first-third data having the index 10, and the first-second data having the index 01, the index information included in the second data. By using 000110, data may 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 operation S310, the server 20 may shuffle the divided first data according to a preset algorithm. In this case, the preset algorithm may be, for example, an algorithm for mixing odd-numbered data and even-numbered data after division, or an algorithm for sorting in ascending or descending order according to the order of the number of zeros or the number of ones of the divided data ( If the number of 0 or 1 is the same, they 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) may be stored in the external server 21 in the shuffled order.

In operation S320, the server 20 may reconstruct the divided first data by inversely converting the preset algorithm.

In the case of the embodiment of Fig. 6, since the external server 21 should store the divided first data in the shuffled order, it will not be able to randomly mix and manage all the data as described above.

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.

In detail, the first data may be data shared by a plurality of user terminals. In this case, when the first data down request is requested, the first data should be downloaded only when the plurality of users or the predetermined number of persons agree.

For convenience of explanation, hereinafter, the 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 be applied to three or more user terminals. Of course it can.

In operation 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 the second data including the partition information and the shuffle information. In this case, the second data including the split information and the shuffle information may be the same as the second data provided to the first user terminal 11, but is not limited thereto.

In an exemplary embodiment, the first user terminal and the second user terminal 12 may obtain and divide second data including split information and shuffle information, and encrypt only their own data. Specifically, the second data is divided into 2-1 data and 2-2 data, the first user terminal 11 encrypts the 2-1 data and the third data, and the second user terminal 12 The second-2 data and the fourth data may be encrypted. In this case, the 2-1 data and the 2-2 data may have overlapping portions, but the present invention is 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 ratio of the second data of the second user terminal 12. to be. In other words, the smaller the data for the second data, the more difficult it is to reconstruct the first data (by a hacking method or the like), so that the second data may be divided according to the stake ratio. Alternatively, the 2-1 data may include split information of the second data, and the 2-2 data may include shuffle information of the second data.

Meanwhile, when a plurality of user terminals share 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 terminals can receive encrypted data for the second data. The other user terminal may have only at least one piece of divided data among the divided first data.

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

On the other hand, when the encrypted data is shared by a plurality of user terminals, the encrypted data 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 of the blockchain to prevent data forgery and modulation in the plurality of user terminals. To this end, each node may include a block generator and manage data stored in the blockchain through the block generator.

In this case, the block generation unit may further include a protocol for decrypting the encrypted data as well as the encrypted data and transmitting the decrypted data to the server 20 and storing the encrypted data in the block chain. For example, when the second data and the third data are requested from the user terminal having the specific data, the server 20 sends the second data and the third data decrypted according to the protocol stored in the block chain by the block generator. Can transmit In this case, the specific data is an arbitrary terminal generated for decoding by the user terminals sharing the first data, and the user terminal having the specific data is a terminal that receives the specific data from the user terminals sharing the first data ( For example, it may be the 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 operation S430, the server 20 may receive a first data download request.

In this case, the server 20 may receive a request for downloading 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 a fourth user The terminal 14 may receive a first data download request. In another embodiment, when the server 20 determines that the fourth worker terminal 14 is suitable to perform a task among the various worker terminals, the server 20 itself may generate a first data download request.

In operation S440, the server 20 may download remaining divided data except for 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 divided data except for the third data among the divided first data to the fourth user terminal 14.

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

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

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

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

In this case, if the encrypted data is not received from any one of the first user terminal 11 or the second user terminal, since the first data reconstruction is impossible, the shared first data may be more safely managed.

In the above-described embodiment, the server 20 divides the first data and encrypts the second data and the third data, but the present invention is not limited thereto. In other words, the above-described operation of the server 20 may be performed by the first user terminal 11.

In an embodiment, the first user terminal 11 may divide the first data and generate second data including the split information and the shuffle information. The first user terminal 11 may transmit the remaining divided data except for 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, transmits the second data and the third data obtained by decrypting the encrypted data to the server 20. Can be.

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

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

The processor 102 may include a connection passage (eg, a bus, etc.) that transmits and receives signals with one or more cores (not shown) and graphics processor (not shown) and / or other components. .

Meanwhile, the processor 102 may include random access memory (RAM) and read-only memory (ROM) for temporarily and / or permanently storing a signal (or data) processed in the processor 102. , Not shown) may be further included. In addition, the processor 102 may be implemented in the form of a system on chip (SoC) including at least one of a graphic processor, a RAM, and a 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, in a software module executed by hardware, or by a combination thereof. The software module 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 in any form of computer readable recording medium well known in the art.

The components of the present invention may be embodied as a program (or an application) and stored in a medium for execution in combination with a computer which is hardware. The components of the present invention may be implemented as software programming or software elements, and likewise, embodiments may include various algorithms implemented in combinations of data structures, processes, routines or other programming constructs, such as C, C ++. It may be implemented in a programming or scripting language such as Java, an assembler, or the like. The functional aspects may be implemented with an algorithm running on one or more processors.

In the above, embodiments of the present invention have been described with reference to the accompanying drawings, but those skilled in the art to which the present invention pertains may implement the present invention in other specific forms without changing the technical spirit or essential features. I can understand that. Therefore, it should be understood that the embodiments described above are exemplary 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: sixth user terminal
20: server
21: External server

Claims (12)

In the data security method,
Acquiring, by the server, first data from the first user terminal;
Dividing, by the server, the obtained first data;
The server shuffling the divided data in a predetermined method;
Acquiring, by the server, second data including information on the obtained first data division and information on the preset method;
Encrypting, by the server, at least one third data and the second data of 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, the remaining divided data except for the third data among the divided first data to an external server; Including,
The server, receiving a request to download the first data;
Transmitting, by the external server, the remaining divided data except for the third data among the divided first data to the server according to the request;
Requesting, by the server, the at least one third data and the second data to the first user terminal;
Decrypting, by the first user terminal, the encrypted and stored data when the request of the external server is valid;
Transmitting, by the first user terminal, the decoded second data and third data to the external server; And
Reconstructing, by the external server, 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,
Randomly shuffles 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 the added indexes are arranged according to the order of the divided first data, position information to be added to a predetermined position of each of the divided first data, and size information of the index.
Reconstructing the divided first data based on the second data,
Extracting an index from each of the divided first data based on the position information;
Reconstructing the partitioned first data based on the extracted index and the table information; Including,
Encrypting using the first encryption key,
A data security method characterized by being encrypted in a secure world environment, which is a secure runtime environment of the ARM TrustZone architecture. delete delete delete Claim 5 was abandoned upon payment of a set-up fee. The method of claim 1,
The shuffling step,
Shuffle the divided first data according to a preset algorithm,
The reconstructing step,
And reconstructing the divided first data by inversely transforming the preset algorithm. Claim 6 has been abandoned upon payment of a setup registration fee. The method of claim 1,
And the second data and the third data are encrypted with different encryption keys, respectively. Claim 7 was abandoned upon payment of a set-up fee. The method of claim 1,
When the first data is shared by the first user terminal and the second user terminal,
Encrypting, by the server, at least one fourth data and the second data of the divided first data using a second encryption key;
The server, transmitting the encrypted data to the second user terminal; Data security method further comprises. Claim 8 has been abandoned upon payment of a set-up fee. The method of claim 7, wherein
The server, receiving a request to download the first data;
Transmitting, by the external server, the divided data other than the third data and the fourth data among the divided first data to the server according to the request;
Requesting, by the server, the second data, third data, and fourth data from the first user terminal and the second user terminal;
Decrypting, by the first user terminal and the second user terminal, the encrypted and stored data when the request of the server is valid;
Transmitting the decrypted data to the server by the first user terminal and the second user terminal; And
The server may further include 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; Data security method comprising a. Claim 9 was abandoned upon payment of a set-up fee. The method of claim 8,
The first user terminal and the second user terminal, if the request of the server is valid, decrypting the encrypted stored data,
Decrypting the encrypted and stored data when more than a predetermined number of users of the first user terminal and the second user terminal agree to decrypt. Claim 10 has been abandoned upon payment of a setup registration fee. The method of claim 9,
And the second data, the third data and the fourth data are stored in a blockchain. Memory for storing one or more instructions; And
A processor for executing the one or more instructions stored in the memory;
The processor executes the one or more instructions,
An apparatus for carrying out the method of claim 1. A computer program, coupled to a computer, which is hardware, stored on a recording medium readable by a computer to perform the method of claim 1.

Images