WO2019234850A1

WO2019234850A1 - Security system and data processing apparatus

Info

Publication number: WO2019234850A1
Application number: PCT/JP2018/021708
Authority: WO
Inventors: 太郎上野; 智光本橋
Original assignee: サスメド株式会社
Priority date: 2018-06-06
Filing date: 2018-06-06
Publication date: 2019-12-12
Also published as: JPWO2019234850A1

Abstract

According to the present invention, when transmitting data generated by a client 100 to a server 200 that is connected thereto via a distributed network, a hash value is calculated by performing hash calculation with respect to the combination of the data generated by the client 100 and confidential information issued by the client 100, and, as a result of transmitting said data and hash value to the server 200 as a data set, even if an unauthorized user who does not know the confidential information inputs the data and the hash value thereof to the server 200 by spoofing the identity of the client 100, a hash value calculated from a combination of spoofed data and the confidential information does not match the hash value stored in the server 200 when verified, and thus, it is possible to determine that the transmitted data is spoofed illegitimate data.

Description

Security system and data processing apparatus

The present invention relates to a security system and a data processing apparatus, and more particularly to a technique for preventing fraudulent acts such as spoofing and falsification by a third party for data provided from a client to a server.

In recent years, the use of blockchain technology has increased in various fields. A block chain is a system for storing data by generating data units called blocks at regular intervals and connecting them like a chain. Since the contents of a certain block depend on the hash value of the immediately preceding block, it is said that tampering with a block once added to the chain is not possible unless all subsequent blocks are discarded.

As described above, after data is written to the block chain network, it is possible to make it difficult to alter the data due to the characteristics of the block chain. However, there are the following problems at the stage before data is written to the servers constituting the nodes on the block chain. First, there is a possibility that data is falsified before data is written from the client to the server. Second, when data is written to the block chain by client impersonation, it cannot be distinguished from true data.

In addition, a technique for preventing falsification of data by calculating a hash value for each generated data and creating a hash chain is disclosed (for example, see Patent Documents 1 to 3). There is also known a technique for improving authentication accuracy by performing hash calculation by combining predetermined information and secret information (see, for example, Patent Documents 4 and 5).

JP 2006-3437 A Japanese Patent Laying-Open No. 2015-180097 Japanese Patent No. 5753273 JP 2012-3648 A Japanese Patent Laying-Open No. 2015-231177

However, the secret information described in Patent Document 4 is transmitted from the client to the server and stored, and is used for verifying the validity of the server device during the authentication process. Therefore, even if the technique described in Patent Document 4 is used, it is not possible to distinguish illegal data written in the server by client impersonation from legitimate data.

On the other hand, the system described in Patent Document 5 adds unique secret information different for each user to personal information, creates unique data for each user, and correctly identifies the user by collating the hash. is there. However, the hash calculation including the secret information is performed by the registration authority server of the biometric authentication service system issuing the secret information. This is because when the registration authority gives an anonymous ID to a user, when the user makes an application for biometric authentication to the application provider, the anonymous ID and the actual user ID are given to the application provider. This is to ensure the legitimacy of the association. Therefore, even if the technique disclosed in Patent Document 5 is used, it is not possible to distinguish illegal data written on the server by impersonating the client from legitimate data.

The present invention has been made to solve such a problem, and an object of the present invention is to make it possible to distinguish illegal data written on a server by impersonating a client from legitimate data. It is another object of the present invention to prevent data from being falsified in the client before being written to the server.

In order to solve the above-described problem, in the present invention, when data generated by a client is transmitted to a server connected by a distributed network, data generated by the client, secret information issued by the client, A hash value is calculated by performing a hash calculation on the combination of the data, and the data and the hash value are transmitted to the server as a data set.

In another aspect of the present invention, when a hash value is calculated from a combination of secret information with respect to certain data in the client, the hash value that has already been calculated with respect to another data is further combined to generate certain data, secret information, A hash value is calculated by performing a hash calculation on a combination with a calculated hash value for another data.

According to the present invention configured as described above, even if a third party who does not know the secret information writes the data and the hash value to the server by impersonating the client, the spoofed data and the secret information Since the hash value calculated from this combination does not match the hash value written in the server, it can be determined that the data is illegal data by impersonation. As described above, according to the present invention, it is possible to distinguish illegal data written in the server by client impersonation from legitimate data.

According to another feature of the present invention, a hash chain in which a plurality of data generated in the client are linked by a hash value is formed. For this reason, even if it is attempted to falsify certain data, it is necessary to falsify all other data connected by the hash chain, which makes it difficult to falsify. Thus, according to the present invention, it is possible to prevent data from being falsified in the client before being written to the server.

It is a figure which shows the example of whole structure of the security system by this embodiment. It is a block diagram which shows the function structural example of the client by this embodiment. It is a figure which shows typically the content of the hash calculation by a hash calculating part. It is a block diagram which shows the function structural example of the server by this embodiment. It is a figure which shows typically the content of the hash calculation by a memory | storage control part.

Hereinafter, an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a diagram illustrating an example of the overall configuration of a security system according to the present embodiment. As shown in FIG. 1, the security system according to the present embodiment includes a client 100 that generates data and transmits it to a server, and a plurality of servers 200A to 200C connected by a distributed network (hereinafter, any one is specified). If not, it may be simply referred to as server 200).

The client 100 corresponds to a data processing device and may be any terminal as long as it has a function of generating data. For example, the client 100 is configured by a personal computer, a smartphone, a tablet terminal, an in-vehicle terminal, a game terminal, a dedicated processing terminal in various industries, and the like. In practice, there are a plurality of clients 100, but only one is shown for convenience of explanation.

The client 100 and the server 200 are configured to be connectable via a communication network such as the Internet or a mobile phone network. Although FIG. 1 shows a state where the client 100 is connected to the server 200A, the client 100 can be arbitrarily connected to any of the servers 200A to 200C in the distributed network.

Block chain technology is introduced in the plurality of servers 200A to 200C connected by a distributed network. That is, as will be described later, data is shared among the plurality of servers 200A to 200C by the block chain technology. For simplicity of illustration, FIG. 1 shows three servers 200A to 200C, but there may be two servers or four or more servers.

In this embodiment, it is assumed that a user who participates in a certain project repeatedly generates data in the client 100 and sequentially transmits the generated data to the server 200. The project is optional. An example is a clinical trial (clinical trial) for confirming the safety and efficacy of drugs, medical devices, treatment methods, and the like. In this case, the client 100 repeatedly generates various clinical trial data related to the patient and transmits the generated clinical trial data to the server 200 on a daily basis until the trial is completed. The clinical trial data is data including at least one of biological information measured for a patient, answer information for an inquiry including a patient's symptoms, and information indicating results of various tests.

Recently, attempts have been made to use smartphones installed with dedicated applications for disease treatment (hereinafter referred to as treatment apps) for disease treatment. For example, development of therapeutic applications aimed at treating diseases such as nicotine dependence and sleep disorders through improvement of the lifestyle of patients is being promoted. In order to use a therapeutic application as a medical device, it is necessary to obtain approval for the Law on Medical Products, Medical Devices, and the like. In order to obtain the approval, it is necessary to conduct a clinical trial to verify the effectiveness of the therapeutic effect using the therapeutic application. In this case, the client 100 generates various clinical trial data by executing the treatment application, and repeatedly transmits the generated clinical trial data to the server 200 on a daily basis until the trial is completed.

It should be noted that the clinical trials listed here are merely examples of the project and are not limited thereto. For example, launching a new business or developing a new product in a company is an example of a project. The project can be applied to the security system according to the present embodiment as long as data is repeatedly generated and transmitted to the server 200 periodically or irregularly in the client 100 during the period from the start to the end of the project. Is possible.

FIG. 2 is a block diagram illustrating a functional configuration example of the client 100 according to the present embodiment. As shown in FIG. 2, the client 100 according to the present embodiment includes a secret information issuing unit 11, a data generation unit 12, a hash calculation unit 13, a data set transmission unit 14, and a secret information transmission unit 15 as functional configurations. Yes. In addition, the client 100 of the present embodiment includes a secret information storage unit 16 and a data storage unit 17 as nonvolatile storage media.

The above functional blocks 11 to 15 can be configured by any of hardware, DSP (Digital Signal Processor), and software. For example, when configured by software, each of the functional blocks 11 to 15 actually includes a CPU, RAM, ROM, etc. of a computer, and is stored in a recording medium such as a RAM, ROM, hard disk, or semiconductor memory. Is realized by operating.

The secret information issuing unit 11 issues secret information. The secret information can be a character string composed of a combination of alphanumeric characters with a predetermined number of digits generated by a random number generator, for example. Alternatively, it may be a character string arbitrarily set by the user of the client 100. For example, when conducting a clinical trial of the above-described therapeutic application, the secret information issuing unit 11 issues secret information as one function of the therapeutic application when installing the therapeutic application on the client 100 and starting the clinical trial.

The secret information issued by the secret information issuing unit 11 is stored and stored in the secret information storage unit 16. The secret information stored in the secret information storage unit 16 is used when calculating a hash value of data generated in the client 100, as will be described later. The hash value calculated in this way is transmitted to the server 200, but the confidential information is not transmitted to the server 200 until the trial is completed, and is kept secret in the client 100.

The data generation unit 12 generates data to be transmitted to the server 200. The data generation unit 12 repeatedly generates data having different contents as one project. For example, when the present embodiment is applied to a clinical trial of a therapeutic application, the data generation unit 12 repeatedly generates clinical trial data with different contents daily. In addition, when the present embodiment is applied to the execution of a business project in a company, the data generation unit 12 repeatedly generates minutes data with different contents daily, weekly, or irregularly.

The data generated by the data generation unit 12 is stored and stored in the data storage unit 17. Note that when the generated data is stored in the data storage unit 17, the data generation unit 12 may encrypt the data and store the encrypted data in the data storage unit 17. Further, the data generated by the data generation unit 12 is transmitted to the server 200 via the data set transmission unit 14.

Each time data is generated by the data generation unit 12, the hash calculation unit 13 performs a combination of the generated data and the secret information issued by the secret information issue unit 11 and stored in the secret information storage unit 16. A hash value is calculated by performing a hash calculation. The hash value calculated by the hash calculation unit 13 is stored in the data storage unit 17 in association with the corresponding data, and stored until the project is completed. Further, the hash value calculated by the hash calculation unit 13 is transmitted to the server 200 via the data set transmission unit 14.

When the hash calculation unit 13 calculates a hash value from a combination of secret information with respect to certain data, the hash calculation unit 13 further combines the hash value stored in the hash value storage unit 17, that is, a hash value that has already been calculated for another data. To calculate the hash value. That is, the hash calculator 13 has calculated the above-mentioned certain data (data generated this time by the data generator 12), the secret information stored in the secret information storage unit 16, and another data, and has calculated the hash value storage unit. A hash value is calculated by performing a hash calculation on the combination with the hash value stored in 17.

The hash value that has already been calculated for another data may be any hash value that has already been calculated for previously generated data. As an example, a hash value calculated for the data generated immediately before can be used.

FIG. 3 is a diagram schematically showing the contents of the hash calculation performed by the hash calculation unit 13. In FIG. 3, the vertical direction is the time axis, and the top is at the start of the project, and the time has passed toward the bottom. In the example shown in FIG. 3, the secret information issued by the secret information issuing unit 11 (secret information stored in the secret information storage unit 16) is a character string “abc”. This secret information “abc” is issued at the start of the project and is used repeatedly until the project is completed.

The data generation unit 12 repeatedly generates data “Data 1”, “Data 2”, “Data 3”,. First, when the first data “Data1” is generated by the data generation unit 12, the hash calculation unit 13 includes the first data “Data1” and the secret information stored in the secret information storage unit 16. The first hash value “Hash1” is calculated by performing hash calculation on the combination with “abc”. The first hash value “Hash1” calculated by the hash calculator 13 is stored in the data storage unit 17 in association with the first data “Data1”.

Next, when the second data “Data2” is generated by the data generation unit 12, the hash calculation unit 13 stores the second data “Data2” and the secret stored in the secret information storage unit 16. A second hash value “Hash2” is calculated by performing a hash calculation on the combination of the information “abc” and the first hash value “Hash1” stored in the data storage unit 17. The second hash value “Hash2” calculated by the hash calculation unit 13 is stored in the data storage unit 17 in association with the second data “Data2”.

Next, when the third data “Data3” is generated by the data generation unit 12, the hash calculation unit 13 includes the third data “Data3” and the secret information stored in the secret information storage unit 16. A third hash value “Hash3” is calculated by performing a hash calculation on the combination of “abc” and the second hash value “Hash2” stored in the data storage unit 17. The third hash value “Hash3” calculated by the hash calculation unit 13 is stored in the data storage unit 17 in association with the third data “Data3”.

In the same manner, each time data is generated by the data generation unit 12, a hash value is calculated. As described above, in this embodiment, when the hash value is calculated from the combination with the secret information for the latest data generated this time, a hash value obtained by further combining the hash values already calculated for the other data generated immediately before. A value is calculated, and the calculated hash value is stored in association with the latest data.

Through the above processing, a hash chain in which a plurality of data generated in the client 100 are linked by a hash value is formed. For this reason, even if it is attempted to falsify certain data, it is necessary to falsify all other data connected by the hash chain, which makes it difficult to falsify. As a result, it is possible to prevent falsification of data generated by the client 100.

The data set transmission unit 14 transmits the data generated by the data generation unit 12 and the hash value calculated by the hash calculation unit 13 to the server 200 as a data set. The hash calculation unit 13 and the data set transmission unit 14 perform processing each time data is generated by the data generation unit 12 and repeatedly transmit the data set to the server 200. For example, when data is generated daily by the data generation unit 12, the processes of the hash calculation unit 13 and the data set transmission unit 14 are also performed daily, and the data set is repeatedly transmitted to the server 200 on a daily basis.

In the case of the example shown in FIG. 3, in the data set transmission unit 14, the first data “Data1” is generated by the data generation unit 12, and the first hash value “Hash1” is correspondingly generated by the hash calculation unit 13. "Is calculated, the two are combined into a first data set {Data1, Hash1}, which is transmitted to the server 200.

Next, when the second data “Data2” is generated by the data generation unit 12 and the second hash value “Hash2” is calculated by the hash calculation unit, the data set transmission unit 14 The two data sets are combined into a second data set {Data2, Hash2}, which is transmitted to the server 200.

Furthermore, when the third data “Data3” is generated by the data generation unit 12 and the corresponding hash value “Hash3” is calculated by the hash calculation unit, the data set transmission unit 14 The two are combined into a third data set {Data3, Hash3}, which is transmitted to the server 200. The same applies to the fourth and subsequent items.

The server 200 collects the data sets transmitted from the client 100 in this way in units of blocks, and stores them in a time series as block data. The storage of the block data is performed by a known method using a so-called block chain technique.

The secret information transmission unit 15 transmits the secret information to the server 200 at the end of the project. This is because the secret information is used when verifying the validity of the data sequentially transmitted from the client 100 to the server 200 and stored during the execution of the project.

Here, the timing for verifying the validity of the data is set at the end of the project, but it is not necessarily limited to this. For example, if it is necessary to verify the validity of data stored in the server 200 even in the middle of the project execution, secret information may be transmitted to the server 200 at that timing. When secret information is transmitted to the server 200 in the middle of the project, another secret information may be reissued in the client 100, and thereafter, the reissued secret information may be used.

FIG. 4 is a block diagram illustrating a functional configuration example of the server 200 according to the present embodiment. Although the functional configuration of the server 200A is shown here, the

other servers

200B and 200C are configured similarly.

As shown in FIG. 4, the server 200A according to the present embodiment includes a data set acquisition unit 21, a consensus processing unit 22, a storage control unit 23, a secret information acquisition unit 24, and a verification unit 25 as its functional configuration. Further, the server 200A includes a data storage unit 26 as a storage medium.

The above functional blocks 21 to 25 can be configured by any of hardware, DSP, and software. For example, when configured by software, each of the functional blocks 21 to 26 is actually configured by including a CPU, RAM, ROM, etc. of a computer, and a program stored in a recording medium such as RAM, ROM, hard disk, or semiconductor memory. Is realized by operating.

The data set acquisition unit 21 sequentially acquires the data sets transmitted from the client 100. The consensus processing unit 22 performs consensus building processing for sharing the data set acquired by the data set acquisition unit 21 across the plurality of servers 200A to 200C. That is, the consensus processing unit 22 of the server 200A transmits the data set acquired by the data set acquisition unit 21 to the

other servers

200B and 200C, and performs a predetermined consensus building process.

As the consensus building process performed by the consensus processing unit 22, it is possible to use a consensus algorithm known in the block chain technology. For example, the consensus processing unit 22 verifies the validity of the data set acquired by the data set acquisition unit 21 by performing consensus formation processing using a PBFT (Practical Byzantine Fault Tolerance) consensus algorithm. Note that the consensus algorithm to be used is not limited to PBFT. For example, other consensus algorithms such as Proof of Work, Proof of Stake, Paxos, Raft, and Sieve may be used.

The storage control unit 23 stores the data set in the data storage unit 26 only when an agreement is formed by the consensus processing unit 22. As a result, the consensus data sets are distributed and stored in the plurality of servers 200A to 200A.

In addition, the storage control unit 23 collects data sets (data sets that are consensus-formed by the consensus processing unit 22) sequentially acquired by the data set acquisition unit 21 from the client 100 in units of blocks, and stores the data sets in a time series as block data 26 is stored. As a unit to be combined into block data, one block may be constituted by one data set, or one block may be constituted by a plurality of data sets.

At this time, the storage control unit 23 performs the hash calculation on the combination of the data set acquired this time by the data set acquisition unit 21 and the consensus formation and the hash value calculated for another data set, thereby obtaining a hash value. And the data set is stored in the data storage unit 26 in association with the hash value.

FIG. 5 is a diagram schematically showing the contents of the hash calculation performed by the storage control unit 23. In FIG. 5, the vertical direction is the time axis, and the top is at the start of the project, indicating that the time has passed toward the bottom. As shown in FIG. 5, the data set acquisition unit 21 sequentially acquires a plurality of data sets {Data1, Hash1}, {Data2, Hash2}, {Data3, Hash3},.

First, when the first data set {Data1, Hash1} is acquired by the data set acquisition unit 21 and consensus is formed by the consensus processing unit 22, the storage control unit 23 stores the data set {Data1, The first hash value “Hash11” is calculated by performing hash calculation on Hash1}. Then, the storage control unit 23 collects the first data set {Data1, Hash1} and the first hash value “Hash11” into one block, and stores them in the data storage unit 26 as block data.

Next, when the second data set {Data2, Hash2} is acquired by the data set acquisition unit 21 and consensus is formed by the consensus processing unit 22, the storage control unit 23 By performing a hash calculation on the combination of the data set {Data2, Hash2} and the first hash value “Hash11” stored in the data storage unit 26, the second hash value “Hash12” is obtained. calculate. Then, the storage control unit 23 collects the second data set {Data2, Hash2} and the second hash value “Hash12” into one block, and stores them in the data storage unit 26 as block data.

Next, when the third data set {Data3, Hash3} is acquired by the data set acquisition unit 21 and consensus is formed by the consensus processing unit 22, the storage control unit 23 determines that the third data set The third hash value “Hash13” is calculated by performing a hash calculation on the combination of the set {Data2, Hash2} and the second hash value “Hash12” stored in the data storage unit 26. To do. Then, the storage control unit 23 collects the third data set {Data3, Hash3} and the third hash value “Hash13” into one block, and stores them in the data storage unit 26 as block data.

In the same manner, each time a data set is acquired by the data set acquisition unit 21 and an agreement is formed by the consensus processing unit 22, a hash value is calculated. As described above, in this embodiment, when the hash value is calculated for the latest data set acquired this time from the client 100, the hash values already calculated for another data set acquired from the client 100 immediately before are further combined. Thus, the hash value is calculated, and the latest data set is stored in the data storage unit 26 in association with the calculated hash value.

Through the above processing, hash chains linked by hash values are formed for a plurality of data sets distributed and stored by the plurality of servers 200A to 200C. For this reason, even if it is attempted to falsify data in a certain data set, it is necessary to falsify all other data sets connected by a hash chain, which makes it difficult to falsify. Thereby, it is possible to prevent falsification of data stored in the server 200.

As described above, in this embodiment, a hash chain is formed in the client 100 and a hash chain is formed in the server 200, so a double chain is formed. In addition, the hash chain in the server 200 is configured by a chain of hash values calculated including the hash value calculated by the client 100. As a result, it is possible to prevent data alteration more firmly. That is, in order to falsify the data on the server 200, it is necessary to falsify the hash value stored in the data storage unit 26 of the server 200 and the hash value stored in the data storage unit 17 of the client 100. For this reason, tampering is more difficult than when only one type of normal block chain is applied to the server 200.

The secret information acquisition unit 24 acquires the secret information transmitted by the secret information transmission unit 15 of the client 100. The verification unit 25 verifies the validity of the data stored in the server 200 using the secret information acquired by the secret information acquisition unit 24. In other words, the verification unit 25 calculates a hash value by performing a hash calculation on the combination of the data in the data set stored in the data storage unit 26 and the secret information acquired by the secret information acquisition unit 24. The validity of the data is verified by calculating and confirming whether the calculated hash value matches the hash value in the data set.

For example, when verifying the validity of the data “Data1” included in the first data set {Data1, Hash1} illustrated in FIG. 5, the verification unit 25 uses the “Data1” and the secret information acquisition unit 24. A hash value is calculated by performing a hash calculation on the combination with the acquired secret information “abc”. Then, the verification unit 25 checks whether or not the calculated hash value matches the hash value “Hash1” included in the first data set {Data1, Hash1}. If they do not match, it is determined that the data is invalid (data generated by impersonation of the client 100).

When verifying the validity of the data “Data2” included in the second data set {Data2, Hash2} illustrated in FIG. 5, the verification unit 25 uses the “Data2” and the secret information acquisition unit 24 to verify the validity. A hash value is calculated by performing a hash calculation on the combination of the acquired secret information “abc” and the hash value “Hash1” included in the previous data set {Data1, Hash1}. Then, the verification unit 25 checks whether or not the calculated hash value matches the hash value “Hash2” included in the second data set {Data2, Hash2}. If they do not match, it is determined as invalid data. The same applies to the case of verifying the third and subsequent data.

As described above in detail, in this embodiment, when data generated by the client 100 is transmitted to the server 200 connected by the distributed network, the data generated by the client 100 and the data issued by the client 100 are issued. A hash value is calculated by performing a hash calculation on the combination with the secret information, and the data and the hash value are transmitted to the server 200 as a data set.

According to the present embodiment configured as described above, even if a third party who does not know the secret information writes the data and its hash value to the server 200 by impersonating the client 100, the spoofed data and the secret are verified during the verification. Since the hash value calculated from the combination with the information does not match the hash value written in the server 200, it can be determined that the data is illegal data by impersonation. Thus, according to the present embodiment, it is possible to distinguish illegal data written in the server by impersonating the client 100 from valid data.

In this embodiment, when the client 100 calculates a hash value from a combination of secret information with respect to certain data, the hash value that has already been calculated with respect to another data is further combined to generate certain data, secret information, A hash value is calculated by performing a hash calculation on a combination with a calculated hash value for another data. The hash value calculated in this way is stored in association with the corresponding data.

Thereby, a hash chain in which a plurality of data generated in the client 100 is linked by the hash value is formed in the client 100. For this reason, even if it is attempted to falsify certain data, it is necessary to falsify all other data connected by the hash chain, which makes it difficult to falsify. Therefore, according to the present embodiment, it is possible to prevent data from being falsified within the client 100 before being written to the server 200.

In this embodiment, when writing a data set (a combination of data and a hash value) transmitted from the client 100 to the server 200, the data set and a hash value calculated for another data set are also calculated. A hash value is calculated by performing a hash calculation on the combination. The hash value calculated in this way is stored in association with the corresponding data set.

Thereby, also in the server 200, the hash chain linked by the hash value is formed in association with a series of data sets. For this reason, the data set written in the server 200 can be prevented from being falsified. In particular, in the present embodiment, a hash value forming a hash chain in the client 100 is transmitted to the server 200, and a hash on the server 200 is obtained by a chain of hash values calculated using the hash value in the client 100. Since the chain is formed, the hash chain has a double structure, and data alteration can be made more difficult.

In the above embodiment, an example has been described in which both secret information for preventing spoofing of the client 100 and a hash chain for preventing falsification of data in the client 100 are implemented. It is not limited to this. For example, only the secret information for preventing impersonation of the client 100 may be implemented. In this case, the hash calculator 13 does not combine the hash values that have already been calculated for the other data, and the hash value is determined based on the combination of the data generated by the data generator 12 and the secret information stored in the secret information storage unit 16. May be calculated.

In the above-described embodiment, an example in which a hash chain is formed for a data set stored in the server 200 has been described. However, even without this, an effect of preventing impersonation of the client 100 and alteration of data in the client 100 is expected. it can. In this case, for example, the storage control unit 23 calculates a hash value by performing a hash calculation on the data set acquired by the data set acquisition unit 21 without combining hash values already calculated for another data set. The data set may be stored in the data storage unit 26 in association with the calculated hash value. Alternatively, the storage control unit 23 may store the data set acquired by the data set acquisition unit 21 in the data storage unit 26 without performing the hash calculation itself.

That is, for the client 100, (1) a pattern in which the generated data and secret information are combined and hashed, and (2) a combination of the generated data, secret information, and a hash value that has been calculated for another data is hashed. Two types of patterns to be applied are applicable. Regarding the server 200, (A) a pattern for storing the data set acquired from the client 100 as it is, (B) a pattern for storing the data set acquired from the client 100 by hashing, and (C) data acquired from the client 100 It is possible to apply three types of patterns in which a set and a hash value calculated for another data set are combined and hashed and stored. The two patterns on the client 100 side and the three patterns on the server 200 side can be arbitrarily combined and applied. Of these, the combination of (2) and (C) is the strongest security.

In addition, each of the above-described embodiments is merely an example of implementation in carrying out the present invention, and the technical scope of the present invention should not be construed in a limited manner. That is, the present invention can be implemented in various forms without departing from the gist or the main features thereof.

DESCRIPTION OF SYMBOLS 11 Secret information issuing part 12 Data generation part 13 Hash calculating part 14 Data set transmission part 15 Secret information transmission part 16 Secret information storage part 17 Data storage part 100 Client (data processing apparatus)
200 servers

Claims

A server connected by a distributed network, and a client that generates data and sends it to the server,
The above client
A data generation unit for generating the data;
A secret information issuing unit that issues secret information;
A hash calculator that calculates a hash value by performing a hash calculation on the combination of the data generated by the data generator and the secret information issued by the secret information issuer;
A data set transmission unit that transmits the data generated by the data generation unit and the hash value calculated by the hash calculation unit to the server as a data set;
The server
A security system comprising a storage control unit for storing the data set transmitted from the client.
When the hash calculation unit calculates a hash value from a combination of the certain data and the secret information, the hash calculation unit further combines the calculated hash values for the other data, and the certain data, the secret information, and the other data 2. The security system according to claim 1, wherein a hash value is calculated by performing a hash calculation on a combination of hash values that have already been calculated.
The security according to claim 1, wherein the storage control unit calculates a hash value by performing a hash calculation on the data set, and stores the data set in association with the calculated hash value. system.
The security according to claim 2, wherein the storage control unit calculates a hash value by performing a hash calculation on the data set, and stores the data set in association with the calculated hash value. system.
When the storage control unit calculates the hash value for a certain data set, the storage control unit further combines the hash values that have been calculated for another data set, and has already been calculated for the one data set and the other data set. The security system according to claim 3, wherein a hash value is calculated by performing a hash calculation on a combination of hash values, and the data set is stored in association with the calculated hash value.
When the storage control unit calculates the hash value for a certain data set, the storage control unit further combines the hash values that have been calculated for another data set, and has already been calculated for the one data set and the other data set. 5. The security system according to claim 4, wherein a hash value is calculated by performing a hash calculation on a combination of hash values, and the data set is stored in association with the calculated hash value.
The data generation unit repeatedly generates data of different contents as one project,
The hash calculation unit and the data set transmission unit perform processing each time the data generation unit generates the data and repeatedly transmit the data set to the server.
7. The client according to claim 1, further comprising a secret information transmitting unit that transmits the secret information to the server when verifying validity of data stored in the server. The security system described in the section.
A data generation unit for generating data;
A secret information issuing unit that issues secret information;
A hash calculator that calculates a hash value by performing a hash calculation on the combination of the data generated by the data generator and the secret information issued by the secret information issuer;
A data set transmission unit that transmits the data generated by the data generation unit and the hash value calculated by the hash calculation unit as a data set to a server connected by a distributed network. A data processing device.
When the hash calculation unit calculates a hash value from a combination of the certain data and the secret information, the hash calculation unit further combines the calculated hash values for the other data, and the certain data, the secret information, and the other data The data processing apparatus according to claim 7, wherein a hash value is calculated by performing a hash calculation on a combination of hash values that have already been calculated.