JP5589746B2 - Cooperation device, cooperation source device, cooperation destination device, cooperation program, and cooperation method - Google Patents

Description

  The present invention relates to a cooperation device that performs cooperation between devices, a cooperation source device, a cooperation destination device, a cooperation program, and a cooperation method.

  In the cloud and web services, in reality, the same person often uses different IDs for each service. Specifically, there is a demand to link personal attribute information in a situation where personal information is distributed with different IDs in a plurality of services. For example, a one-stop service of the government where the city hall obtains annual income from the tax office and provides support according to the annual income.

  In such a case, conventionally, a technique having personal ID association information in any service has been disclosed (see, for example, Patent Documents 1 and 2 below). For example, in the above example, a table in which an ID for an individual city hall is associated with an ID for a tax office is stored on the city hall side of the city hall and the tax office (Prior Art 1).

  In some cases, a third party linking organization may provide personal ID association information. For example, in the above example, a table in which an ID for an individual city hall is associated with an ID for a tax office is stored in a third-party linking organization other than the city hall and the tax office (Prior Art 2). .

  Furthermore, a technique is disclosed in which a personal ID is calculated for each service from a unified ID using a specific function so that it can be theoretically linked (for example, see Non-Patent Document 1 below). For example, in the Austrian national ID system, the field-specific ID is automatically calculated by an irreversible function from a common ID (Source PIN) based on the resident card code. When integrating the IDs for each field, the data protection committee calculates the IDs for each field from the common ID based on the resident card code. In this method, it is not necessary to have the association information as described above (Prior Art 3).

JP 2006-171923 A JP 2008-98786 A

Yusuke Koizumi, “Issues for Introduction of National ID: Learning from Overseas Cases”, February 28, 2009, NEC Research Institute (Internet search URL <http://www.jssm.net/jssm/security_day2009228.htm> (Search date: October 6, 2010)

  However, the above-described prior arts 1 and 2 have a problem that there is a risk that the association information leaks. Also, as the number of services increases, association information is required for each service combination. Therefore, there is a problem that the risk of leakage of association information increases. As described above, when the association information is leaked, there is a problem in that personal information associated with the ID of the association information is leaked, illegally used, or impersonated, which causes a disadvantage to the individual.

  Further, in the above-described prior art 3, when taking correspondence with individual IDs between services, a unified ID is searched manually (committee) from information such as an individual's name and address, and then in other services. There is a problem that it is necessary to calculate an individual ID, which is troublesome in operation. In addition, there is a problem that it is not possible to deal with when the field-specific ID has already been created for each institution.

  The present invention provides a linkage device, a linkage source device, a linkage destination device, a linkage program, and a linkage method that can improve the safety of linkage search in order to solve the above-described problems caused by the related art. Objective.

  In order to solve the above-described problems and achieve the object, first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and second identification information in the cooperation destination device. Storage means for associating and storing the second unique information obtained by giving the second one-way function to the first identification information and the cooperative identification information common to the first identification information and the second identification information, The first unique information is received from the cooperation source device, and the second unique information associated with the received first unique information via the cooperation identification information is retrieved from the storage unit and searched. As an example, a cooperation apparatus, a cooperation program, and a cooperation method for transmitting the second unique information thus performed to the cooperation source apparatus are proposed.

  Also, the first unique information obtained by encrypting the first identification information with the first common key in the cooperation source device, and the second unique information obtained by encrypting the second identification information with the second common key in the cooperation destination device. Storage means for associating and storing the common identification information to the first identification information and the second identification information, receiving the first unique information from the cooperation source device, The cooperation device that searches for the second unique information associated with the received first unique information via the cooperation identification information, and transmits the searched second unique information to the cooperation source device A cooperation program and a cooperation method are proposed as an example.

  Further, the first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and the second identification information obtained by giving the second identification information to the second one-way function in the cooperation destination device. The first identification information and the first identification information and the second identification information associated with the first identification information and the second identification information that are stored in association with each other and the cooperation destination device, and the first device is accessible. The first unique information is generated by designating identification information and giving the designated first identification information to the first one-way function, and the second unique information including the generated first unique information An information acquisition request is transmitted to the cooperation device, and as a result of the second unique information acquisition request being transmitted to the cooperation device, the second unique information retrieved by the cooperation device is received from the cooperation device, The received attribute acquisition request including the received second specific information As a result of transmitting the attribute acquisition request to the cooperation destination device as a result of transmission to the mobile device, it is specified from a reverse lookup table that associates the second unique information in the cooperation destination device with the second identification information. As an example, a cooperation source device, a cooperation program, and a cooperation method that receive attribute information associated with the second identification information from the cooperation destination device are proposed.

  Also, the first unique information obtained by encrypting the first identification information with the first common key in the cooperation source device, and the second unique information obtained by encrypting the second identification information with the second common key in the cooperation destination device. The first identification information and the second identification information are associated with the common identification information and stored, and the cooperation destination device is accessible, and the first identification information is designated, The first unique information is generated by encrypting the designated first identification information with the first common key, and an acquisition request for the second unique information including the generated first unique information is issued. As a result of transmitting the second unique information acquisition request to the cooperation device, the second unique information retrieved by the cooperation device is received from the cooperation device, and the received second second information is transmitted to the cooperation device. An attribute acquisition request including unique information is transmitted to the cooperation destination device. As a result of the attribute acquisition request being transmitted to the cooperation destination device, the attribute information associated with the second identification information obtained by decrypting the second unique information with the second common key in the cooperation destination device As an example, a cooperation source device, a cooperation program, and a cooperation method received from a cooperation destination device are proposed.

  Further, the first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and the second identification information obtained by giving the second identification information to the second one-way function in the cooperation destination device. The second identification information, the first identification information and the second identification information that are associated with the common identification information and stored in association with each other, and the second collaboration information, and the second source information is accessible. Storage means for storing an attribute table in which identification information and attribute information are associated is received, and the cooperation source device receives an attribute acquisition request including the second specific information obtained from the cooperation device from the cooperation source device, and receives the attribute acquisition request. The second unique information included in the attribute acquisition request is converted into the second identification information, and the attribute information associated with the converted second identification information is obtained by referring to the attribute table. Search for the attribute information searched Serial cooperation cooperation destination device to send to the source device, linkage program, and cooperation method is proposed as an example.

  First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. The second identification information is accessible to the cooperation device that stores the second unique information, the first identification information, and the cooperation identification information common to the second identification information in association with each other, and the cooperation source device, and the second identification information And storage means for storing an attribute table in which attribute information is associated with the encrypted information, and encrypted connection information obtained by encrypting connection information obtained by connecting date information related to the cooperation identification information to the second unique information with a public key related to the cooperation destination device The attribute acquisition request including the encrypted connection information is received from the cooperation source device that has received the information from the cooperation device, and the encrypted connection information included in the received attribute acquisition request is transmitted to the cooperation destination device. Decrypt with key Based on the date information included in the decoded connection information, the validity of the second specific information included in the connection information is determined, and the decoding means decodes the validity based on the determination result. The attribute information associated with the second identification information converted by the conversion means by converting the second unique information included in the connection information into the second identification information and referring to the attribute table As an example, a cooperation destination device, a cooperation program, and a cooperation method that search for the attribute information and transmit the searched attribute information to the cooperation source device are proposed.

  First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus; second unique information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus; Access is possible to the cooperation device that associates and stores the common identification information with the first identification information and the second identification information, and the cooperation source device, and associates the second identification information with the attribute information. Storage unit for storing the attribute table, the cooperation source device receives an attribute acquisition request including the second unique information obtained from the cooperation device from the cooperation source device, and is included in the received attribute acquisition request. The second unique information is decrypted with the second common key to generate the second identification information, and the attribute table is referenced to associate the second unique information with the generated second identification information. The attribute information is searched and searched. The attribute information of the cooperation destination device to send to the cooperation source device, linkage program, and cooperation method is proposed as an example.

  According to the cooperation device, the cooperation source device, the cooperation destination device, the cooperation program, and the cooperation method of the present invention, it is possible to improve the safety of the cooperation search.

1 is an explanatory diagram illustrating a system configuration example of a linkage system according to a first exemplary embodiment; FIG. 6 is an explanatory diagram of an example of creating a linkage table according to the first embodiment. FIG. 6 is an explanatory diagram of an example of updating a cooperation table according to the first embodiment. FIG. 3 is an explanatory diagram of an example of cooperative search according to the first embodiment. It is explanatory drawing which shows the cooperation search example 2 concerning Embodiment 1. FIG. It is a block diagram which shows the hardware structural example of the computer concerning embodiment. It is a block diagram which shows the functional structural example of a cooperation apparatus. It is a block diagram which shows the functional structural example of a cooperation origin apparatus. It is a block diagram which shows the functional structural example of a cooperation destination apparatus. It is a flowchart which shows the registration request processing procedure of a cooperation table. It is a flowchart which shows the registration process procedure of a cooperation table. It is a flowchart which shows the update request | requirement process procedure of a cooperation table. It is a flowchart which shows the update process procedure of a cooperation table. It is a sequence diagram which shows a cooperation search process sequence. It is a sequence diagram which shows a cooperation search process sequence. FIG. 6 is an explanatory diagram illustrating a system configuration example of a cooperation system according to a second embodiment; It is explanatory drawing which shows the creation example of the cooperation table concerning Embodiment 2. FIG. FIG. 10 is an explanatory diagram of an example of updating a cooperation table according to the second embodiment. FIG. 10 is an explanatory diagram of a cooperative search example according to the second embodiment. It is a flowchart which shows the registration request processing procedure of a cooperation table. It is a flowchart which shows the registration process procedure of a cooperation table. It is a flowchart which shows the update request | requirement process procedure of a cooperation table. It is a flowchart which shows the update process procedure of a cooperation table. It is a sequence diagram which shows a cooperation search process sequence.

  Exemplary embodiments of a cooperation source device, a cooperation destination device, a cooperation program, and a cooperation method according to the present invention will be described below in detail with reference to the accompanying drawings. Although various tables are used in the present embodiment, the tables are only examples, and databases having other structures may be used.

  In the present embodiment, when attribute information of the same individual is stored with different real IDs, a third party links attribute information without any organization having the association information of the real ID. Enable. Since no organization has real ID association information, no real ID leakage occurs, and security is improved.

  In addition, when a service is provided by one institution that owns one real ID, one institution obtains attribute information associated with the other real ID from the other institution that owns the other real ID. Even if the real ID is not known, it can be obtained from the other institution. For example, if one institution is a city hall and the other institution is a tax office, when the city office obtains annual income from a tax office and provides assistance according to the annual income for an individual, It is possible to obtain the individual's annual income from the tax office without knowing the actual ID.

(Embodiment 1)
First, the first embodiment will be described. The first embodiment is an example in which unique information is generated by giving a different real ID for each individual institution to a unique one-way function in each institution. Here, the one-way function is a function in which it is impossible (or difficult) to return the output data to the input data, and the same output data can be obtained if the same input data is given. An example of the one-way function is a hash function. As the hash function, for example, a general hash function such as SHA-1 or SHA-256 can be applied.

  Then, a third party organization different from the organization holding each real ID will hold the unique information of each real ID in association with both real IDs using a common linkage ID. In this specification, such a third-party organization is referred to as a “cooperation organization”. Note that the IDs, hash values, and encrypted data in this specification are merely examples, and for the sake of easy understanding, only simple character strings are employed for convenience.

<System configuration example>
FIG. 1 is an explanatory diagram of a system configuration example of the cooperation system according to the first embodiment. The linkage system is configured such that the computer of the organization A, the computer of the organization B, and the computer of the linkage organization C are communicably connected via a network such as the Internet, a LAN (Local Area Network), and a WAN (Wide Area Network). Has been.

  Hereinafter, the computer of the cooperation organization C is referred to as a “cooperation device”. In addition, both of the institutions A and B can be a cooperation source or a cooperation destination, but here, as an example, one of the institutions is a cooperation source and the other engine is a cooperation destination. Therefore, the cooperation source computer is referred to as a “cooperation source device”, and the cooperation destination computer is referred to as a “cooperation destination device”. In the case of FIG. 1, the computer of the institution A is referred to as “cooperation source device”, and the computer of the institution B is referred to as “cooperation destination device”.

  Here, for a certain user, the real ID is assigned to the institution A and the institution B, respectively. Both real IDs are different identification information. In FIG. 1, the real ID of the institution A is “first real ID (denoted as ID_A in FIG. 1)”, and the real ID of the institution B is “second real ID (denoted as ID_B in FIG. 1)”. The first real ID is a real ID used only in the engine A, and the second real ID is a real ID used only in the engine B.

  The cooperation source device 101 includes an attribute table TaA, a hash function hA (), and a cooperation function FA. The attribute table TaA is a table that stores various attribute information for each real ID. For example, assuming that the institution A is a city hall, the real ID (ID_A) of the individual living in the city and the attribute information such as the last name, first name, address, and permanent address of the individual are registered in the attribute table. The hash function hA () is a one-way function unique to the cooperation source device 101. The attribute table TaA and the hash function hA () are stored in a storage area in the cooperation source apparatus 101.

  The cooperation function FA is a function for executing a cooperation table registration request in the cooperation apparatus, a hash value acquisition request of the cooperation destination apparatus 102, and an attribute information acquisition request from the cooperation destination apparatus 102. The cooperation function FA is realized by causing the CPU of the cooperation source apparatus 101 to execute a cooperation program stored in a storage area in the cooperation source apparatus 101.

  The cooperation destination device 102 includes an attribute table TaB, a hash function hB (), and a cooperation function FB. The attribute table TaB is a table that stores various attribute information for each real ID. For example, if the institution B is a tax office, the real ID (ID_B) of the person living in the city, and attribute information such as the person's office and annual income are registered in the attribute table TaB. The hash function hB () is a one-way function unique to the cooperation destination apparatus 102. The attribute table TaB and the hash function hB () are stored in a storage area in the cooperation destination device 102. The hash functions hA () and hB () are functions having different output data even when the same input data is given.

  The cooperation function FB is a function that executes a process of returning a result in response to a cooperation table registration request in the cooperation apparatus 103 and an attribute information acquisition request from the cooperation source apparatus 101. The cooperation function FB is realized by causing the CPU of the cooperation destination apparatus 102 to execute the cooperation program stored in the storage area in the cooperation destination apparatus 102.

  The cooperation apparatus 103 has a cooperation table Tc and a cooperation function FC. The linkage table Tc is set for each engine. For example, the first linkage table TcA is a linkage table for the organization A, and the second linkage table TcB is a linkage table for the organization B. The cooperation function FC issues a cooperation ID for each user. The linkage ID is identification information that associates the hash value of the first real ID of the institution A with the hash value of the second real ID of the institution B for the same user. That is, the cooperation ID and the first real ID are associated with the first cooperation table TcA. In addition, the cooperation ID and the second actual ID are associated with the second cooperation table TcB.

  When the cooperation function FC receives a registration request for the cooperation table Tc, the cooperation function FC creates the cooperation table Tc. For example, when a registration request for the first linkage table TcA is received from the institution A, the first linkage table TcA is created. When receiving a registration request for the second linkage table TcB from the institution B, the second linkage table TcB is created. When the cooperation function receives a cooperation request to the cooperation destination apparatus 102, that is, a hash value acquisition request of the cooperation destination apparatus 102 from the cooperation source apparatus 101, the cooperation function returns the hash value of the cooperation destination apparatus 102 to the cooperation source apparatus 101. . The cooperation function FC is realized by causing the CPU of the cooperation apparatus 103 to execute a cooperation program stored in a storage area in the cooperation apparatus 103.

<Example of creating a linkage table>
FIG. 2 is an explanatory diagram of an example of creating a cooperation table according to the first embodiment. Here, a certain user (user name: A) will be described. In addition, as a premise for creating the linkage table, it is assumed that attribute information related to the former is registered in the attribute table in each of the institution A (for example, the city hall) and the institution B (for example, the tax office). Accordingly, it is assumed that the first real ID “aaa” of the institution A and the second real ID “bbb” of the institution B are assigned to the former A.

(1) First, the cooperation apparatus 103 notifies the former to the cooperation ID. The cooperation device 103 holds the issued cooperation ID until the first cooperation table TcA and the second cooperation table TcB for the former are created. Further, the issued cooperation ID may be acquired by visiting the cooperation organization C, or the cooperation organization C may mail it to the cooperation organization C. Further, the cooperation device 103 may transmit a cooperation ID to a computer owned by the former. In this example, the linkage ID is “12345678”.

(2) Next, Party A makes a setting request to Engine A and Engine B. Specifically, Party A provides the cooperation ID obtained from the cooperation agency C to the agency A. Similarly, Party A provides the cooperation ID obtained from the cooperation engine C to the engine B. The providing method may be presented by A to each of the institutions A and B, or may be mailed. Further, the cooperation ID may be transmitted to the cooperation source apparatus 101 and the cooperation destination apparatus 102 by a computer owned by the former.

  The cooperation item is an item to be linked to another organization among the attribute items in the attribute table. Since the cooperation source apparatus 101 is a computer that acquires attribute information from the cooperation destination apparatus 102, the cooperation item for the cooperation source apparatus 101 is “none”. On the other hand, since the cooperation destination device 102 is a computer that provides attribute information to the cooperation source device 101, a cooperation item is selected for the cooperation destination device 102. 2, for example, it is assumed that the attribute item “annual income” is selected as the cooperation item among the attribute items “annual income”, “workplace”,... In the attribute table TaB of the cooperation destination device 102. In addition, the selection method of a cooperation item may go to the institution B, and may present and mail it. Further, the cooperation ID may be transmitted to the cooperation destination apparatus 102 by a computer owned by the former.

  Then, a flag is set (F = 1) in the attribute item set in the cooperation item. In this example, since the flag is set for the annual income item for the record in step A, when there is an acquisition request from the cooperation source apparatus 101, the attribute information of the annual income item in the attribute item group, that is, the annual income “123 (10,000 yen) "Is provided to the cooperation source apparatus 101. On the other hand, since the flag is not set in the work place item (F = 0), the work place is not provided.

(3) After that, in the cooperation source device 101 and the cooperation destination device 102, when a combination of the real ID and the cooperation ID is received, a hash value is calculated. Specifically, in the cooperation source device 101, the hash value “98c% df” is obtained by giving the first real ID “aaa” to the hash function hA (). Similarly, in the cooperation destination apparatus 102, the hash value “As8 & +)” is obtained by giving the second real ID “bbb” to the hash function hB ().

(4) Further, since the cooperation item is selected, the cooperation destination apparatus 102 creates the reverse lookup table Tr. The reverse lookup table Tr is a table in which a hash value is associated with a real ID that is a source of the hash value. In the case of FIG. 2, the hash value “As8 & +)” and the real ID “bbb” that is the calculation source of the hash value “As8 & +)” are associated with each other to form the reverse lookup table Tr.

(5) When the hash value is calculated, the cooperation source device 101 and the cooperation destination device 102 transmit a cooperation table registration request to the cooperation device 103. The registration request of the collaboration source apparatus 101 includes the hash value “98c% df” of the first real ID “aaa” of the collaboration source apparatus 101 and the collaboration ID “12345678”. Further, the registration request of the cooperation destination device 102 includes the hash value “As8 & +)” of the second real ID “bbb” of the cooperation destination device 102 and the cooperation ID “12345678”.

(6) Upon receiving the cooperation table registration request, the cooperation device 103 creates the cooperation table Tc. For example, when there is a registration request from the cooperation source apparatus 101, the cooperation apparatus 103 creates a first cooperation table TcA in which the hash value “98c% df” and the cooperation ID “12345678” are associated with each other. In addition, the cooperation apparatus 103 creates a second cooperation table TcB in which the hash value “As8 & +)” is associated with the cooperation ID “12345678”. This completes the creation process.

<Update example of linkage table>
FIG. 3 is an explanatory diagram of an example of updating the cooperation table according to the first embodiment. In FIG. 3, an example of updating the second linkage table TcB is described as an example, but the first linkage table TcA is updated in the same manner.

(1) First, Party A requests the organization B to update the real ID. Specifically, Party A requests engine B to update the real ID “bbb”. As a request method, A may visit the institution B to make a request, or a computer owned by A may transmit an update request for the real ID to the cooperation destination apparatus 102. When there is an update request, the cooperation destination apparatus 102 issues a new second real ID. Here, the new second real ID is “ccc”.

(2) Next, the cooperation destination apparatus 102 gives a new second real ID to the hash function to generate a new hash value. Specifically, the cooperation destination apparatus 102 gives a new second real ID “ccc” to the hash function hB (), and calculates a new hash value “qwerty”.

(3) When the hash value is newly calculated, the cooperation destination apparatus 102 transmits an update request for the cooperation table to the cooperation apparatus 103. The update request for the cooperation table includes the new and old hash values “As8 & +)” and “qwerty” of the cooperation destination apparatus 102.

(4) The cooperation destination apparatus 102 updates the reverse lookup table Tr when making an update request. Specifically, the cooperation destination apparatus 102 rewrites the hash value of the hash value item of the reverse lookup table Tr from the old hash value “As8 & +)” to the new hash value “qwerty”. Further, the cooperation destination apparatus 102 rewrites the second real ID of the real ID item in the reverse lookup table Tr from the old second real ID “bbb” to the new second real ID “ccc”. In the case of updating the cooperation destination device 102, since the cooperation destination device 102 does not have the reverse lookup table Tr, (4) is not executed.

  When the cooperation destination device 102 is always used only as a cooperation destination, the hash value item of the reverse lookup table Tr is not changed as the old hash value “As8 & +)”, and the second real ID is “ccc”. The update operation may be completed simply by replacing with. This is because the information of the collaborative organization 103 is not updated, and there is a search request from another organization only with the old hash value “As8 & +”.

(5) Further, the cooperation destination apparatus 102 rewrites the second real ID of the ID item of the attribute table from the old second real ID “bbb” to the new second real ID “ccc”.

(6) On the other hand, when the cooperation device 103 receives the update request in (3), it updates the second cooperation table TcB. Specifically, the cooperation apparatus 103 uses the old hash value “As8 & +)” among the new and old hash values “As8 & +)” and “qwerty” included in the cooperation table update request as a clue, The second linkage table TcB is searched from the linkage table Tc.

(7) Then, the cooperation apparatus 103 rewrites the hash value of the hash value item of the second cooperation table TcB from the old hash value “As8 & +)” to the new hash value “qwerty”. Thereby, the update process is completed.

<Linked search example 1>
FIG. 4 is an explanatory diagram of an example of cooperative search according to the first embodiment. FIG. 4 shows an example in which the city hall (institution A: cooperation source apparatus 101) acquires the former attribute information: annual income from the tax office (institution B: cooperation destination apparatus 102).

(1) First, the cooperation source apparatus 101 designates the first real ID “aaa” of the former A, gives it to the hash function hA (), and obtains the hash value “98c% df”.

(2) Next, the cooperation source apparatus 101 transmits a hash value acquisition request of the cooperation destination apparatus 102 to the cooperation apparatus 103. The acquisition request includes the hash value “98c% df” obtained in (1).

(3) Upon receiving the acquisition request in (2), the cooperation device 103 searches the cooperation table Tc for the first cooperation table TcA including the hash value “98c% df”. Next, the cooperation apparatus 103 specifies the cooperation ID “12345678” associated with the hash value “98c% df” of the searched first cooperation table TcA.

(4) The linkage apparatus 103 searches the linkage table Tc for the second linkage table TcB having the identified linkage ID “12345678”. Next, the collaboration apparatus 103 retrieves the hash value “As8 & +)” associated with the collaboration ID “12345678” of the retrieved second collaboration table TcB.

(5) Thereafter, the cooperation device 103 transmits the hash value “As8 & +) searched in (4) to the cooperation source device 101.

(6) Upon receiving the hash value “As8 & +” in (5), the cooperation source apparatus 101 transmits an attribute request to the cooperation destination apparatus 102. The attribute request includes the hash value “As8 & +) received in (5).

(7) The cooperation destination apparatus 102 extracts the hash value “As8 & +)” from the attribute request received in (6), and the real ID “bbb” corresponding to the extracted hash value “As8 & +)” from the reverse lookup table Tr. Is identified. Then, the cooperation destination apparatus 102 identifies the record of the second real ID “bbb” in the attribute table TaB, and extracts the attribute information of the attribute item whose flag is set to F = 1. Here, the annual income item 123 (10,000 yen) is extracted.

(8) After that, the cooperation destination apparatus 102 transmits the attribute information (annual income 1.32 million yen) extracted in (7) to the cooperation source apparatus 101. In addition, when the cooperation destination apparatus 102 and the computer owned by A are communicably connected, the presence / absence of provision of attribute information may be confirmed prior to transmission of the attribute information.

(9) Finally, since the cooperation source apparatus 101 has acquired the annual income of the former from the cooperation destination apparatus 102, the service corresponding to the annual income is provided to the former. As described above, even if there is no table that associates the first real ID “aaa” of the back of the engine A with the second real ID “bbb” of the back of the engine B, the engine A and the engine B are linked. be able to. That is, the correspondence relationship between the first real ID “aaa” of the back of Engine A and the second real ID “bbb” of the back of Engine B will not leak. Further, even if the cooperation table Tc leaks, it is only a combination of the cooperation ID and the hash value, so that the actual ID is not specified even if it leaks.

<Linked search example 2>
FIG. 5 is an explanatory diagram of a cooperative search example 2 according to the first embodiment. FIG. 5 also shows an example in which the city hall (institution A: cooperation source apparatus 101) acquires the former attribute information: annual income from the tax office (institution B: cooperation destination apparatus 102).

(1) First, the cooperation source apparatus 101 designates the first real ID “aaa” of the former A, gives it to the hash function hA (), and obtains the hash value “98c% df”.

(2) Next, the cooperation source apparatus 101 transmits a hash value acquisition request of the cooperation destination apparatus 102 to the cooperation apparatus 103. The acquisition request includes the hash value “98c% df” obtained in (1).

(3) Upon receiving the acquisition request in (2), the cooperation device 103 searches the cooperation table Tc for the first cooperation table TcA including the hash value “98c% df”. Next, the cooperation apparatus 103 specifies the cooperation ID “12345678” associated with the hash value “98c% df” of the searched first cooperation table TcA.

(4) The linkage apparatus 103 searches the linkage table Tc for the second linkage table TcB having the identified linkage ID “12345678”. Next, the collaboration apparatus 103 retrieves the hash value “As8 & +)” associated with the collaboration ID “12345678” of the retrieved second collaboration table TcB.

(5) Here, the cooperation apparatus 103 concatenates date information, for example, “20101004” to the hash value “As8 & +)” searched in (4), and generates concatenation information “As8 & +) 20101004”. Then, the cooperation apparatus 103 encrypts the link information “As8 & +) 20101004” with the public key of the cooperation destination apparatus 102 that has been passed from the cooperation destination apparatus 102 in advance. The process (5) may be performed in advance when creating the second linkage table TcB. In this case, in (4), the encrypted concatenation information is searched, and the following (6) is executed.

(6) After that, the cooperation device 103 transmits the encrypted connection information generated in (5) to the cooperation source device 101.

(7) When the cooperation source apparatus 101 receives (6) the received encrypted connection information, the cooperation source apparatus 101 transmits an attribute request to the cooperation destination apparatus 102. The attribute request includes the encrypted concatenation information received in (6).

(8) The cooperation destination apparatus 102 decrypts the encrypted connection information from the attribute request received in (7) with a secret key corresponding to the public key passed to the cooperation apparatus 103. Then, the cooperation destination apparatus 102 extracts the date information “20101004” from the decrypted connection information “As8 & +) 20101004”, and determines the validity of the hash value “As8 & +)” included in the connection information “As8 & +) 20101004”. to decide. If it is invalid, the cooperative search is terminated.

(9) When the hash value “As8 & +)” is valid, the cooperation destination apparatus 102 specifies the second real ID “bbb” corresponding to the hash value “As8 & +)” from the reverse lookup table Tr. Then, the cooperation destination apparatus 102 identifies the record of the second real ID “bbb” in the attribute table TaB, and extracts the attribute information of the attribute item whose flag is set to F = 1. Here, the annual income item 123 (10,000 yen) is extracted.

(10) After that, the cooperation destination apparatus 102 transmits the attribute information (annual income 1.32 million yen) extracted in (9) to the cooperation source apparatus 101. In addition, when the cooperation destination apparatus 102 and the computer owned by A are communicably connected, the presence / absence of provision of attribute information may be confirmed prior to transmission of the attribute information.

(11) Finally, since the cooperation source apparatus 101 has obtained the annual income of the former from the cooperation destination apparatus 102, the service corresponding to the annual income is provided to the former. As described above, even if there is no table that associates the first real ID “aaa” of the back of the engine A with the second real ID “bbb” of the back of the engine B, the engine A and the engine B are linked. be able to. That is, the correspondence relationship between the first real ID “aaa” of the back of Engine A and the second real ID “bbb” of the back of Engine B will not leak.

  Further, even if the cooperation table Tc leaks, it is only a combination of the cooperation ID and the hash value, so that the actual ID is not specified even if it leaks. Further, since the institution A does not know the actual hash value of the second real ID, the security can be further improved. In addition, since provision of old attribute information can be avoided, the quality of service can be improved.

<Hardware configuration of computer>
FIG. 6 is a block diagram of a hardware configuration example of the computer according to the embodiment. In FIG. 6, the computer includes a CPU (Central Processing Unit) 601, a ROM (Read Only Memory) 602, a RAM (Random Access Memory) 603, a magnetic disk drive 604, a magnetic disk 605, an optical disk drive 606, An optical disk 607, a display 608, an I / F (Interface) 609, a keyboard 610, a mouse 611, a scanner 612, and a printer 613 are provided. Each component is connected by a bus 600.

  Here, the CPU 601 governs overall control of the computer. The ROM 602 stores programs such as a boot program. The RAM 603 is used as a work area for the CPU 601. The magnetic disk drive 604 controls the reading / writing of the data with respect to the magnetic disk 605 according to control of CPU601. The magnetic disk 605 stores data written under the control of the magnetic disk drive 604.

  The optical disk drive 606 controls the reading / writing of the data with respect to the optical disk 607 according to control of CPU601. The optical disk 607 stores data written under the control of the optical disk drive 606, and causes the computer to read data stored on the optical disk 607.

  A display 608 displays data such as a document, an image, and function information as well as a cursor, an icon, or a tool box. As the display 608, for example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted.

  An interface (hereinafter abbreviated as “I / F”) 609 is connected to a network 614 such as a LAN (Local Area Network), a WAN (Wide Area Network), and the Internet through a communication line, and the other via the network 614. Connected to other devices. The I / F 609 manages an internal interface with the network 614 and controls data input / output from an external device. For example, a modem or a LAN adapter can be employed as the I / F 609.

  The keyboard 610 includes keys for inputting characters, numbers, various instructions, and the like, and inputs data. Moreover, a touch panel type input pad or a numeric keypad may be used. The mouse 611 performs cursor movement, range selection, window movement, size change, and the like. A trackball or a joystick may be used as long as they have the same function as a pointing device.

  The scanner 612 optically reads an image and takes in the image data into the computer. Note that the scanner 612 may have an OCR (Optical Character Reader) function. The printer 613 prints image data and document data. As the printer 613, for example, a laser printer or an ink jet printer can be employed.

<Functional Configuration of Cooperation Device 103>
FIG. 7 is a block diagram illustrating a functional configuration example of the cooperation apparatus 103. FIG. 7 shows a specific example of the cooperation function FC shown in FIG. The cooperation apparatus 103 includes a storage unit 700, a reception unit 701, a creation unit 702, a search unit 703, a generation unit 704, and a transmission unit 705. The storage unit 700 realizes its functions by a storage device such as the RAM 603 and the magnetic disk 605 shown in FIG. The receiving unit 701 to the transmitting unit 705 realize their functions by causing the CPU 601 to execute a cooperation program stored in a storage device such as the ROM 602, the RAM 603, and the magnetic disk 605 illustrated in FIG. 6 or by the I / F 609. To do.

  The storage unit 700 uses the first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device 101 and the second identification information in the second device unidirectionally in the cooperation destination device 102. The second unique information obtained by giving to the function and the cooperative identification information common to the first identification information and the second identification information are stored in association with each other.

  Here, the first identification information is specifically an actual ID registered in an actual ID item of the attribute table in the cooperation source apparatus 101, for example. For example, the first real ID “aaa” of the former A. Specifically, the first one-way function is, for example, a hash function hA () used in the cooperation source apparatus 101. Specifically, the first unique information is, for example, a hash value “98c% df” calculated by giving the first real ID “aaa” to the hash function hA ().

  The second identification information is specifically an actual ID registered in the actual ID item of the attribute table in the cooperation destination apparatus 102, for example. For example, the second real ID “bbb” of the former. Specifically, the second one-way function is, for example, a hash function hB () used in the cooperation destination apparatus 102. Specifically, the second unique information is, for example, a hash value “As8 & +)” calculated by giving the second real ID “bbb” to the hash function hB ().

  For example, the common identification information common to the first identification information and the second identification information is, for example, the first real ID “aaa” of the first in the engine A and the second real ID of the first in the engine B. The common ID “12345678” is shared with “bbb”.

  In the storage unit 700, the first identification information, the second identification information, and the cooperation identification information are stored in association with each other. Specifically, for example, the first linkage tables TcA and TcB shown in FIGS. 1 to 4 are stored. 1 to 4 exemplify two first linkage tables TcA and TcB, the first linkage table TcA and the second linkage table TcB may be one linkage table.

  The receiving unit 701 receives a first registration request including the first unique information and the cooperation identification information from the cooperation source apparatus 101. Specifically, for example, the receiving unit 701 receives the first registration request including the hash value “98c% df” of the first real ID “aaa” and the linkage ID “12345678”.

  The receiving unit 701 receives a second registration request including the second unique information and the cooperation identification information from the cooperation destination apparatus 102. Specifically, for example, the receiving unit 701 receives the second registration request including the hash value “As8 & +)” of the second real ID “bbb” and the linkage ID “12345678”.

  In addition, after registration of the first cooperation tables TcA and TcB, the reception unit 701 receives the first unique information from the cooperation source apparatus 101. Specifically, for example, the receiving unit 701 receives an acquisition request for the second unique information (the hash value “As8 & +) of the second real ID“ bbb ”)” from the cooperation source device 101. The acquisition request for the second unique information includes the first unique information (the hash value “98c% df” of the first real ID “aaa”).

  The receiving unit 701 receives an update request from the cooperation source device 101 or the cooperation destination device 102. Specifically, for example, the update request from the cooperation source apparatus 101 includes the new and old hash values of the first real ID “aaa”. The update request from the cooperation destination device 102 includes the new and old hash values of the second real ID “bbb”.

  When the first registration request and the second registration request are received, the creation unit 702 creates a table in which the first unique information, the second unique information, and the cooperation identification information are associated, and registers them in the storage unit 700. Specifically, for example, when the first registration request is received, the creation unit 702 creates the first linkage table TcA and registers it in the storage unit 700. In addition, when the second registration request is received, the creation unit 702 creates the second linkage table TcB and registers it in the storage unit 700.

  In addition, when an update request is received, the creation unit 702 identifies a linkage table to be updated using a previous hash value included in the update request as a clue. Then, the creation unit 702 rewrites the old hash value registered in the specified linkage table with the new hash value included in the update request.

  Specifically, for example, when the old hash value “As8 & +)” and the new hash value “qwerty” are included in the update request, the creating unit 702 uses the old hash value “As8 & +)” as a clue to obtain the old hash value. The second linkage table TcB including “As8 & +)” is specified. Then, the creation unit 702 rewrites the hash value of the hash value item of the second linkage table TcB from the old hash value “As8 & +)” to the new hash value “qwerty”.

  The search unit 703 searches the storage unit 700 for the second unique information associated with the first unique information received by the receiving unit 701 via the cooperation identification information. Specifically, for example, when the search unit 703 receives an acquisition request for the second unique information from the cooperation source apparatus 101, the search unit 703 includes the first unique information (first real ID “ The first linkage table TcA including the hash value “98c% df” is specified from the linkage table Tc using the hash value “98c% df” of “aaa” as a clue.

  Then, the search unit 703 searches the first linkage table TcA for the linkage ID “12345678” associated with the hash value “98c% df”. Next, the search unit 703 specifies the second linkage table TcB including the linkage ID “12345678” from the linkage table Tc, using the identified linkage ID “12345678” as a clue. Then, the search unit 703 searches the second linkage table TcB for the hash value “As8 & +)” associated with the linkage ID “12345678”.

  The generation unit 704 generates concatenation information obtained by concatenating the date information related to the cooperation ID with the second unique information searched by the search unit 703, and encrypts the concatenation information with the public key related to the cooperation destination device 102. Generate concatenation information. Here, the date information is a time stamp. The information described by the time stamp is the date (including time) when a certain event occurs. Examples of the event include the issue date of the linkage ID, the creation date of the linkage table Tc, the update date of the hash value in the linkage table Tc, the last access date to the linkage table Tc, and the like. It is assumed that the time stamps of these events are stored in the storage unit 700 by the linkage apparatus 103 each time.

  In addition, it is assumed that the public key of the cooperation destination apparatus 102 is stored in the storage unit 700 in advance. When the search unit 703 searches for the second unique information, the generation unit 704 links the date information of the cooperation ID associated with the second unique information in the cooperation table to the second unique information. Specifically, for example, date information “20101004” is concatenated to the end of the hash value “As8 & +), which is the second unique information, to obtain concatenated information“ As8 & +) 20101004 ”. Then, the generation unit 704 encrypts the connection information with the public key of the cooperation destination apparatus 102 to generate encrypted connection information.

  The transmission unit 705 transmits the second unique information searched by the search unit 703 to the cooperation source device 101. Specifically, for example, when the search unit 703 searches for the hash value “As8 & +” that is the second unique information, the transmission unit 705 causes the cooperation source apparatus 101 that is the acquisition request source of the second unique information to The hash value “As8 & +)” is transmitted. In addition, when the encrypted connection information is generated by the generation unit 704, the transmission unit 705 transmits the encrypted connection information to the cooperation source apparatus 101 that is the acquisition request source of the second specific information.

<Functional Configuration of Cooperation Source Device 101>
FIG. 8 is a block diagram illustrating a functional configuration example of the cooperation source apparatus 101. FIG. 8 shows a specific example of the cooperation function FA shown in FIG. The cooperation source device 101 includes a storage unit 800, a specification unit 801, a reception unit 802, a generation unit 803, a first transmission unit 804, a first reception unit 805, a second transmission unit 806, A second receiving unit 807. The storage unit 800 realizes its functions by a storage device such as the RAM 603 and the magnetic disk 605 shown in FIG. The designation unit 801 to the second receiving unit 807 can cause the CPU 601 to execute a cooperation program stored in a storage device such as the ROM 602, the RAM 603, and the magnetic disk 605 illustrated in FIG. Realize the function.

  The memory | storage part 800 memorize | stores the cooperation table shown in FIGS.

  The designation unit 801 designates the first identification information. Specifically, for example, when the operator of the institution A operates and inputs the first identification information (real ID “aaa”) with the keyboard or mouse of the cooperation source apparatus 101, the designation unit 801 displays the value of the real ID item in the attribute table. Search for. When the first identification information (real ID “aaa”) is searched in the attribute table, the designation unit 801 assumes that the first identification information (real ID “aaa”) is designated.

  The accepting unit 802 accepts the cooperation identification information and the first identification information when the cooperation identification information and the first unique information are not associated in the cooperation device 103. Specifically, for example, the accepting unit 802 accepts the cooperation ID and the real ID “aaa” when making a first registration request for the cooperation table. For example, when the operator of the institution A operates and inputs the first identification information (real ID “aaa”) with the keyboard or mouse of the cooperation source apparatus 101, the receiving unit 802 searches for the value of the real ID item in the attribute table TaA. When the first identification information (real ID “aaa”) is searched in the attribute table TaA, the accepting unit 802 accepts the first identification information (real ID “aaa”).

  The generation unit 803 generates the first unique information by giving the first identification information designated by the designation unit 801 to the first one-way function. In addition, the generation unit 803 generates first unique information by giving the first identification information received by the reception unit 802 to the first one-way function. Specifically, for example, the generation unit 803 generates the hash value “98c% df” by giving the real ID “aaa” to the hash function hA ().

  The first transmission unit 804 transmits an acquisition request for second specific information including the first specific information generated by the generation unit 803 to the cooperation apparatus 103. Specifically, for example, when the generation source of the first unique information is the first identification information designated by the designation unit 801, an acquisition request for the second unique information including the first unique information is transmitted to the cooperation apparatus 103. To do. For example, the first transmission unit 804 transmits a request for acquiring the second unique information including the first unique information (the hash value “98c% df” of the real ID “aaa”).

  In addition, when the generation source of the first unique information is the first identification information received by the reception unit 802, the first transmission unit 804 cooperates with the cooperation identification information and the first registration request for the first unique information. To the device 103. For example, the first transmission unit 804 transmits the first registration request including the cooperation ID “12345678” and the first unique information (the hash value “98c% df” of the real ID “aaa”). Thereby, in the cooperation apparatus 103, the first cooperation table TcA is created.

  The first reception unit 805 receives, from the cooperation device 103, the second unique information searched by the cooperation device 103 as a result of the second transmission information 804 being transmitted to the cooperation device 103 by the first transmission unit 804. . When the acquisition request for the second unique information is transmitted from the first reception unit 805 to the cooperation device 103, as described above, the cooperation device 103 searches for the second unique information and obtains the cooperation source that is the acquisition request source. Send to device 101.

  The cooperation source device 101 receives the second unique information searched by the cooperation device 103 as a response to the acquisition request for the second unique information. Specifically, for example, the first transmission unit 804 transmits a request for acquiring the second unique information including the first unique information (the hash value “98c% df” of the real ID “aaa”) to the cooperation apparatus 103. In this case, the first receiving unit 805 receives the hash value “As8 & +)” (or encrypted concatenation information) that is the second unique information.

  The second transmission unit 806 transmits the attribute acquisition request including the second specific information received by the first reception unit 805 to the cooperation destination apparatus 102. Specifically, for example, the second transmission unit 806 transmits an attribute acquisition request including the hash value “As8 & +)” (or encrypted concatenation information) that is the second unique information to the cooperation destination apparatus 102.

  Here, when the organization A (cooperation source device 101) can cooperate only with the organization B (cooperation destination device 102), the second transmission unit 806 receives the second specific information from the cooperation device 103. The attribute acquisition request is transmitted unconditionally to the cooperation destination apparatus 102. On the other hand, in the case where there are a plurality of cooperation destinations such as not only the organization B but also the organizations C, D, E,..., The cooperation source device 101 determines in advance with which organization the cooperation service is provided. By specifying, it is set which organization's cooperation destination device 102 is the transmission destination of the attribute acquisition request.

  As a result of the attribute acquisition request being transmitted to the cooperation destination device 102 by the second transmission unit 806, the second reception unit 807 reversely associates the second unique information in the cooperation destination device 102 with the second identification information. The attribute information associated with the second identification information specified from the table Tr is received from the cooperation destination apparatus 102. The specification of the attribute information is as shown in FIG. The second reception unit 807 receives attribute information from the cooperation destination apparatus 102 as a response to the attribute acquisition request. In the example of FIG. 4, annual income is received as attribute information.

  The received attribute information is stored in the storage unit 800. Thereafter, the cooperation source device 101 provides a service by combining the attribute information in the attribute table of the cooperation source device 101 and the attribute information received from the cooperation destination device 102 to the user who requested the cooperation.

<Functional Configuration of Cooperation Target Device 102>
FIG. 9 is a block diagram illustrating a functional configuration example of the cooperation destination apparatus 102. FIG. 9 shows a specific example of the cooperation function FB shown in FIG. The link destination apparatus 102 includes a storage unit 900, a reception unit 901, a generation unit 902, a creation unit 903, a setting unit 904, a reception unit 905, a conversion unit 906, a decryption unit 907, and a determination unit 908. , A search unit 909 and a transmission unit 910. The storage unit 900 realizes its functions by a storage device such as the RAM 602 and the magnetic disk 605 shown in FIG. The reception unit 901 to the transmission unit 910 realize the function by causing the CPU 601 to execute a cooperation program stored in a storage device such as the ROM 602, the RAM 603, and the magnetic disk 605 illustrated in FIG. 6 or by the I / F 609. To do.

  The storage unit 900 stores an attribute table that associates the second identification information with the attribute information. Specifically, for example, the storage unit 900 stores the attribute table TaB shown in FIGS. In addition, the storage unit 900 stores a reverse lookup table Tr that associates the second unique information with the second identification information. Specifically, for example, the storage unit 900 stores the reverse lookup table Tr illustrated in FIGS.

  The accepting unit 901 accepts the cooperation identification information and the second identification information when the cooperation identification information and the second unique information are not associated in the cooperation device 103. Specifically, for example, the reception unit 901 receives the cooperation ID and the second actual ID “bbb” when making a second registration request for the cooperation table. For example, when the operator of the institution B inputs the second identification information (second real ID “bbb”) using the keyboard or mouse of the cooperation destination apparatus 102, the receiving unit 901 searches for the value of the real ID item in the attribute table TaB. To do. When the second identification information (second real ID “bbb”) is searched in the attribute table TaB, the reception unit 901 receives the second identification information (second real ID “bbb”).

  The generation unit 902 generates the second unique information by giving the second identification information received by the reception unit 901 to the second one-way function. Specifically, for example, the generation unit 902 generates the hash value “As8 & +)” by giving the second real ID “bbb” to the hash function hB ().

  The creation unit 903 creates the reverse lookup table Tr by associating the second unique information generated by the generation unit 902 with the second identification information. Specifically, for example, as illustrated in FIGS. 1 to 4, the creating unit 903 associates the hash value “As8 & +)” with the second real ID “bbb” that is the generation source, and the reverse lookup table Tr. Is stored in the storage unit 900.

  The setting unit 904 sets an attribute item when the second identification information is received by the receiving unit 901. Regarding the setting of the attribute item, for example, the operator of the institution B makes an inquiry to the former of the second real ID “bbb” and decides which attribute item is to be the linkage item. Then, the operator of the organization B sets the flag of the cooperation item selected from the attribute items of the attribute table TaB to F = 1 with the keyboard 610 and the mouse 611 of the cooperation destination apparatus 102.

  The receiving unit 905 receives an attribute acquisition request including the second unique information (or encrypted connection information) obtained from the cooperation device 103 by the cooperation source device 101 from the cooperation source device 101. Specifically, for example, the reception unit 905 receives an attribute acquisition request including the hash value “As8 & +)” (or its encrypted concatenation information) from the cooperation source apparatus 101.

  The conversion unit 906 converts the second unique information included in the attribute acquisition request received by the reception unit 905 into second identification information. Specifically, the conversion unit 906 refers to the reverse lookup table Tr and converts the second unique information included in the attribute acquisition request into second identification information. For example, when the attribute acquisition request includes the hash value “As8 & +)”, the converting unit 906 associates the hash value “As8 & +)” with the hash value “As8 & +)” in the reverse lookup table Tr. 2 Convert to real ID “bbb”.

  The decrypting unit 907 decrypts the encrypted connection information included in the attribute acquisition request received by the receiving unit 905 with the secret key related to the cooperation destination device 102. Specifically, the decryption unit 907 has a secret key corresponding to the public key assigned to the cooperation apparatus 103, and decrypts the encrypted concatenation information included in the attribute acquisition request with the secret key. For example, when the connection information “As8 & +) 20101004” is encrypted connection information encrypted with the public key of the cooperation destination apparatus 102, the connection information is obtained by decrypting the encrypted connection information with the secret key of the cooperation destination apparatus 102. “As8 & +) 20101004” is obtained.

  The determination unit 908 determines the validity of the second unique information based on the date information included in the connection information decoded by the decoding unit 907. Specifically, for example, the determination unit 908 extracts date information included in the connection information and compares it with the current date and time. The determination unit 908 determines whether or not the time interval between the date information and the current date is equal to or greater than a preset threshold value.

  If it is equal to or greater than the threshold value, the determination unit 908 determines that the hash value “As8 & +) included in the connection information is a valid hash value. Therefore, it is determined that the attribute information of the cooperation item is information that should not be transmitted to the cooperation destination apparatus 102. That is, it is determined that the information is old. In this case, the cooperation destination device 102 returns an error to the cooperation source device 101 as a response to the attribute acquisition request. On the other hand, when it is less than the threshold value, the second unique information included in the connection information is passed to the conversion unit 906. Thereby, the conversion unit 906 converts the second unique information into the second identification information with reference to the reverse lookup table Tr.

  The search unit 909 searches the attribute information associated with the second identification information converted by the conversion unit 906 with reference to the attribute table. Specifically, for example, the search unit 909 searches the attribute information associated with the second real ID “bbb” converted by the conversion unit 906 with reference to the attribute table TaB. Here, the attribute information to be searched is attribute information of the attribute item in which the flag is set to F = 1 among the attribute items. In the example shown in FIG. 4, the annual income information (123 (10,000 yen)) of the annual income item is retrieved.

  The transmission unit 910 transmits the attribute information searched by the search unit 909 to the cooperation source device 101. Specifically, for example, the transmission unit 910 transmits the annual income information (123 (10,000 yen)) of the searched annual income item to the cooperation source apparatus 101 as a response to the attribute acquisition request.

  In addition, when the generation unit 902 generates the second unique information, the transmission unit 910 transmits a second registration request including the cooperation identification information and the second unique information to the cooperation device 103. For example, the transmission unit 910 transmits the second registration request including the linkage ID “12345678” and the second unique information (the hash value “As8 & +” of the first real ID “aaa”). As a result, the cooperation device 103 creates the second cooperation table TcB.

<Registration request processing for linkage table>
FIG. 10 is a flowchart showing the linkage table registration request processing procedure. The execution subject is the cooperation source device 101 or the cooperation destination device 102 (hereinafter, “cooperation source / destination device”). The cooperation source / destination apparatus waits for the real ID, the cooperation ID, and the cooperation item to be accepted (step S1001: No), and if at least the real ID and the cooperation ID are accepted (step S1001: Yes), it is accepted in the attribute table. It is determined whether or not there is a record with the given real ID (step S1002). If there is no record (step S1002: No), registration cannot be requested and the process ends.

  On the other hand, when there is a record (step S1002: Yes), the cooperation source / destination apparatus calculates a hash value of the real ID (step S1003). Further, the cooperation source / destination apparatus determines whether or not a cooperation item is designated (step S1004). When the cooperation item is not specified (step S1004: No), the process proceeds to step S1007.

  On the other hand, when the cooperation item is designated (step S1004: Yes), the cooperation source / destination apparatus creates a reverse lookup table Tr that associates the hash value of the real ID with the real ID (step S1005). Then, the cooperation source / destination apparatus sets the cooperation item flag to ON (F = 1) in the record of the real ID in the attribute table (step S1006).

  Thereafter, in step S1007, the cooperation source / destination apparatus transmits a registration request including the hash value of the real ID and the cooperation ID to the cooperation apparatus 103 (step S1007). Thereby, in the case of the cooperation source apparatus 101, the first registration request can be transmitted to the cooperation apparatus 103, and in the case of the cooperation destination apparatus 102, the second registration request can be transmitted to the cooperation apparatus 103. Further, in the cooperation destination apparatus 102, the reverse lookup table Tr is created together with the transmission of the second registration request.

<Registration process of linkage table>
FIG. 11 is a flowchart showing the linkage table registration processing procedure. The execution subject is the cooperation apparatus 103. First, the cooperation apparatus 103 waits for a registration request (step S1001: No). When the registration request is received (step S1001: Yes), the cooperation device 103 determines whether or not the cooperation ID that matches the cooperation ID included in the registration request is in the issued cooperation ID (step S1002). ).

  If there is no matching issued cooperation ID (step S1002: No), the cooperation apparatus 103 cannot create a cooperation table, and thus ends the cooperation table registration process. On the other hand, when there is a matching issued cooperation ID (step S1002: Yes), the cooperation apparatus 103 creates a cooperation table by associating the cooperation ID included in the registration request with the hash value of the real ID (step S1002). S1003). And the cooperation apparatus 103 stores the produced cooperation table in a memory | storage part (step S1004). Thereby, the registration process of a cooperation table is complete | finished.

<Coordination table update request processing>
FIG. 12 is a flowchart illustrating a cooperation table update request processing procedure. The execution subject is the cooperation source / destination device. The cooperation source / destination apparatus waits for a real ID to be received (step S1201: No). When the real ID is accepted (step S1201: Yes), the cooperation source / destination apparatus determines whether there is a record of the accepted real ID in the attribute table (step S1202). If there is no record (step S1202: No), the update cannot be requested and the process ends.

  On the other hand, when there is a record (step S1202: Yes), the cooperation source / destination apparatus generates a new real ID (step S1203). Then, the cooperation source / destination apparatus calculates a new hash value of the new real ID (step S1204). Thereafter, the cooperation source / destination apparatus transmits the new and old hash values to the cooperation apparatus 103 (step S1205). Further, the cooperation source / destination apparatus determines whether there is a reverse lookup table Tr (step S1206). When there is no reverse lookup table Tr (step S1206: No), the process proceeds to step S1208.

  On the other hand, when there is a reverse lookup table Tr (step S1206: Yes), the cooperation source / destination device updates the reverse lookup table Tr (step S1207). Then, the cooperation source / destination apparatus updates the real ID in the attribute table from the old real ID to the new real ID (step S1208). Thus, the cooperation table update request process is terminated.

<Update processing of linkage table>
FIG. 13 is a flowchart showing the linkage table update processing procedure. The execution subject is the cooperation apparatus 103. First, the cooperation apparatus 103 waits for an update request (step S1301: No). When the update request is received (step S1301: Yes), the linkage apparatus 103 determines whether there is a linkage table Tc having a hash value that matches the old hash value among the new and old hash values included in the update request. Judgment is made (step S1302).

  If there is no linkage table Tc having a hash value that matches the old hash value (step S1302: No), the linkage apparatus 103 cannot update the linkage table, and thus ends the update process of the linkage table Tc. On the other hand, when there is a cooperation table Tc having a hash value that matches the old hash value (step S1302: Yes), the cooperation apparatus 103 includes the hash value of the cooperation table Tc from the old hash value in the update request. Update to a new hash value (step S1303). Thereby, the update process of cooperation table Tc is complete | finished.

<Linked search processing>
FIG. 14 is a sequence diagram illustrating the cooperative search processing procedure. The sequence diagram of FIG. 14 corresponds to the cooperative search example 1 shown in FIG. First, the cooperation source apparatus 101 designates the first real ID (step S1401). Next, the cooperation source apparatus 101 calculates a hash value of the first real ID (step S1402). Then, the cooperation source device 101 transmits an acquisition request including the hash value of the first real ID to the cooperation device 103 (step S1403).

  When receiving the acquisition request including the hash value of the first real ID, the linkage apparatus 103 identifies the first linkage table TcA having the first real ID from the linkage table Tc (step S1404). And the cooperation apparatus 103 searches cooperation ID from 1st cooperation table TcA (step S1405).

  Next, the cooperation apparatus 103 specifies the second cooperation table TcB having the searched cooperation ID from the cooperation table Tc (step S1406). And the cooperation apparatus 103 searches the hash value linked | related with cooperation ID from 2nd cooperation table TcB (step S1407). Then, the cooperation device 103 transmits the search hash value to the cooperation source device 101 (step S1408).

  In the cooperation source apparatus 101, when the search hash value is received (step S1408: Yes), the cooperation source apparatus 101 transmits an attribute acquisition request including the search hash value to the cooperation destination apparatus 102 (step S1409). When receiving the attribute acquisition request including the search hash value (step S1409), the cooperation destination apparatus 102 searches the reverse lookup table Tr for the second real ID associated with the search hash value (step S1410).

  Then, the cooperation destination device 102 searches the attribute table TaB for the attribute information of the cooperation item with the searched second real ID (step S1411). Then, the cooperation destination device 102 transmits the searched attribute information to the cooperation source device 101 (step S1412). When the retrieved attribute information is received, the cooperation source apparatus 101 provides a service corresponding to the attribute information to the user who is the first real ID (step S1413). Thereby, a cooperation search process is complete | finished.

  As described above, in the first embodiment, the table that directly associates the first real ID in the cooperation source device 101 with the second real ID in the cooperation destination device 102 is provided in both the cooperation source device 101 and the cooperation destination device 102. It does not exist in the cooperation device 103. Therefore, even if the first real ID is leaked, the attribute information associated with the second real ID can be concealed, and even if the second real ID is leaked, the attribute information associated with the first real ID Can be concealed. Therefore, the security of the user's personal information can be improved.

<Linked search processing>
FIG. 15 is a sequence diagram illustrating the cooperative search processing procedure. The sequence diagram of FIG. 15 corresponds to the cooperative search example 2 shown in FIG. In the cooperative search example 2 as well, the processing up to step S1407 in the sequence diagram of FIG. 14 is executed. Therefore, in FIG. 15, the processing after step S1407 of FIG. 14 will be described.

  First, the cooperation apparatus 103 concatenates date information to the search hash value, and encrypts the connection information with the public key of the cooperation destination apparatus 102 (step S1501). The cooperation device 103 transmits the encrypted connection information as a response to the cooperation source device 101 (step S1502). The cooperation source device 101 transmits an attribute acquisition request including the encrypted connection information to the cooperation destination device 102 (step S1503).

  The cooperation destination device 102 decrypts the encrypted connection information with the private key of the cooperation destination device 102 (step S1504), and extracts a search hash value and date information from the decrypted connection information (step S1505). Then, the cooperation destination apparatus 102 determines the validity of the search hash value based on the extracted date information (step S1506). If not valid (step S1506: No), the process proceeds to step S1511. On the other hand, if it is valid (step S1506: Yes), the second real ID associated with the search hash value is searched from the reverse lookup table Tr (step S1507).

  Then, the cooperation destination device 102 searches the attribute table TaB for the attribute information of the cooperation item with the searched second real ID (step S1508). Then, the cooperation destination device 102 transmits the searched attribute information to the cooperation source device 101 (step S1509). When the retrieved attribute information is received, the cooperation source apparatus 101 provides a service corresponding to the attribute information to the user who is the first real ID (step S1510).

  If it is determined in step S1506 that it is not appropriate (step S1506: No), the cooperation destination apparatus 102 transmits a search impossibility notification to the cooperation source apparatus 101 (step S1511). When the cooperation source device 101 receives the search disapproval notice, it outputs a cooperation disabling output (step S1512). Thereby, a cooperation search process is complete | finished.

  As described above, the validity of the attribute information can be determined by determining the validity of the second unique information using the date information. Therefore, when the content of the attribute information is old, the cooperation is rejected, and it is possible to prevent the provision of service based on the erroneous attribute information in the cooperation source apparatus 101 in advance.

(Embodiment 2)
Next, a second embodiment will be described. In the first embodiment, the real ID is converted into the hash value of each institution by the hash function, and the hash value and the linkage ID are associated with each other, thereby realizing the cooperative search without directly associating the real IDs. On the other hand, in the second embodiment, instead of using a hash function, encryption is performed using a common key of each organization, and an association is performed by directly associating the real ID with each other by associating the encrypted real ID with the cooperation ID. Realize. In addition, the same code | symbol is attached | subjected to the same structure as Embodiment 1, and the description is abbreviate | omitted. In the following description, a common key will be used, but the same applies even if each institution has a secret key in the public key cryptosystem.

<System configuration example>
FIG. 16 is an explanatory diagram of a system configuration example of the cooperation system according to the second embodiment. In the cooperation system of the second embodiment, the common source device KA stores the common key KA instead of the hash function hA (). Similarly, the cooperation destination apparatus 102 stores a common key KB instead of the hash function hB (). Further, the linkage destination device 102 does not have the reverse lookup table Tr. Accordingly, the stored contents of the linkage table Tc and some functions of the linkage functions FA to FC are different from those of the first embodiment.

  For example, the generation unit 803 of the cooperation source apparatus 101 does not generate a hash value, but encrypts the first real ID with the common key KA to generate an encrypted first real ID. Similarly, the generation unit 902 of the cooperation destination device 102 does not generate a hash value, but also generates an encrypted second real ID by encrypting the second real ID with the common key KB. Further, the creation unit 903 is not necessary in the cooperation destination apparatus 102. In addition, the conversion unit 906 decrypts the encrypted second real ID with the common key KB.

<Example of creating a linkage table>
FIG. 17 is an explanatory diagram of an example of creating a linkage table according to the second embodiment. Here, a certain user (user name: A) will be described. In FIG. 17, (1) and (2) are the same as FIG. Further, the reverse lookup table Tr is not created as in (4) of FIG.

(3) When the cooperation source device 101 and the cooperation destination device 102 accept the combination of the real ID and the cooperation ID, the real ID is encrypted with the common key of each. Specifically, in the cooperation source apparatus 101, the encrypted first real ID is obtained by encrypting the first real ID “aaa” with the common key KA. Similarly, in the cooperation destination apparatus 102, the encrypted first real ID is obtained by encrypting the second real ID “bbb” with the common key KB.

(4) When the encrypted real ID is calculated, the cooperation source device 101 and the cooperation destination device 102 transmit a cooperation table registration request to the cooperation device 103. The registration request of the cooperation source device 101 includes the encrypted first real ID of the first real ID “aaa” of the cooperation source device 101 and the cooperation ID “12345678”. In addition, the registration request of the cooperation destination device 102 includes the encrypted second real ID of the second real ID “bbb” of the cooperation destination device 102 and the cooperation ID “12345678”.

(5) Upon receiving the registration request for the linkage table Tc, the linkage device 103 creates the linkage table Tc. For example, when there is a registration request from the cooperation source apparatus 101, the cooperation apparatus 103 creates a first cooperation table TcA in which the encrypted first real ID and the cooperation ID “12345678” are associated with each other. In addition, the cooperation apparatus 103 creates a second cooperation table TcB that associates the encrypted second real ID with the cooperation ID “12345678”. This completes the creation process.

<Update example of linkage table>
FIG. 18 is an explanatory diagram of an example of updating the cooperation table according to the second embodiment. FIG. 18 illustrates an example of updating the second linkage table TcB as an example, but the first linkage table TcA is updated in the same manner.

(1) First, Party A requests the organization B to update the real ID. Specifically, Party A requests engine B to update the second real ID “bbb”. As a request method, A may visit the institution B and make a request, or a computer owned by A may transmit a request for updating the second real ID to the cooperation destination apparatus 102. When there is an update request, the cooperation destination apparatus 102 issues a new second real ID. Here, the new second real ID is “ccc”.

(2) Next, the cooperation destination apparatus 102 encrypts the new second real ID “ccc” with the common key KB of the cooperation destination apparatus 102 to generate a new encrypted second real ID.

(3) The cooperation destination apparatus 102 rewrites the second real ID of the ID item of the attribute table TaB from the old second real ID “bbb” to the new second real ID “ccc”.

(4) When the new encrypted second real ID is calculated, the cooperation destination device 102 transmits a cooperation table update request to the cooperation device 103. The cooperation table update request includes the new and old encrypted second real ID of the cooperation destination apparatus 102.

(5) On the other hand, when the cooperation device 103 receives the update request (4), it updates the second cooperation table TcB. Specifically, the cooperation apparatus 103 uses the old encrypted second real ID as a clue among the new and old encrypted second real IDs of the cooperation destination apparatus 102 included in the update request for the cooperation table Tc, and uses the cooperation table Tc. The second linkage table TcB is searched from the list.

(6) Then, the linkage apparatus 103 rewrites the value of the encrypted second real ID item in the second linkage table TcB from the old encrypted second real ID to the new encrypted second real ID. Thereby, the update process is completed.

<Example of cooperative search>
FIG. 19 is an explanatory diagram of a cooperative search example according to the second embodiment. FIG. 19 shows an example in which the city hall (institution A: cooperation source apparatus 101) acquires the former attribute information: annual income from the tax office (institution B: cooperation destination apparatus 102).

(1) First, the cooperation source apparatus 101 designates the former real ID “aaa”, encrypts it with the common key KA, and obtains the encrypted first real ID.

(2) Next, the cooperation source apparatus 101 transmits an acquisition request for the encrypted second real ID of the cooperation destination apparatus 102 to the cooperation apparatus 103. The acquisition request includes the encrypted first real ID obtained in (1).

(3) Upon receiving the acquisition request (2), the cooperation device 103 searches the cooperation table Tc for the first cooperation table TcA including the encrypted first real ID. Next, the cooperation apparatus 103 specifies the cooperation ID “12345678” associated with the encrypted first real ID of the searched first cooperation table TcA.

(4) The linkage apparatus 103 searches the linkage table Tc for the second linkage table TcB having the identified linkage ID “12345678”. Next, the linkage apparatus 103 searches for the encrypted second real ID associated with the linkage ID “12345678” of the found second linkage table TcB.

(5) Thereafter, the cooperation device 103 transmits the encrypted second real ID searched in (4) to the cooperation source device 101.

(6) Upon receiving the encrypted second real ID in (5), the collaboration source apparatus 101 transmits an attribute request to the collaboration destination apparatus 102. The attribute request includes the encrypted second real ID received in (5).

(7) The cooperation destination apparatus 102 extracts the encrypted second real ID from the attribute request received in (6), and decrypts the extracted encrypted second real ID with the common key KB of the cooperation destination apparatus 102. Thus, the second real ID “bbb” is obtained. Then, the cooperation destination apparatus 102 specifies the record of the second real ID “bbb” in the second attribute table TaB, and extracts the attribute information of the attribute item whose flag is set to F = 1. Here, the annual income item 123 (10,000 yen) is extracted.

(9) Thereafter, the cooperation destination apparatus 102 transmits the attribute information (annual income 1.32 million yen) extracted in (7) to the cooperation source apparatus 101. In addition, when the cooperation destination apparatus 102 and the computer owned by A are communicably connected, the presence / absence of provision of attribute information may be confirmed prior to transmission of the attribute information.

(10) Finally, since the cooperation source apparatus 101 has obtained the annual income of the former from the cooperation destination apparatus 102, the service corresponding to the annual income is provided to the former. As described above, even if there is no table that associates the first real ID “aaa” of the back of the engine A with the second real ID “bbb” of the back of the engine B, the engine A and the engine B are linked. be able to. That is, the correspondence relationship between the first real ID “aaa” of the back of Engine A and the second real ID “bbb” of the back of Engine B will not leak. Further, even if the linkage table Tc leaks, it is only a combination of the linkage ID and the encrypted real ID, and therefore the real ID is not specified even if it leaks.

<Registration request processing for linkage table>
FIG. 20 is a flowchart illustrating the registration table registration request processing procedure. The execution subject is the cooperation source device 101 or the cooperation destination device 102 (hereinafter, “cooperation source / destination device”). The cooperation source / destination apparatus waits for the real ID, the cooperation ID, and the cooperation item to be received (step S2001: No), and if at least the real ID and the cooperation ID are received (step S2001: Yes), it is received in the attribute table. It is determined whether or not there is a record with the given real ID (step S2002). If there is no record (step S2002: No), the registration request cannot be made, and the cooperation table registration request processing is terminated.

  On the other hand, when there is a record (step S2002: Yes), the cooperation source / destination apparatus encrypts the real ID with the common key (step S2003). Further, the cooperation source / destination apparatus determines whether or not a cooperation item is designated (step S2004). When the cooperation item is not specified (step S2004: No), the process proceeds to step S2006.

  On the other hand, when there is a designation of a linkage item (step S2004: Yes), the linkage source / destination device sets the linkage item flag to ON (F = 1) in the record of the real ID in the attribute table (step S2005). ).

  Thereafter, in step S2006, the cooperation source / destination apparatus transmits a registration request including the encrypted real ID and the cooperation ID to the cooperation apparatus 103 (step S2006). Thereby, in the case of the cooperation source apparatus 101, the first registration request can be transmitted to the cooperation apparatus 103, and in the case of the cooperation destination apparatus 102, the second registration request can be transmitted to the cooperation apparatus 103. In the cooperation destination apparatus 102, it is not necessary to create the reverse lookup table Tr as in the first embodiment.

<Registration process of linkage table>
FIG. 21 is a flowchart showing the linkage table registration processing procedure. The execution subject is the cooperation apparatus 103. First, the cooperation apparatus 103 waits for a registration request (step S2101: No). When the registration request is received (step S2101: Yes), the cooperation device 103 determines whether or not the cooperation ID that matches the cooperation ID included in the registration request is in the issued cooperation ID (step S2102). ).

  If there is no matching issued cooperation ID (step S2102: No), the cooperation device 103 cannot create the cooperation table Tc, and thus ends the cooperation table registration process. On the other hand, when there is a matching issued cooperation ID (step S2102: Yes), the cooperation device 103 creates a cooperation table Tc by associating the cooperation ID and the encrypted real ID included in the registration request (step S2102). S2103). And the cooperation apparatus 103 stores the produced cooperation table Tc in a memory | storage part (step S2104). Thereby, the registration process of the linkage table Tc ends.

<Coordination table update request processing>
FIG. 22 is a flowchart illustrating a cooperation table update request processing procedure. The execution subject is the cooperation source / destination device. The cooperation source / destination apparatus waits for a real ID to be received (step S2201: No). When the real ID is accepted (step S2201: Yes), the cooperation source / destination apparatus determines whether there is a record of the accepted real ID in the attribute table (step S2202). If there is no record (step S2202: No), an update request cannot be made, and the linkage table update request process is terminated.

  On the other hand, when there is a record (step S2202: Yes), the cooperation source / destination apparatus generates a new real ID (step S2203). Then, the cooperation source / destination apparatus encrypts the new and old real IDs with the common key (step S2204). Thereafter, the cooperation source / destination apparatus transmits the old and new encrypted real IDs to the cooperation apparatus 103 (step S2205). Then, the cooperation source / destination apparatus updates the real ID in the attribute table from the old real ID to the new real ID (step S2206). Thereby, the update request process of the linkage table Tc ends.

<Update processing of linkage table>
FIG. 23 is a flowchart showing the linkage table update processing procedure. The execution subject is the cooperation apparatus 103. First, the cooperation apparatus 103 waits for an update request (step S2301: No). When the update request is received (step S2301: Yes), the linkage apparatus 103 has a linkage table Tc having an encrypted real ID that matches the old real ID among the old and new encrypted real IDs included in the update request. It is determined whether or not (step S2302).

  If there is no linkage table Tc having an encrypted real ID that matches the old encrypted real ID (step S2302: No), the linkage apparatus 103 cannot update the linkage table Tc, and thus ends the linkage table Tc update process. On the other hand, when there is a linkage table Tc having an encrypted real ID that matches the old encrypted real ID (step S2302: Yes), the linkage apparatus 103 uses the old encrypted real ID as the encrypted real ID of the linked table Tc. To the new encrypted real ID included in the update request (step S2303). Thereby, the update process of cooperation table Tc is complete | finished.

<Linked search processing>
FIG. 24 is a sequence diagram illustrating the cooperative search processing procedure. The sequence diagram of FIG. 24 corresponds to the cooperative search example shown in FIG. First, the cooperation source apparatus 101 designates the first real ID (step S2401). Next, the collaboration source apparatus 101 encrypts the first real ID with the common key of the collaboration source apparatus 101 (step S2402). Then, the cooperation source apparatus 101 transmits an acquisition request including the encrypted first real ID to the cooperation apparatus 103 (step S2403).

  When the cooperation device 103 receives the acquisition request including the encrypted first real ID, the cooperation device 103 identifies the first cooperation table TcA having the encrypted first real ID from the cooperation table Tc (step S2404). And the cooperation apparatus 103 searches cooperation ID from 1st cooperation table TcA (step S2405).

  Next, the cooperation apparatus 103 specifies the second cooperation table TcB having the searched cooperation ID from the cooperation table Tc (step S2406). And the cooperation apparatus 103 searches the encryption 2nd real ID linked | related with cooperation ID from 2nd cooperation table TcB (step S2407). Then, the cooperation device 103 transmits the searched encrypted second real ID to the cooperation source device 101 (step S2408).

  When the encrypted second real ID is received (step S2408: YES), the cooperation source apparatus 101 transmits an attribute acquisition request including the encrypted second real ID to the cooperation destination apparatus 102 (step S2409). When receiving the attribute acquisition request including the encrypted second real ID (step S2409), the cooperation destination device 102 decrypts the encrypted second real ID with the common key of the cooperation destination device 102 (step S2410).

  Then, the cooperation destination device 102 searches the attribute table TaB for the attribute information of the cooperation item with the decrypted second real ID (step S2411). Then, the cooperation destination device 102 transmits the searched attribute information to the cooperation source device 101 (step S2412). When the retrieved attribute information is received, the cooperation source apparatus 101 provides a service corresponding to the attribute information to the user who is the first real ID (step S2413). Thereby, a cooperation search process is complete | finished.

  As described above, in the second embodiment, the table that directly associates the first real ID in the collaboration source apparatus 101 with the second real ID in the collaboration destination apparatus 102 is provided in both the collaboration source apparatus 101 and the collaboration destination apparatus 102. It does not exist in the cooperation device 103. Therefore, even if the first real ID is leaked, the attribute information associated with the second real ID can be concealed, and even if the second real ID is leaked, the attribute information associated with the first real ID Can be concealed. Therefore, the security of the user's personal information can be improved.

  Further, since the reverse lookup table Tr does not exist as in the first embodiment, security can be further improved. Further, since the real ID is encrypted with the common key in the cooperation source device 101 and the cooperation destination device 102, the real ID is not held in the cooperation device 103, and security can be improved.

  In the second embodiment described above, the example in which the real ID is encrypted or decrypted using the common key has been described. However, a public key method may be employed. In this case, the cooperation source apparatus 101 holds a secret key SKA unique to the cooperation source apparatus 101, and the cooperation apparatus 103 holds a public key PKA corresponding to the secret key SKA.

  When creating the first linkage table TcA, the linkage source device 101 encrypts the first real ID with the secret key SKA and transmits the encrypted first real ID and the linkage ID to the linkage device 103. Upon receiving the encrypted first real ID, the cooperation apparatus 103 decrypts the encrypted first real ID with the public key PKA, and further encrypts the decrypted first real ID with the public key PKA. Thereby, the cooperation apparatus 103 can create the first cooperation table TcA in which the encrypted first real ID (encrypted with the public key PKA) and the cooperation ID received from the cooperation source apparatus 101 are associated with each other.

  Similarly, the cooperation destination apparatus 102 holds a private key SKB unique to the cooperation source apparatus 101, and the cooperation apparatus 103 holds a public key PKB corresponding to the secret key SKB.

  When creating the cooperation table TcB, the cooperation destination apparatus 102 encrypts the second real ID with the secret key SKB, and transmits the encrypted second real ID and the cooperation ID to the cooperation apparatus 103. When receiving the encrypted second real ID, the cooperation apparatus 103 decrypts the encrypted second real ID with the public key PKB, and further encrypts the decrypted second real ID with the public key PKB. Thereby, the cooperation apparatus 103 can create the cooperation table TcB in which the encrypted second real ID (encrypted with the public key PKB) is associated with the cooperation ID received from the cooperation destination apparatus 102.

  At the time of cooperative search, the cooperation destination device 102 receives the encrypted second real ID (encrypted with the public key PKB) from the cooperation device 103 via the cooperation source device 101 in response to an attribute acquisition request from the cooperation source device 101. Receive. Therefore, the cooperation destination apparatus 102 can obtain the second real ID by decrypting the encrypted second real ID (encrypted with the public key PKB) with the secret key SKB.

  As described above, according to the present embodiment, in addition to the organizations that cooperate with each other, the cooperation organization C is introduced as a third party organization, and the cooperation device 103 in the cooperation organization C creates a cooperation table for each service. Keep it. Since the real ID is not held in the linkage table, the hash value obtained by giving the real ID to an irreversible function (for example, a hash function) or the encrypted real ID is held. Even if leaked, the real ID cannot be reached. Therefore, security can be improved.

  Further, in the embodiment, when searching for the attribute of the same person of another service from a certain service, the hash value or the encrypted real ID of the corresponding other service is obtained from the cooperating institution C, and the cooperation destination apparatus 102 The search is performed by restoring the data in the network, and the search result is provided to the cooperation source apparatus 101. Thereby, the cooperation source apparatus 101 can search the attribute information in the cooperation destination apparatus 102 without knowing the real ID in the cooperation destination apparatus 102. Therefore, since the real ID itself is not linked, the real ID can be prevented from being leaked, thereby reducing the risk of leaking personal information and preventing internal crimes of each service, thereby realizing highly reliable ID linkage. .

  The linkage method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This cooperation program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. Further, this cooperation program may be distributed via a network such as the Internet.

  The following additional notes are disclosed with respect to the embodiment described above.

(Additional remark 1) It is a cooperation apparatus which cooperates information between a cooperation origin apparatus and a cooperation destination apparatus,
First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. Storage means for associating and storing second unique information, cooperative identification information common to the first identification information and the second identification information,
Receiving means for receiving the first specific information from the cooperation source device;
Search means for searching the second unique information associated with the first unique information received by the receiving means from the storage means via the cooperation identification information;
Transmitting means for transmitting the second specific information searched by the searching means to the cooperation source device;
The cooperation apparatus characterized by comprising.

(Supplementary Note 2) By generating connection information obtained by connecting date information related to the cooperation ID to the second unique information searched by the search means, and encrypting the connection information with a public key related to the cooperation destination device, A generating means for generating encrypted connection information;
The transmission means includes
The cooperation apparatus according to appendix 1, wherein the encrypted connection information generated by the generation unit is transmitted to the cooperation source apparatus.

(Additional remark 3) It is a cooperation apparatus which performs cooperation of information between a cooperation origin apparatus and a cooperation destination apparatus,
First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus; second unique information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus; Storage means for associating and storing cooperative identification information common to the first identification information and the second identification information;
Receiving means for receiving the first specific information from the cooperation source device;
Search means for searching the second unique information associated with the first unique information received by the receiving means from the storage means via the cooperation identification information;
Transmitting means for transmitting the second specific information searched by the searching means to the cooperation source device;
The cooperation apparatus characterized by comprising.

(Additional remark 4) The 1st registration request containing the said 1st specific information and the said cooperation identification information is received from the said cooperation origin apparatus by the said receiving means, and the 2nd registration request containing the said 2nd specific information and the said cooperation identification information Is generated from the cooperation destination device, a creation unit that creates a table in which the first unique information, the second unique information, and the linkage identification information are associated with each other and is registered in the storage unit,
The search means includes
When the first unique information is received by the receiving means, the cooperation identification information is identified with reference to the table, and the second unique information associated with the identified cooperation identification information is searched. The linkage device according to any one of appendices 1 to 3, characterized by:

(Supplementary Note 5) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The linkage source accessible to the linkage device that associates and stores the second unique information obtained in association with the first identification information and the linkage identification information common to the second identification information, and the linkage destination device A device,
Designating means for designating the first identification information;
Generating means for generating the first unique information by giving the first identification information specified by the specifying means to the first one-way function;
First transmission means for transmitting an acquisition request for the second specific information including the first specific information generated by the generation means to the cooperation device;
First receiving means for receiving, from the cooperation apparatus, the second unique information retrieved by the cooperation apparatus as a result of the acquisition request for the second unique information being transmitted to the cooperation apparatus by the first transmission means; ,
Second transmission means for transmitting an attribute acquisition request including the second unique information received by the first reception means to the cooperation destination device;
As a result of transmitting the attribute acquisition request to the cooperation destination device by the second transmission unit, the attribute acquisition request is specified from a reverse lookup table that associates the second unique information and the second identification information in the cooperation destination device. Second receiving means for receiving attribute information associated with the second identification information from the cooperation destination device;
The cooperation origin apparatus characterized by providing.

(Supplementary Note 6) When the cooperation identification information and the first unique information are not associated with each other in the cooperation apparatus, a reception unit that receives the cooperation identification information and the first identification information is provided.
The generating means includes
Generating the first unique information by giving the first identification information received by the receiving means to the first one-way function;
The first transmission means includes
6. The cooperation destination apparatus according to appendix 5, wherein the cooperation identification information and the registration request for the first unique information generated by the generation unit are transmitted to the cooperation apparatus.

(Supplementary Note 7) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source device, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination device. The cooperation source device accessible to the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation destination device,
Designating means for designating the first identification information;
Generating means for generating the first unique information by encrypting the first identification information specified by the specifying means with the first common key;
First transmission means for transmitting an acquisition request for the second specific information including the first specific information generated by the generation means to the cooperation device;
First receiving means for receiving, from the cooperation apparatus, the second unique information retrieved by the cooperation apparatus as a result of the acquisition request for the second unique information being transmitted to the cooperation apparatus by the first transmission means; ,
Second transmission means for transmitting an attribute acquisition request including the second unique information received by the first reception means to the cooperation destination device;
As a result of transmission of the attribute acquisition request to the cooperation destination device by the second transmission means, association with the second identification information decrypted with the second common key from the second unique information in the cooperation destination device Second receiving means for receiving the attribute information being received from the cooperation destination device;
The cooperation origin apparatus characterized by providing.

(Supplementary Note 8) When the cooperation identification information and the first unique information are not associated with each other in the cooperation apparatus, a reception unit that receives the cooperation identification information and the first identification information is provided.
The generating means includes
The first unique information is generated by encrypting the first identification information received by the receiving means with the first common key,
The first transmission means includes
The cooperation source apparatus according to appendix 7, wherein the cooperation identification information and the registration request for the first unique information generated by the generation unit are transmitted to the cooperation apparatus.

(Supplementary Note 9) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The cooperation destination accessible to the cooperation device that associates and stores the second unique information obtained in association with the first identification information and the cooperation identification information common to the second identification information, and the cooperation source device A device,
Storage means for storing an attribute table in which the second identification information is associated with the attribute information;
Receiving means for receiving, from the cooperation source device, an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device;
Conversion means for converting the second unique information included in the attribute acquisition request received by the receiving means into the second identification information;
Search means for searching for the attribute information associated with the second identification information converted by the conversion means with reference to the attribute table;
Transmitting means for transmitting the attribute information searched by the searching means to the cooperation source device;
The cooperation destination apparatus characterized by comprising.

(Supplementary Note 10) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The cooperation destination accessible to the cooperation device that associates and stores the second unique information obtained in association with the first identification information and the cooperation identification information common to the second identification information, and the cooperation source device A device,
Storage means for storing an attribute table in which the second identification information is associated with the attribute information;
The encrypted concatenation information obtained by encrypting the concatenation information obtained by concatenating the date information related to the cooperation identification information with the second unique information with the public key related to the cooperation destination device from the cooperation source device that has received from the cooperation device. Receiving means for receiving an attribute acquisition request including information;
Decryption means for decrypting the encrypted connection information included in the attribute acquisition request received by the reception means with a secret key related to the cooperation destination device;
Determination means for determining the validity of the second unique information included in the connection information based on the date information included in the connection information decoded by the decoding means;
Conversion means for converting the second specific information contained in the concatenated information decoded by the decoding means into the second identification information based on the determination result determined by the determination means;
Search means for searching for the attribute information associated with the second identification information converted by the conversion means with reference to the attribute table;
Transmitting means for transmitting the attribute information searched by the searching means to the cooperation source device;
The cooperation destination apparatus characterized by comprising.

(Appendix 11) The storage means
Storing a reverse lookup table associating the second unique information with the second identification information;
The converting means includes
The cooperation destination apparatus according to appendix 9 or 10, wherein the second unique information included in the attribute acquisition request is converted into the second identification information with reference to the reverse lookup table.

(Additional remark 12) When the said cooperation identification information and the said 2nd specific information are not linked | related within the said cooperation apparatus, the reception means which receives the said cooperation identification information and the said 2nd identification information,
Generating means for generating the second specific information by giving the second identification information received by the receiving means to the second one-way function;
Creating means for creating the reverse lookup table by associating the second unique information generated by the generating means with the second identification information;
The transmission means includes
The cooperation destination apparatus according to appendix 11, wherein a registration request for the cooperation identification information and the second unique information is transmitted to the cooperation apparatus.

(Supplementary Note 13) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. The cooperation destination device accessible to the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation source device,
Storage means for storing an attribute table in which the second identification information is associated with the attribute information;
Receiving means for receiving, from the cooperation source device, an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device;
Generating means for generating the second identification information by decrypting the second unique information included in the attribute acquisition request received by the receiving means with the second common key;
Search means for searching the attribute information associated with the second identification information generated by the generation means with reference to the attribute table;
Transmitting means for transmitting the attribute information searched by the searching means to the cooperation source device;
The cooperation destination apparatus characterized by comprising.

(Supplementary Note 14) When the cooperation identification information and the second unique information are not associated in the cooperation device, the cooperation identification information and the second identification information are received.
The generating means includes
The second unique information is generated by encrypting the second identification information received by the receiving means with the second common key,
The transmission means includes
14. The cooperation destination apparatus according to appendix 13, wherein the cooperation identification information and the registration request for the second unique information generated by the generation unit are transmitted to the cooperation apparatus.

(Supplementary note 15) Setting means for setting a specific attribute item selected from the attribute item group of the attribute table,
The search means includes
Referring to the attribute table, searching for attribute information of the specific attribute item set by the setting unit among attribute information groups associated with the second identification information converted by the conversion unit. The cooperation destination device according to any one of Supplementary notes 9 to 14, which is characterized.

(Supplementary Note 16) The first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and the second identification information to the second one-way function in the cooperation destination device In a cooperation apparatus comprising storage means for storing the second unique information obtained in association with the first identification information and the common identification information common to the second identification information,
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
A transmission step of transmitting the second unique information searched by the search step to the cooperation source device;
A cooperative program characterized by running

(Supplementary Note 17) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. In a cooperation apparatus provided with a storage unit that associates and stores unique information, cooperation identification information common to the first identification information and the second identification information,
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
A transmission step of transmitting the second unique information searched by the search step to the cooperation source device;
A cooperative program characterized by running

(Supplementary Note 18) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and second identification information to the second one-way function in the cooperation destination device The linkage source accessible to the linkage device that associates and stores the second unique information obtained in association with the first identification information and the linkage identification information common to the second identification information, and the linkage destination device To the device,
A designation step for designating the first identification information;
Generating the first unique information by giving the first identification information designated by the designation step to the first one-way function;
A first transmission step of transmitting an acquisition request for the second specific information including the first specific information generated by the generation step to the cooperation device;
A first receiving step of receiving the second unique information retrieved by the cooperation device from the cooperation device as a result of the acquisition request of the second unique information being transmitted to the cooperation device by the first transmission step; ,
A second transmission step of transmitting an attribute acquisition request including the second unique information received by the first reception step to the cooperation destination device;
As a result of the attribute acquisition request being transmitted to the cooperation destination device in the second transmission step, the attribute acquisition request is specified from a reverse lookup table that associates the second unique information in the cooperation destination device with the second identification information. A second receiving step of receiving attribute information associated with the second identification information from the cooperation destination device;
A cooperative program characterized by running

(Supplementary Note 19) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. In the cooperation source device accessible to the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation destination device,
A designation step for designating the first identification information;
A step of generating the first unique information by encrypting the first identification information specified in the specifying step with the first common key;
A first transmission step of transmitting an acquisition request for the second specific information including the first specific information generated by the generation step to the cooperation device;
A first receiving step of receiving the second unique information retrieved by the cooperation device from the cooperation device as a result of the acquisition request of the second unique information being transmitted to the cooperation device by the first transmission step; ,
A second transmission step of transmitting an attribute acquisition request including the second unique information received by the first reception step to the cooperation destination device;
As a result of the attribute acquisition request being transmitted to the cooperation destination device in the second transmission step, the second identification information is associated with the second identification information decrypted with the second common key from the second unique information in the cooperation destination device. A second receiving step of receiving the attribute information being received from the cooperation destination device;
A cooperative program characterized by running

(Supplementary Note 20) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and second identification information to the second one-way function in the cooperation destination device The second unique information obtained in association with the first identification information and the second identification information and the linkage identification information that is common to the second identification information, and the linkage source apparatus, and the linkage source apparatus, In the cooperation destination device comprising storage means for storing an attribute table in which second identification information and attribute information are associated with each other,
A receiving step of receiving an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device from the cooperation source device;
A conversion step of converting the second unique information included in the attribute acquisition request received by the reception step into the second identification information;
A search step of searching for the attribute information associated with the second identification information converted by the conversion step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
A cooperative program characterized by running

(Supplementary note 21) The first unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and the second identification information to the second one-way function in the cooperation destination device The second unique information obtained in association with the first identification information and the second identification information and the linkage identification information that is common to the second identification information, and the linkage source apparatus, and the linkage source apparatus, In the cooperation destination device comprising storage means for storing an attribute table in which second identification information and attribute information are associated with each other,
The encrypted concatenation information obtained by encrypting the concatenation information obtained by concatenating the date information related to the cooperation identification information with the second unique information with the public key related to the cooperation destination device from the cooperation source device that has received from the cooperation device. A receiving step for receiving an attribute acquisition request including information;
A decryption step of decrypting the encrypted connection information included in the attribute acquisition request received by the reception step with a secret key related to the cooperation destination device;
A determination step of determining the validity of the second unique information included in the connection information based on the date information included in the connection information decoded by the decoding step;
A conversion step of converting the second unique information contained in the concatenated information decoded by the decoding step into the second identification information based on the determination result determined by the determination step;
A search step of searching for the attribute information associated with the second identification information converted by the conversion step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
A cooperative program characterized by running

(Supplementary Note 22) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source device, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination device. It is possible to access the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation source device, and the second identification information and the attribute In the cooperation destination device comprising storage means for storing an attribute table that associates information,
A receiving step of receiving an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device from the cooperation source device;
A generating step of generating the second identification information by decrypting the second unique information included in the attribute acquisition request received by the receiving step with the second common key;
A search step of searching for the attribute information associated with the second identification information generated by the generation step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
A cooperative program characterized by running

(Supplementary Note 23) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device A cooperation device comprising storage means for storing the second unique information obtained in association with the first identification information and the common identification information common to the second identification information;
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
A transmission step of transmitting the second unique information searched by the search step to the cooperation source device;
The cooperation method characterized by performing this.

(Supplementary Note 24) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. A linkage apparatus comprising a storage unit that stores unique information, linkage identification information common to the first identification information and the second identification information in association with each other,
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
A transmission step of transmitting the second unique information searched by the search step to the cooperation source device;
The cooperation method characterized by performing this.

(Supplementary Note 25) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The linkage source accessible to the linkage device that associates and stores the second unique information obtained in association with the first identification information and the linkage identification information common to the second identification information, and the linkage destination device The device
A designation step for designating the first identification information;
Generating the first unique information by giving the first identification information designated by the designation step to the first one-way function;
A first transmission step of transmitting an acquisition request for the second specific information including the first specific information generated by the generation step to the cooperation device;
A first receiving step of receiving the second unique information retrieved by the cooperation device from the cooperation device as a result of the acquisition request of the second unique information being transmitted to the cooperation device by the first transmission step; ,
A second transmission step of transmitting an attribute acquisition request including the second unique information received by the first reception step to the cooperation destination device;
As a result of the attribute acquisition request being transmitted to the cooperation destination device in the second transmission step, the attribute acquisition request is specified from a reverse lookup table that associates the second unique information in the cooperation destination device with the second identification information. A second receiving step of receiving attribute information associated with the second identification information from the cooperation destination device;
The cooperation method characterized by performing this.

(Supplementary Note 26) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. The cooperation source device accessible to the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation destination device,
A designation step for designating the first identification information;
A step of generating the first unique information by encrypting the first identification information specified in the specifying step with the first common key;
A first transmission step of transmitting an acquisition request for the second specific information including the first specific information generated by the generation step to the cooperation device;
A first receiving step of receiving the second unique information retrieved by the cooperation device from the cooperation device as a result of the acquisition request of the second unique information being transmitted to the cooperation device by the first transmission step; ,
A second transmission step of transmitting an attribute acquisition request including the second unique information received by the first reception step to the cooperation destination device;
As a result of the attribute acquisition request being transmitted to the cooperation destination device in the second transmission step, the second identification information is associated with the second identification information decrypted with the second common key from the second unique information in the cooperation destination device. A second receiving step of receiving the attribute information being received from the cooperation destination device;
The cooperation method characterized by performing this.

(Supplementary Note 27) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The second unique information obtained in association with the first identification information and the second identification information and the linkage identification information that is common to the second identification information, and the linkage source apparatus, and the linkage source apparatus, The cooperation destination device including a storage unit that stores an attribute table in which second identification information and attribute information are associated with each other.
A receiving step of receiving an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device from the cooperation source device;
A conversion step of converting the second unique information included in the attribute acquisition request received by the reception step into the second identification information;
A search step of searching for the attribute information associated with the second identification information converted by the conversion step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
The cooperation method characterized by performing this.

(Supplementary note 28) First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device and second identification information to the second one-way function in the cooperation destination device The second unique information obtained in association with the first identification information and the second identification information and the linkage identification information that is common to the second identification information, and the linkage source apparatus, and the linkage source apparatus, The cooperation destination device including a storage unit that stores an attribute table in which second identification information and attribute information are associated with each other.
The encrypted concatenation information obtained by encrypting the concatenation information obtained by concatenating the date information related to the cooperation identification information with the second unique information with the public key related to the cooperation destination device from the cooperation source device that has received from the cooperation device. A receiving step for receiving an attribute acquisition request including information;
A decryption step of decrypting the encrypted connection information included in the attribute acquisition request received by the reception step with a secret key related to the cooperation destination device;
A determination step of determining the validity of the second unique information included in the connection information based on the date information included in the connection information decoded by the decoding step;
A conversion step of converting the second unique information contained in the concatenated information decoded by the decoding step into the second identification information based on the determination result determined by the determination step;
A search step of searching for the attribute information associated with the second identification information converted by the conversion step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
The cooperation method characterized by performing this.

(Supplementary Note 29) First unique information obtained by encrypting the first identification information with the first common key in the cooperation source apparatus, and second information obtained by encrypting the second identification information with the second common key in the cooperation destination apparatus. It is possible to access the cooperation device that stores the unique information, the cooperation identification information common to the first identification information and the second identification information in association with each other, and the cooperation source device, and the second identification information and the attribute The cooperation destination device comprising storage means for storing an attribute table in association with information,
A receiving step of receiving an attribute acquisition request including the second unique information obtained by the cooperation source device from the cooperation device from the cooperation source device;
A generating step of generating the second identification information by decrypting the second unique information included in the attribute acquisition request received by the receiving step with the second common key;
A search step of searching for the attribute information associated with the second identification information generated by the generation step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
The cooperation method characterized by performing this.

101 cooperation source device 102 cooperation destination device 103 cooperation device 700 storage unit 701 reception unit 702 creation unit 703 retrieval unit 704 generation unit 705 transmission unit 800 storage unit 801 designation unit 802 reception unit 803 generation unit 804 first transmission unit 805 first Reception unit 806 second transmission unit 807 second reception unit 900 storage unit 901 reception unit 902 generation unit 903 creation unit 904 setting unit 905 reception unit 906 conversion unit 907 decoding unit 908 determination unit 909 search unit 910 transmission unit

Claims (7)

A collaboration device that links information between the collaboration source device and the collaboration destination device,
First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. Storage means for associating and storing the associated second identification information, the cooperation identification information common to the first identification information and the second identification information,
Receiving means for receiving the first specific information from the cooperation source device;
Search means for searching the second unique information associated with the first unique information received by the receiving means from the storage means via the cooperation identification information;
Encrypted connection information obtained by encrypting connection information obtained by concatenating date information related to the cooperation identification information to the second unique information searched by the search means using a public key related to the cooperation destination device, wherein the cooperation destination device Encryption that is decrypted with a secret key related to the cooperation destination device, and judges validity of the second unique information included in the connection information based on the date information included in the decoded connection information Transmitting means for transmitting link information to the cooperation source device;
The cooperation apparatus characterized by comprising. First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. A cooperation source device that is accessible to a cooperation device that associates and stores second unique information, cooperation identification information common to the first identification information and the second identification information, and the cooperation destination device; ,
Designating means for designating the first identification information;
Generating means for generating the first unique information by giving the first identification information specified by the specifying means to the first one-way function;
First transmission means for transmitting an acquisition request for the second specific information including the first specific information generated by the generation means to the cooperation device;
As a result of the acquisition request of the second unique information being transmitted to the cooperation device by the first transmission means , connection information in which date information related to the cooperation identification information is linked to the second unique information searched by the cooperation device. The encrypted connection information encrypted with the public key related to the cooperation destination device, the date information included in the decoded connection information decrypted by the cooperation destination device using the secret key related to the cooperation destination device Based on the first receiving means for receiving from the cooperation device encrypted connection information for determining the validity of the second unique information included in the connection information ;
Second transmission means for transmitting an attribute acquisition request including the encrypted connection information received by the first reception means to the cooperation destination device;
As a result of transmitting the attribute acquisition request to the cooperation destination device by the second transmission unit, the attribute acquisition request is specified from a reverse lookup table that associates the second unique information and the second identification information in the cooperation destination device. Second receiving means for receiving attribute information associated with the second identification information from the cooperation destination device;
The cooperation origin apparatus characterized by providing. First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. A cooperation device that is accessible to a cooperation device that associates and stores second unique information, cooperation identification information common to the first identification information and the second identification information, and the cooperation source device; ,
Storage means for storing an attribute table in which the second identification information is associated with the attribute information;
The encrypted concatenation information obtained by encrypting the concatenation information obtained by concatenating the date information related to the cooperation identification information with the second unique information with the public key related to the cooperation destination device from the cooperation source device that has received from the cooperation device. Receiving means for receiving an attribute acquisition request including information;
Decryption means for decrypting the encrypted connection information included in the attribute acquisition request received by the reception means with a secret key related to the cooperation destination device;
Determination means for determining the validity of the second unique information included in the connection information based on the date information included in the connection information decoded by the decoding means;
Conversion means for converting the second specific information contained in the concatenated information decoded by the decoding means into the second identification information based on the determination result determined by the determination means;
Search means for searching for the attribute information associated with the second identification information converted by the conversion means with reference to the attribute table;
Transmitting means for transmitting the attribute information searched by the searching means to the cooperation source device;
The cooperation destination apparatus characterized by comprising. First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. In a cooperation apparatus provided with a storage unit that associates and stores second unique information, cooperation identification information common to the first identification information and the second identification information,
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
Encrypted connection information obtained by encrypting connection information obtained by concatenating date information related to the cooperation identification information with the second unique information searched in the search step using a public key related to the cooperation destination device, wherein the cooperation destination device Encryption that is decrypted with a secret key related to the cooperation destination device, and judges validity of the second unique information included in the connection information based on the date information included in the decoded connection information A transmission step of transmitting connection information to the cooperation source device;
A cooperative program characterized by running First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. In the cooperation source device accessible to the cooperation device that associates and stores the second unique information, the cooperation identification information common to the first identification information and the second identification information, and the cooperation destination device,
A designation step for designating the first identification information;
Generating the first unique information by giving the first identification information designated by the designation step to the first one-way function;
A first transmission step of transmitting an acquisition request for the second specific information including the first specific information generated by the generation step to the cooperation device;
As a result of the acquisition request for the second unique information being transmitted to the cooperation device in the first transmission step , connection information in which date information related to the cooperation identification information is linked to the second unique information searched by the cooperation device. The encrypted connection information encrypted with the public key related to the cooperation destination device, the date information included in the decoded connection information decrypted by the cooperation destination device using the secret key related to the cooperation destination device A first receiving step of receiving, from the cooperation device, encrypted connection information for determining the validity of the second unique information included in the connection information ;
A second transmission step of transmitting an attribute acquisition request including the encrypted connection information received by the first reception step to the cooperation destination device;
As a result of the attribute acquisition request being transmitted to the cooperation destination device in the second transmission step, the attribute acquisition request is specified from a reverse lookup table that associates the second unique information in the cooperation destination device with the second identification information. A second receiving step of receiving attribute information associated with the second identification information from the cooperation destination device;
A cooperative program characterized by running First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. Accessing the second unique information, the first identification information and the cooperation identification information common to the second identification information in association with each other, and the cooperation source device, the second identification information, In the cooperation destination device comprising storage means for storing an attribute table that associates attribute information,
The encrypted concatenation information obtained by encrypting the concatenation information obtained by concatenating the date information related to the cooperation identification information with the second unique information with the public key related to the cooperation destination device from the cooperation source device that has received from the cooperation device. A receiving step for receiving an attribute acquisition request including information;
A decryption step of decrypting the encrypted connection information included in the attribute acquisition request received by the reception step with a secret key related to the cooperation destination device;
A determination step of determining the validity of the second unique information included in the connection information based on the date information included in the connection information decoded by the decoding step;
A conversion step of converting the second unique information contained in the concatenated information decoded by the decoding step into the second identification information based on the determination result determined by the determination step;
A search step of searching for the attribute information associated with the second identification information converted by the conversion step with reference to the attribute table;
A transmission step of transmitting the attribute information searched by the search step to the cooperation source device;
A cooperative program characterized by running First unique information obtained by giving the first identification information to the first one-way function in the cooperation source device, and obtained by giving the second identification information to the second one-way function in the cooperation destination device. A linkage apparatus comprising a storage unit that stores second unique information, linkage identification information common to the first identification information and the second identification information in association with each other,
A receiving step of receiving the first specific information from the cooperation source device;
A search step of searching the storage unit for the second unique information associated with the first unique information received by the receiving step via the cooperation identification information;
Encrypted connection information obtained by encrypting connection information obtained by concatenating date information related to the cooperation identification information with the second unique information searched in the search step using a public key related to the cooperation destination device, wherein the cooperation destination device Encryption that is decrypted with a secret key related to the cooperation destination device, and judges validity of the second unique information included in the connection information based on the date information included in the decoded connection information A transmission step of transmitting connection information to the cooperation source device;
The cooperation method characterized by performing this.

Images