JP2007058590A - Subject identity decision system and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To erase an old file, and to update it into a new file under conditions that a file can be reproduced between terminals in a distributed environment where any management subject is not present. <P>SOLUTION: A subject which discloses a file adds digital signature by using a pair key by an erasure decision information adding means 102 for obtaining a public file. When erasing the public file, the subject adds the digital signature by using the pair key by an erasure information registering means 103. When disclosing a new file, the subject adds the digital signature by using the pair key by a relevant information adding means 104 for obtaining a new public file. When verifying that there is any erasure information to which the digital signature of the same subject as that of the digital signature of the public file is added by an erasure information verifying means 112, the subject which acquires a file erases the public file. Also, when verifying that the digital signature of the same subject as that of the public file is added to the new public file by a relevant information verifying means 113, the subject defines the new public file as an updated file. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to data management technology in a distributed environment, and more particularly to technology for managing data deletion and update in an environment where there is no management entity.

  A conventional data management method in a distributed environment is used to perform file management such as file deletion / update by file sharing in a distributed environment. An example of a file management method in a distributed environment is described in Non-Patent Document 1. The file management system described in this non-patent document 1 uses information that only the subject that published the file knows as a key for deletion, so that a file can be deleted / authorized for each file management subject in a distributed environment. Update is realized.

  This will be described in detail below with reference to the drawings. As shown in FIG. 3, the conventional file management system includes a deletion determination information adding unit 102, a deletion information registration unit 103, a deletion information verification unit 112, a file disclosure unit 101, and a file acquisition unit 111. Yes.

  The conventional file management system having such a configuration operates as follows. That is, when publishing a file, the deletion determination information adding unit 102 adds a deletion hash generated based on an arbitrarily created deletion key to the file as deletion determination information, and publishes it by the file publishing unit 101. Publish as a file. The file publishing means 101 makes it possible to arbitrarily refer to and browse a public file published from another terminal connected to the network in a distributed environment.

  Next, when deleting a file once released, the deletion information registration unit 103 deletes the deletion key itself and the original file created by the deletion information addition unit 102 when the file is released. The name is associated and registered in a form published on the network. The deletion key released by the deletion information registration unit 103 can be referred to and viewed from other similar terminals in the same manner as other public files.

  When the deletion key is registered in another terminal, the deletion information verification unit 112 checks whether there is a file associated with the terminal, and if it exists, downloads the corresponding file and the deletion key. .

Next, the deletion information is verified by regenerating the deletion hash from the public deletion key in the same manner as when the deletion hash is added to the public file and confirming the coincidence with the deletion hash added to the public file. As a result of the verification, the deletion of the public file existing in the file publishing means is executed only when it can be verified that it is a regular deletion key registered by the file management entity. When updating a file, the file is updated by first deleting the file using the above-described file deleting means and then registering the file with the same name again.
Matsushita et al., “P2P File Sharing System with Access Control Mechanism” 2005 Proc. 13-18

  The problem with the prior art is that once a file has been published, it can be deleted. However, if a new file is published again with the file that has been published once removed, It is indistinguishable whether it is published by the same entity as the disclosed entity or by a third party. For this reason, if a third party publishes a file illegally, it will prevent the entity that first released the file from deleting and updating the file. The reason for this problem is that the deletion key is a shared key, and once released for deletion, there is no difference in authority to release the update file.

  Therefore, the present invention has been invented in view of the above-described problems, and the object of the present invention is that when a file that has been released once is deleted and a new file is released again, The object is to provide a file management technique capable of distinguishing whether a file is disclosed by a subject who has made the file public or by a third party.

  In addition, an object of the present invention is to provide a file management technique capable of distinguishing whether a person who published a file has deleted the file or a third party has deleted it when the published file is deleted. is there.

  A first invention for solving the above-described problem is a public data subject identity determination system for judging the identity of a subject of data disclosure, wherein the identity of data to be disclosed is determined by an encryption key based on a public key cryptosystem. A means for encrypting identity determination information to be determined and creating a digital signature, and adding the digital signature and a decryption key for the encryption key or information for uniquely identifying the decryption key to the public data as related information And verifying the digital signature added to the public data and the digital signature added to the new public data to be newly released by the decryption key of the relation information of the public data, and when the verification is successful, The public data and the new public data have a judging means for judging that the public data is published by the same subject.

  A second invention for solving the above-mentioned problems is characterized in that, in the first invention, the data is a file.

  According to a third invention for solving the above-mentioned problems, in the first invention, the data is a file reference.

  According to a fourth invention for solving the above-mentioned problem, in any one of the first to third inventions, the coincidence between the decryption key of the relation information of the public data and the decryption key of the relation information of the new public data is verified. And a means for verifying the digital signature when they match.

  According to a fifth invention for solving the above-mentioned problem, in any one of the first to fourth inventions, an entity that deletes public data and an entity that discloses the data by using the encryption key used for the digital signature of the public data. The deletion information is verified by the means for encrypting the deletion identity determination information for determining the identity and creating the deletion information, and the decryption key of the relation information of the public data. And determining means for determining that the public data has been deleted by the data subject.

  A sixth invention for solving the above-mentioned problems is characterized in that, in any one of the first to fifth inventions, the identity determination information and the deletion identity determination information are hash values of public data. .

  A seventh invention for solving the above-mentioned problems is characterized in that, in any one of the first to fifth inventions, the identity determination information and the deletion identity determination information are references to public data.

  An eighth invention for solving the above-mentioned problems is characterized in that in any one of the first to seventh inventions, there is provided means for adding version management information indicating a relationship with previous data to public data.

  According to a ninth invention for solving the above-mentioned problems, in any one of the first to eighth inventions, there is provided means for adding additional information, which is accompanying information of the previous data, to the public data.

  A tenth invention for solving the above problem is a program for an information processing apparatus, which creates a digital signature by encrypting identity determination information for determining the identity of data to be disclosed using an encryption key based on a public key cryptosystem. A process for adding to the public data as a relation information, a process for adding the decryption key for the encryption key or information for uniquely identifying the decryption key, and a decryption key for the relation information for the public data. Verifying the digital signature added to the public data and the digital signature added to the new public data to be newly published, and if the verification is successful, the public data and the new public data are It is characterized by causing an information processing apparatus to execute processing for determining that the information has been released.

  An eleventh invention for solving the above problem is characterized in that, in the tenth invention, the data is a file.

  A twelfth invention for solving the above-mentioned problems is characterized in that, in the tenth invention, the data is a file reference.

  In a thirteenth invention for solving the above-mentioned problem, in any one of the tenth to twelfth inventions, verification is made between a decryption key of the relation information of the public data and a decryption key of the relation information of the new public data. The information processing apparatus is caused to execute processing for verifying a digital signature when they match.

  According to a fourteenth aspect of the present invention for solving the above-described problem, in any one of the tenth to thirteenth aspects, an entity that deletes public data and an entity that discloses the data by using the encryption key used for the digital signature of the public data The deletion identity is verified by verifying the deletion information by the process of creating the deletion information by encrypting the deletion identity determination information for determining the identity, and the decryption key of the relation information of the public data. According to the data subject, the information processing apparatus is caused to execute processing for determining that the public data has been deleted.

  In a fifteenth aspect of the present invention for solving the above-described problems, in any one of the tenth to fourteenth aspects, the identity determination information and the deletion identity determination information are hash values of public data. .

  A sixteenth invention for solving the above-mentioned problems is characterized in that, in any one of the tenth to fourteenth inventions, the identity determination information and the deletion identity determination information are references to public data.

  In a seventeenth invention for solving the above-described problem, in any one of the tenth to sixteenth inventions, the information processing apparatus is caused to execute a process of adding version management information indicating a relationship with previous data to public data. Features.

  An eighteenth invention for solving the above-mentioned problem is characterized in that, in any one of the tenth to seventeenth inventions, the information processing apparatus is caused to execute a process of adding additional information, which is accompanying information of previous data, to public data. And

  The present invention digitally signs relation information for determining identity of a subject using an asymmetric key pair of a public key cryptosystem, and further comprises relation information addition means and relation information verification means, which are newly disclosed. The relationship between the deleted file and the deleted file is added, and the relationship between the newly published file and the deleted file is verified. By adopting such a configuration, the object of the present invention can be achieved.

  The effect of the present invention is that when a file is published once and then deleted, when a new file is published again, the published file is not created by the deleted subject but created by a third party. In some cases, it is possible to detect that a new file has been illegally created by a third party.

  The reason is that when a new file is published, relation information using an asymmetric key pair of a public key cryptosystem that can be known only by the subject who created the previously published file is added.

  Next, the best mode for carrying out the invention will be described in detail with reference to the drawings.

  Referring to FIG. 1, the first embodiment of the present invention includes a file disclosure unit 101, a deletion determination information addition unit 102, a deletion information registration unit 103, a relationship information addition unit 104, and a file acquisition unit 111. The deletion information verification unit 112 and the relationship information verification unit 113 are included. Each of these means operates as follows.

  The file disclosing means 101 makes it possible to arbitrarily refer to and browse a file registered by the user from another terminal connected to the network in a distributed environment.

  Deletion determination information adding means 102 adds determination information for allowing a subject having deletion authority to delete a file to be disclosed later.

  The deletion information registration unit 103 registers information of a request to delete a file that has been disclosed by a subject having deletion authority.

  The relationship information adding unit 104 adds relationship information indicating that the newly disclosed file is related to the original file.

  The file acquisition unit 111 downloads the file that can be referred to by the file disclosure unit 101 to its own terminal.

  The deletion information verification unit 112 verifies the deletion information registered by the deletion information registration unit 102.

  The relationship information verification unit 113 verifies the relationship information added by the relationship information addition unit 103.

  Next, the overall operation of the present embodiment will be described in detail with reference to the flowcharts of FIGS.

  First, a step in which a subject (100 in FIG. 1) publishing a file publishes the file first will be described.

  The deletion determination information adding means 102 of the subject that publishes the file receives the file F0 and the decryption key Ku and the encryption key Kp using the public key encryption method (step A1 in FIG. 2), and uses the hash value of F0 as the encryption key Kp A digital signature S0 is created by encryption, and the digital signature S0 and the decryption key Ku are added to the file F0 to create a public file F0 ′ = F0 + S0 + Ku in the format 400 in FIG. 4 (step A2).

  Thereafter, the public file F0 'is published by the file publication unit 101, and the entity 110 that acquires the file can obtain the public file F0' via the network by the file acquisition unit 111 (step A3).

  The file publishing unit 101 and the file acquiring unit 111 may be server-based sharing or may be acquired by publishing in a distributed database. Further, the public file F0 'may be directly sent by e-mail or the like from the main body 100 that releases the file to the main body that acquires the file. In this case, the file publishing unit 101 transmits the file F0 'from the main body 100 that publishes the file to the main body 110 that acquires the file, and the file acquisition unit 111 receives the file from the main body 100 that publishes the file. Note that there may be a plurality of entities 100 that disclose files and entities 110 that acquire files. Further, the entity 100 that publishes a file and the entity 110 that acquires the file may exist in the same terminal.

  Next, a step of deleting a file by the main body 100 that discloses the file will be described.

  The deletion determination information adding means 103 of the subject 100 publishing the file receives the deletion request (step B1), and receives the file F0 input by the deletion determination information adding means 102, the decryption key Ku and the encryption key Kp by the public key cryptosystem. Then, the concatenation of the deletion flag X and the hash value of the file F0 is encrypted with the secret key Kp to create the public deletion information D0 in the format indicated by 401 in FIG. 4 (step B2).

  The public deletion information D0 is published by the main body 100 that releases the file using the file public means 101 or another means, and the main body 110 that acquires the file acquires the public deletion information D0.

  The deletion information verification unit 112 of the main body 110 that acquires the file verifies whether the public file F0 ′ is deleted with the public deletion information D0, and decrypts the public deletion information D0 with the decryption key Ku to determine that the deletion flag X exists. A match of the hash value of F0 is confirmed (step B3). If the deletion flag X exists and the hash values of F0 match, the entity 110 that acquires the file determines that the public file F0 ′ has been deleted, and if necessary, the public file F0 ′ contains the public file F0 ′. The display is suppressed, the acquired public file F0 ′ is deleted, or the public file F0 ′ is deleted from the shared space.

  Next, a step of publishing a new file as an updated version of the file F0 previously published by the main body 100 that publishes the file will be described.

  The relationship information adding means 104 of the subject 100 that publishes the file receives the new file F1 as an input (step C1), and uses the decryption key Ku and the encryption key Kp by the public key cryptosystem input by the deletion determination information adding means 101. Then, the hash value of the new file F1 is encrypted with the secret key Kp to create a digital signature S1, and the digital signature S1 and the decryption key Ku are added to the new file F1 as the relationship information, in the format indicated by 404 in FIG. A new public file F1 ′ = F1 + S1 + Ku is created (step C2). In the present embodiment, the decryption key Ku used to publish the public file F0 ′ is added to the new public file F1 ′. However, when the public file F0 ′ is acquired, the decryption key Ku is stored. If the decryption key Ku can be obtained by some means, it is not a necessary requirement to add the decryption key Ku used for publishing the public file F0 ′ to the new public file F1 ′.

  The newly published file F1 'is published by the file publishing unit 101 of the main body 100 that publishes the file, and is acquired by the file acquisition unit 111 of the main body 110 that acquires the file (step C3).

  The relationship information verification unit 113 of the main body 110 that acquires the file verifies that the newly published file F1 ′ is an updated version of the published file F0 ′, and therefore includes decryption included in the newly published file F1 ′ and the published file F0 ′. Confirmation of matching of the key Ku and verification of the digital signature S1 and the digital signature S0, that is, the digital signature S1 is decrypted with the decryption key Ku, and the result matches the hash value of the file F1, and the digital signature S0 is decrypted. Decrypting with the key Ku confirms that the result matches the hash value of the file F0 (step C4). If the decryption keys Ku included in the new public file F1 ′ and the public file F0 ′ do not match or the verification of the digital signature S1 or the digital signature S0 fails, the new public file F1 ′ is the public file. Assuming that it is not an updated version of F0 ′, the display of the newly released file F1 ′ is suppressed, the acquired newly released file F1 ′ is deleted, or the newly released file F1 ′ is deleted from the shared space as necessary. To do. In step C4, the decryption key Ku is verified. However, it is not a necessary requirement, and the identity of the subject can be determined even when the digital signature is verified. This is because, as described above, even if the decryption key is obtained by some means, if it is not the same as the decryption key added to the public file F0 ', verification of the digital signature fails. However, if verification of the decryption key match is performed first, there is an effect that verification can be performed in a short time when the subject is different.

  Next, the effect of this embodiment will be described.

In the present embodiment, the decryption key Ku and the encryption key Kp of the public key cryptosystem are used for the deletion determination information and the deletion information, and the file relationship is obtained by verifying the digital signature generated by the coincidence of the decryption key Ku and the encryption key Kp. Therefore, it is possible to detect a case where a subject who does not know the encryption key Kp registers a fake new file.
It should be noted that the file disclosure unit 101, the deletion determination information addition unit 102, the deletion information registration unit 103, the relationship information addition unit 104, the file acquisition unit 111, the deletion information verification unit 112, and the relationship information verification unit 113 described above. Can also be configured by a CPU that is operated by a program.

  Next, the best mode for carrying out the second invention of the present invention will be described in detail with reference to the drawings.

  The best mode for carrying out the second invention of the present invention is a mode in which the “file” in the best mode for carrying out the invention is not a file entity but a “file reference”. Here, the file reference indicates information for acquiring the file entity. For example, when the file is published on the WWW, it is a URL character string, and generally has a size larger than the file entity. Is small. In such a case, it may be more efficient not to calculate the hash value implemented in the best mode for carrying out the invention.

  The effect of the second embodiment will be described.

  In the present embodiment, if the possibility that a file reference is inferred by a third party is equal to or less than the possibility that the encryption key Kp of the public key cryptosystem is found, Similarly to the best mode, it is possible to detect a case where a subject who does not know the encryption key Kp registers a fake new file.

  Next, a mode for carrying out the third invention of the present invention will be described.

  The form for carrying out the third invention of the present invention is the form for implementing the first invention of the present invention or the form for carrying out the second invention of the present invention. In this embodiment, the information verification means is changed as shown in FIG.

  The owner information adding unit 501 in FIG. 5 is the same as the operation performed by the relationship information adding unit 104 in the embodiment of the first invention. In addition, the version management information adding unit 502 As the version management information, the hash value of the file before the change, the electronic signature of the file before the change, the last update date and time, the version number, and the like are added to the public file F1 ′ as indicated by 701 in FIG.

  At this time, the digital signature S1 including the version management information V is set to S1 = Kp (H (F1 + V)) or S1 = Kp (F1 + V) (step D1 in FIG. 6). In addition, the additional information adding unit 503 adds a comment, a link, and the like as additional information to the public file F1 'as indicated by 701 in FIG. The addition of version management information and additional information is arbitrary, and the number of information to be added is not limited.

  The owner information verification unit 504 in FIG. 5 is the same unit as the operation performed by the relationship information verification unit 113 in the embodiment of the first invention. In addition, the version management information extracting unit 505 extracts the version management information added by the version management information adding unit 502 (step D2). The extracted version management information is used by an application such as displaying it on a screen.

  The additional information extraction unit 506 extracts the additional information added by the additional information load unit 503. The extracted additional information is used by an application such as displaying it on a screen.

  The effect of the third embodiment will be described.

  In this embodiment, by embedding version management information and additional information in a public file, useful information such as an update history and comments can be transmitted to the user.

  Next, the operation of the best mode for carrying out the present invention will be described using specific examples.

  As a first embodiment, a case in which the subject P1 deletes a published file after publishing the file will be described.

  The subject P2 acquires a file disclosed by the subject P1. The subject P1 creates the file F0, and at the same time or in advance, creates a key pair (Ku, Kp) unique to the file F0 by the RSA public key cryptosystem. The key pair (Ku, Kp) does not necessarily have to be unique to the file F0. For example, a key pair shared by a specific group can be used.

  Next, the subject P1 creates the digital signature S0 of the file F0 by encrypting the hash value H (F0) of the file F0 using the SHA2 hash function with the encryption key Kp, and the digital signature S0 and the decryption key are added to the file F0. Ku is added to create a public file F0 ′ = F0 + S0 + Ku.

  The subject P1 registers the public file F0 'in a P2P (Peer-to-Peer) file sharing system so that the subject P2 can obtain it. As a P2P file sharing system, for example, a system using application level broadcast is conceivable.

  After obtaining the public file F0 ', the subject P2 verifies the digital signature S0. This confirms that the digital signature S0 is decrypted with the decryption key Ku and matches the hash value H (F0) of the file F0. Verification of the decryption key Ku can be performed as necessary.

  Next, an operation when the subject P1 edits the file F0 to make a new file F1 will be described.

  The subject P1 first creates deletion information D0 by encrypting a concatenation of the deletion flag “DELETE” and the hash value H (F0) with Kp. The subject P1 shares or sends the deletion information D0 to the subject P2. The subject P2 acquires the deletion information D0 and verifies that it is the deletion information of the public file F0 '. This is done by decrypting the deletion information D0 with Ku included in the public file F0 ′ and confirming the match between the existence of the deletion flag “DELETE” and the hash value H (F0) of the file F0 included in the public file F0 ′. Done. If the verification is successful, the subject P2 deletes the file F0 'and does nothing if the verification fails.

  Instead of using the deletion flag, H (H (F0)) obtained by multiplying the hash function twice or H ′ (F0) using another hash function can be encrypted with Kp as deletion information. Alternatively, as in 402, the deletion flag X and the hash value of the file F0 may be concatenated and the digital signature Sd = Kp (X + H (F0)) or Sd = Kp (X + F0) added may be used as the deletion information. Next, the subject P1 creates a new public file F1 'for the new file F1 in the same manner as the public file F0' is created from the file F0. The key pair used at this time is (Ku, Kp) used when creating the public file F0 '.

  Next, the subject P2 acquires the new public file F1 ′ by the same method as the method of acquiring the public file F0 ′, and Ku included in the new public file F1 ′ is the Ku that was included in the public file F0 ′. Confirm that the digital signature can be verified. If Ku matches and the digital signature can be verified, the newly published file F1 'is regarded as an updated version of the published file F0'. Otherwise, it is ignored or treated as a completely different file. If there is a time lag between when the deletion information D0 is released and the public file F0 ′ is deleted and when the new public file F1 ′ is released and the relationship with the public file F0 ′ is verified, the update will not be successful. In this case, there is a possibility that the newly published file F1 ′ is converted into the format 403 in FIG. 4, a method in which the newly published file F1 ′ and the deletion information D0 are concatenated and acquired as one file by the subject P2. When deleting the public file F0 ′, it is possible to use a method in which only Ku is extracted and stored.

  A second embodiment will be described.

  Example 2 shows a case where meta information is deleted after being disclosed. In the first embodiment, instead of publishing the file, the subject P1 places the file on some terminal and makes it accessible with a URL that is not easily guessed, and publishes the URL as meta information together with the file name. The meta information M0 disclosed by the subject P1 is, for example, “/SHASHIN/UMI/SHONAN.JPG→HTTP://10.1.1.2/a3f8s5h3s1o2u4”. In this case, the meta information M0 may be smaller in size than the file F0, and the digital signature S0 can be processed more efficiently by encrypting the meta information M0 itself with Kp. As in the first embodiment, file updating can be realized. However, the meta information is deleted and apparently deleted, that is, only the access becomes inaccessible, and the substance of the old file may remain.

  Another example of meta information is directory hierarchy information. For example, meta information “/ SHASHIN → / SHASHIN / UMI” represents a directory “UMI” under a directory “SHASIN”, and meta information “/SHASHIN/UMI→/SHASIN/UMI/SHONAN.JPG”. If a file “SHONAN.JPG” is present under “UMI”, a kind of file system can be realized together with the meta information M0. In this case, by deleting and updating meta information, not only file deletion and update but also directory deletion and update can be performed.

  A third embodiment will be described.

  As a third embodiment, a case where a version number (version management information), a link, and a comment (additional information) are added will be described.

  The version number is the same as the revision number used in the version management system CVS. That is, the first version number is “1.1”, and when this is changed, “1.2”, when this is further changed, “1.3”, and thereafter “1.4”, “1” .5 "and so on. Further, when branching from “1.2”, it can be distinguished as “1.2.1.1”. When this is changed, it becomes “1.2.1.2”. By adding such a version number, version management similar to CVS can be performed.

  As the link, the URL or the file name described in the second embodiment is used. When an attribute is given to a link, for example, it is separated by a delimiter “;”. When a reverse link from the link destination to the link source is designated, “reverse link; http: //abc.def.ghi/xxx/yyy.xml” is used.

  The comment is simply the reputation information specified by the user “This file contains a description of ~ and interesting”, or the merge information “MERGEFROM (/ aaa / bbb) that can also be referred to by the machine. .Xml; 1.4, /ccc/ddd.xml; 1.9) "may be extracted.

  Example 4 will be described.

  As a fourth embodiment, a case where the subject P1 publishes two files Fa and Fb will be described.

  First, P1 creates a key pair (Ku, Kp) common to Fa and Fb.

  Next, for both Fa and Fb, digital signatures Sa = EKp (H (Fa)) and Sb = EKp (H (Fb)) are created, and the file, the digital signature, and Ku are concatenated, and the public file Fa '= Fa + Sa + Ku, Fb' = Fb + Sb + Ku is created. P1 publishes Fa 'and Fb' on the P2P file sharing system.

  The subject P2 acquires Fa ′ and Fb ′ from the P2P file sharing system. P2 confirms the coincidence of Ku of Fa ′ and Fb ′, and verifies the digital signatures Sa and Sb with Ku. If Ku matches and the signature can be verified, it can be confirmed that Fa ′ and Fb ′ are created by the same subject. Even if the malicious subject Pm creates Fb ′, the signature verification fails if Ku matches, and Ku does not match even if the signature verification succeeds. It can be judged that it was created by a different subject. This is useful, for example, when the same subject publishes a digital photo file and a comment file related to the photo.

  According to the present invention, in a system that shares files in a distributed environment, particularly in an environment where there is no management entity, it is possible to implement file deletion and update in a manner in which only some entities are authorized. A distributed environment without a management entity is particularly effective in a network in which server installation is physically difficult, a network in which server installation is difficult in cost, or a network that is so large that the server cannot be operated. Further, the file does not necessarily match the file of the operating system, and can store any information.

[BRIEF DESCRIPTION OF THE DRAWINGS] It is a block diagram which shows the structure of the best form for implementing 1st invention of this invention. It is a flowchart which shows operation | movement of the best form for implementing 1st invention. It is a block diagram which shows the structure of the prior art of this invention. It is a figure which shows the structure method of the data in the best form for implementing 1st invention. It is a block diagram which shows the structure of the form for implementing 3rd invention. It is a flowchart which shows operation | movement of the form for implementing 3rd invention. It is a figure which shows the structure method of the data in the form for implementing 3rd invention.

Explanation of symbols

101 File Disclosure Unit 102 Deletion Determination Information Adding Unit 103 Deletion Information Registration Unit 104 Relationship Information Adding Unit 111 File Acquisition Unit 112 Delete Information Verification Unit 113 Relationship Information Verification Unit

Claims (18)

A public data subject identity determination system for determining identity of a subject of data disclosure,
Means for encrypting identity determination information for determining the identity of data to be disclosed and creating a digital signature with an encryption key by a public key cryptosystem;
Means for adding the digital signature and a decryption key for the encryption key or information for uniquely specifying the decryption key as related information to the public data;
The digital signature added to the public data and the digital signature added to the new public data to be newly published are verified by the decryption key of the relational information of the public data, and if the verification is successful, the public data and A public data subject identity determination system comprising: a determination unit that determines that the newly published data is published by the same subject.   The public data subject identity determination system according to claim 1, wherein the data is a file.   2. The public data subject identity determination system according to claim 1, wherein the data is a file reference.   2. The apparatus according to claim 1, further comprising means for verifying a match between a decryption key of the relational information of the public data and a decryption key of the relational information of the new public data, and verifying a digital signature when they match. Item 4. The subject identity determination system for public data according to any one of items 3 to 4. Means for generating deletion information by encrypting deletion identity determination information for determining the identity of the entity that deletes the public data and the entity that released the data, with the encryption key used for the digital signature of the public data;
The deletion information is verified by a decryption key of the relational information of the public data, and when the verification is successful, the determination unit determines that the public data has been deleted by the public data subject. 5. The subject identity determination system for public data according to any one of claims 1 to 4.   6. The public data subject identity determination system according to claim 1, wherein the identity determination information and the deletion identity determination information are hash values of public data.   6. The public data subject identity determination system according to claim 1, wherein the identity determination information and the deletion identity determination information are references to public data.   The public data subject identity determination system according to any one of claims 1 to 7, further comprising means for adding version management information indicating a relationship with the previous data to the public data.   The public data subject identity determination system according to any one of claims 1 to 8, further comprising means for adding additional information that is accompanying information of the previous data to the public data. An information processing apparatus program,
A process of creating a digital signature by encrypting identity determination information for determining the identity of data to be disclosed with an encryption key by a public key cryptosystem;
A process of adding the digital signature and a decryption key for the encryption key or information for uniquely identifying the decryption key as related information to the public data;
The digital signature added to the public data and the digital signature added to the new public data to be newly published are verified by the decryption key of the relational information of the public data, and if the verification is successful, the public data and A program for causing an information processing apparatus to execute processing for determining that the newly disclosed data is published by the same subject.   The program according to claim 10, wherein the data is a file.   The program according to claim 10, wherein the data is a file reference.   The information processing apparatus is configured to verify a match between a decryption key of the relational information of the public data and a decryption key of the relational information of the new public data, and to perform a process of verifying a digital signature when they match. The program according to any one of claims 10 to 12. A process of creating deletion information by encrypting the deletion identity determination information for determining the identity between the entity that deletes the public data and the entity that released the data, using the encryption key used for the digital signature of the public data;
The deletion information is verified with the decryption key of the relational information of the public data, and when the verification is successful, the information processing apparatus executes a process for determining that the public data has been deleted by the public data subject. The program according to any one of claims 10 to 13, wherein:   The program according to any one of claims 10 to 14, wherein the identity determination information and the deletion identity determination information are hash values of public data.   The program according to any one of claims 10 to 14, wherein the identity determination information and the deletion identity determination information are references to public data.   The program according to any one of claims 10 to 16, which causes the information processing apparatus to execute processing for adding version management information indicating a relationship with previous data to public data. The program according to any one of claims 10 to 17, which causes the information processing apparatus to execute a process of adding additional information that is accompanying information of previous data to public data.

Images