JP4512449B2 - Bulk type time authentication request program, bulk type time authentication request recording medium, verification apparatus, verification method, verification program, and verification recording medium - Google Patents

Description

  The present invention applies to a service for stamping digital data such as a digital document, when the digital data is not changed after the time stamp is pressed and the time stamp is indeed pressed. With respect to a time authentication method that makes it possible to prove that digital data existed, in particular, a new hash value is created from hash values of a plurality of entries as an electronic folder or electronic file, and the 1 The present invention relates to BULK type time authentication for making a time authentication request to a time certification authority using two hash values as time authentication certification targets.

  For example, a dated research note can be used as proof of priority under the patent system based on prior inventions in the United States, and a dated household account book can be used as a record of expenditure in a final return. It is known that it can be used. On the other hand, as personal computers are used on a daily basis, it has become very common to perform daily records such as research notes and household accounts using a personal computer.

  However, since the document etc. by the electric and digital recording on such a personal computer can be easily rewritten, the recording contents including the recording date and time are different from the recording written using the paper as the recording medium. Has been unable to prove to a third party. Therefore, conventionally, the TSA (Time-Stamp Authority) performs a time authentication service for issuing a time authentication certificate, thereby solving the problem of time certification of digital data.

  Furthermore, in recent years, as shown in FIG. 28, the user (the former) has the TSA (second party) create a time authentication certificate for the digital data that is the subject of time authentication, When it is necessary to prove the validity of the time authentication certificate to the other party (丙), the validity of the certificate is verified by TTP (Trusted Third Party) (Ding). By requesting, it became possible to resolve disputes more quickly. In this case, the user (the former) makes a time authentication request from the user terminal 210 to the time authentication device 2 of the TSA (B) via the communication network 5, and creates a time authentication certificate in the time authentication device 2. It transmits to the user terminal 210. When the user (the former) needs to prove the validity of the time authentication certificate with the disputed party (係), the TTP ( The time verification verification request is made to the verification device 240, and the verification device 240 verifies the validity, and transmits the verification result to the user terminal 110 and the disputer terminal 3.

  Furthermore, recently, a user (class A) has digital data g1, g2,... Gn (n is a positive number, hereinafter, a plurality of files included in a specific electronic folder f of a computer (computer) file system. A time authentication method has been proposed in which the generic name is “g”) and time authentication certificates are collectively acquired (see Patent Document 1). This method is called a bulk type time authentication method because of the bulk meaning “lumps”.

  Here, the conventional bulk type time authentication method will be described with reference to FIG. FIG. 29 is a diagram showing the relationship between the appearance subjects, the communication infrastructure, and the configuration of each device in the conventional bulk time authentication method.

  As shown in FIG. 29, the user (the former) is a person who creates the digital data G and requests the TSA (second party) to create a time authentication certificate. The user terminal 110 such as a personal computer can communicate with the communication network. 5, a time authentication request can be made to the time authentication device 2 of TSA (B). TSA (B) is a person who creates a time authentication certificate based on Japan Standard Time t acquired via the time infrastructure 6. The disputed party (丙) is one of the parties with whom the user (I) contends for the date and time of creation of his / her digital data, and the user terminal 110 or the time via the communication network 5 from the contender terminal 3 such as a personal computer. A digital data transmission request can be sent to the authentication device 2. TTP (Ding) is a trusted third-party organization that has neutrality and objectivity, and verifies the validity of the time authentication certificate in order to help resolve the dispute between the user (A) and the disputed party (I). The verification device 140 receives a time certificate verification request from the user terminal 110 via the communication network 5 by the verification device 140 and verifies the validity of the time authentication certificate, and also verifies the verification result via the communication network 5. It can be transmitted to the user terminal 110 or the contender terminal 3.

  Next, the user terminal 110, the time authentication device 2, and the verification device 140 will be described. The user terminal 110 stores a time authentication request program for causing the user terminal 110 to function as each unit shown in FIG. Further, the time authentication device 2 stores a time authentication program for causing the time authentication device 2 to function as each unit shown in FIG. Further, the verification device 140 stores a validity verification program for causing the verification device 140 to function as each unit shown in FIG.

  Further, the user terminal 110 executes the above time authentication request program, thereby, as shown in FIG. 29, a hash value creating unit 111, a hash value combining unit 112, an integrated hash value creating unit 113, and a transmission / reception unit. 114.

  First, the hash value creating unit 111 calculates a hash function h1 for each of a plurality of digital data g in the folder f to be certified for time authentication among the digital data G such as text information, image information, and audio information. By applying, each hash value h1 (g1), h1 (g2),..., H1 (gn) (hereinafter referred to as “h1 (g)” when these are collectively expressed) can be created. . This hash value is also called an alias “digest”. The purpose of creating such a hash value h1 (g) is to convert indefinite length data such as digital data g according to a predetermined procedure, and to obtain a hash value h1 (g) of a certain length (for example, 20 bytes). In order to improve the efficiency of calculation and transmission by signing the hash value of the digital data g instead of signing the digital data g. The conditions for a secure hash function are that it is difficult to estimate the input from the hash value and that the probability that the hash values of two different digital data match is extremely small. For example, there are MD5, SHA-1, etc. as hash functions. The hash function is widely distributed as a C language library and the like, and since the specification is open to the public, each person can relatively easily program it. This hash function needs to be agreed between the sender and receiver of the hash value by operating according to the published specifications.

  Next, the hash value combining unit 112 obtains the following expression as a result of combining the plurality of hash values h1 (g) created by the hash value creating unit 11 by concatenating them.

h1 (g1) ‖h1 (g2) ‖ ・ ・ ・ ‖h1 (gn)
Here, the concatenation of hash values means that the hash values are simply connected as a byte string. For example, concatenating 20-byte hash values h1 (g1) and h1 (g2), respectively, gives a total of 40-byte bytes. The first 20 bytes are the same as h1 (g1), and the second 20 bytes are the same as h1 (g2). It is a simple sequence of bytes that can be

  Next, the integrated hash value creating unit 113 applies the integration hash function h2 to the entire combined result obtained by the hash value combining unit 112 to obtain an integrated hash value of the following expression.

h2 (h1 (g1) ‖h1 (g2) ‖ ・ ・ ・ ‖h1 (gn))
In addition, in order to express this integrated hash value in a simplified manner, it is represented by “d” below.

  Next, as shown in FIG. 30, the user (the former) transmits the integrated hash value d from the user terminal 110 to the TSA (second) time authentication device 2 via the communication network 5, thereby performing time authentication. A request is made (step S101).

  On the other hand, the time authentication apparatus 2 has a transmission / reception means 21, a time acquisition means 22, a time authentication means 23, and a digital signature creation means 24 as shown in FIG. 29 by executing a time authentication program. Yes.

  First, the transmission / reception means 21 receives the integrated hash value d transmitted from the user terminal 110 via the communication network 5. In addition, the time acquisition unit 22 acquires Japan Standard Time t from the time infrastructure 6.

  Next, the digital signature creation unit 23 combines the data of the integrated hash value d received by the transmission / reception unit 21 with the time t acquired by the time acquisition unit 22 and the predetermined additional information, thereby signing the signature target digital in the time authentication certificate.・ Data TSTI (d, t) is created, and a digital signature sig (SK, TSTI (d, t)) is created for this digital data to be signed. This digital signature sig (SK, TSTI (d, t)) represents a digital signature for the digital data TSTI (d, t) with the signature key (secret key) SK of TSA (O).

  Next, the time authenticating means 24 performs time authentication including the signature target digital data TSTI (d, t) including the integrated hash value d and time t and the digital signature sig (SK, TSTI (d, t)). Create certificates TST (sig (SK, TSTI (d, t)), TSTI (d, t)). The time authentication certificate TST (sig (SK, TSTI (d, t)), TSTI (d, t)) indicates the time authentication certificate as signed digital data. Thereby, as shown in FIG. 30, the TSA (B) sends the time authentication certificate TST (sig (SK, TSTI (d, t))) from the time authentication device 2 to the user terminal 110 of the user (the former). , TSTI (d, t)), a time proof response is made (step S102).

  Further, the verification apparatus 140 has a transmission / reception unit 141 and a verification unit 142 as shown in FIG. 29 by executing the verification program. The signing key SK and the public key PK paired with the signing key SK are known to TTP (Ding) by some means.

Then, when it becomes necessary for the user (the former) to prove the time proof of the digital data g to the disputed party (丙), as shown in FIG. 30, the user (the former) By transmitting the folder f [g] storing a plurality of digital data g to be proved and the time authentication certificate TST1 to the verification device 140 of the TTP (Ding) from the terminal 110 via the communication network 5, A time certification verification request is made (step S103).

  Next, in the verification device 140, the transmission / reception unit 141 receives the folder f [g] and the time authentication certificate TST 1 and stores them in the verification storage unit 149. The verifying unit 142 further includes an integrated hash value recalculating unit 143, a digital signature verifying unit 144, and an integrated hash value comparing unit 145, and each unit performs verification in the following procedure.

First, as an input object at the time of verification, the name fn of the folder f [g], the digital data g included in the folder f [g], and the time authentication certificate already acquired for the folder f [g]. When the certificate TST1 is input, the integrated hash value recalculating unit 143 reads the digital data g corresponding to the name fn of the folder f [g] from the verification storage unit 149, and the user terminal 110 integrates the integrated hash value. The integrated hash value d ′ is calculated again by the same procedure as that for creating d.

  Next, the digital signature verification means 144 extracts the digital data TSTI (d, t) to be signed and the digital signature sig (SK, TSTI (d, t)) from the time authentication certificate TST1, and verifies the public verification key. It is verified that the digital signature sig (SK, TSTI (d, t)) is made for the digital data to be signed TSTI (d, t) using PK.

  Next, the integrated hash value comparison unit 145 compares the recalculated integrated hash value d ′ with the hash value d extracted from the digital data TSTI (d, t) for time authentication, and d ′ = It is verified whether or not d. In this case, since the format of the digital data to be signed TSTI (d, t) is fixed, d can be extracted from TSTI (d, t). As a result, if d ′ = d holds, “valid (OK)” is output as the detection result, and if d ′ = d does not hold, “unauthorized (NG)” is output as the detection result.

As described above, according to the conventional bulk type time authentication method, a single time authentication certificate TST (sig (SK, TSTI (d, t)), By requesting TSTI (d, t)), a single time authentication certificate can be issued by TSA (O), and the user (Class A) can also issue a single time authentication certificate TST (sig (SK , TSTI (d, t)), TSTI (d, t)) can be managed.
JP 2001-142398 A

  However, in the conventional bulk type time authentication method, it is necessary to prove to a third party the validity of a time authentication certificate related to one or more specific digital data among a plurality of digital data to be certified. In this case, not only the information related to the specific digital data but also the entire digital data must be presented to a third party, and the information that is not necessarily required for time certification of the specific digital data There was a problem of having to present to the three parties.

  The present invention has been made in view of the above-described circumstances. The validity of a time authentication certificate related to one or more specific digital data is determined by using a bulk time authentication method for a time certification service for digital data. To provide an invention for preventing information that is not necessarily required for time certification of one or more specific digital data from being presented to a third party when it becomes necessary to prove to three parties For the purpose.

In order to achieve the above object, the invention according to claim 1 creates a new hash value from the hash values of a plurality of entries as an electronic folder or electronic file, and the user uses the one hash by the user terminal. A bulk type time authentication request program for making a time authentication request to a time certification authority with a value as a certification target of time authentication, wherein the computer as the user terminal is defined for each entry and is included in the entry Each of the plurality of entries is provided with a function management unit that manages an entry hash function to be applied and a summary file hash function to be applied to the summary file, and a file management unit that manages the summary file. By applying the entry hash function managed by the function management means, each entry has a hash function. A hash value creating means for creating a queue value, and a summary file expression for creating a summary file expression for each entry by associating a hash value of each entry created by the hash value creating means with an identifier for identifying each entry. A summary file created as a result of combining the summary file expressions by the creating means, the summary file expression synthesizing means for combining the summary file expressions for each entry created by the summary file expression creating means, Pre-filter means for shielding desired information in advance, summary file storage means for storing a summary file shielded by the pre-filter means in the file management means, and a shielded summary file to be stored in the file management means Tube with the function management means The summary file hash value creating means for creating the hash value of the shielded filtered summary file by applying the hash function for the summary file that is being operated, causes the computer to function, thereby hashing the filtered summary file This is a bulk type time authentication request program for enabling a time certification request to a time certification authority using a value as a certification target for time certification.

  Here, the “program” refers to an ordered sequence of instructions suitable for processing by a computer, such as those installed in a computer HD (Hard Disk), CD-RW, etc. Those recorded on various recording media such as ROM, DVD, FD, semiconductor memory, and computer HDD, and those distributed via a communication network are also included (the same applies hereinafter).

  Further, the “electronic folder” includes an electronic subfolder that is another electronic folder included in a certain electronic folder (hereinafter the same).

  The invention according to claim 2 is the bulk type time authentication request program according to claim 1, wherein the function management unit manages a hash function for a secondary summary file to be applied to a secondary summary file. , When a plurality of types of filtered summary files are created by the pre-filter means, the filtered summary files are viewed as entries and a secondary summary file that is a summary file different from the summary file is created. In place of the secondary summary file creation means and the summary file hash value creation means, the secondary summary file managed by the function management means for the secondary summary file created by the secondary summary file creation means A secondary that creates a hash value of the secondary summary file by applying a hash function And Mali file hash value generating means is a bulk type time authentication requesting program for causing to function on the computer.

  The invention according to claim 3 is a computer-readable recording medium on which the bulk type time authentication request program according to claim 1 or 2 is recorded.

  Here, the “recording medium” is only required to be able to be used for reading a program for causing the above-mentioned means to function on a computer, such as how information is recorded using physical characteristics of the medium. It does not depend on the physical recording method. For example, FD (Flexible Disk), CD-ROM (R, RW) (Compact Disc Read Only Memory (CD Recordable, CD Rewritable)), DVD-ROM (RAM, R, RW) (Digital Versatile Disk Read Only Memory (DVD) Random Access Memory, DVD Recordable, DVD Rewritable)), semiconductor memory, MO (Magneto Optical Disk), MD (Mini Disk), magnetic tape, etc. (hereinafter the same applies).

  According to a fourth aspect of the present invention, a new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and a user authenticates the one hash value by a user terminal for time authentication. A verification device for verifying the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority by making a time authentication request to the time certification authority as the user terminal When performing a time authentication request to the time certification authority using the hash value of the filtered summary file as a certification target of time authentication by executing the bulk type time authentication request program according to claim 1, Verification by acquiring and managing multiple entries, summary files created on the user terminal, and time authentication certificate data The management means, the function management means for managing the entry hash function applied to the entry and the summary file hash function applied to the summary file, and the time authentication certificate managed by the verification management means have been altered. Correctness verification means for verifying correctness, and entry hashes managed by the function management means for a plurality of entries managed by the verification management means A summary file expression that constitutes a hashed value recalculating unit that recalculates a hash value of each entry by applying a function, and a filtered summary file in which desired information is previously blocked by the prefiltering unit according to claim 1 A hash value acquisition means for acquiring the hash value of the corresponding original entry in the file, and the hash value recalculation means A hash value comparison means for comparing whether or not the hash value of the entry recalculated and the hash value acquired by the hash value acquisition means match, and a summary managed by the verification management means Summary file hash value recalculation means for recalculating the hash value of the filtered summary file by applying a hash function for the summary file managed by the function management means to the file, and the verification management means Summary file hash value acquisition means for acquiring the hash value of the original filtered summary file included in the managed time authentication certificate, and the hash of the filtered summary file recalculated by the summary file hash value recalculation means Value and the original filtered summary acquired by the summary file hash value acquisition means And a summary file hash value comparing means for comparing whether or not the hash values of the files match each other.

  The invention according to claim 5 is the verification apparatus according to claim 4, wherein the user terminal executes the bulk time authentication request program according to claim 2, thereby executing a secondary summary file. When a time authentication request is made to the time certification authority with the hash value of time authentication as a certification object of time authentication, the hash function for the secondary summary file to be applied to the secondary summary file is managed by the function management means. In the hash value acquisition means, a summary file expression constituting a specified filtered summary file among a plurality of types of filtered summary files in which desired information is previously shielded by the pre-filter means according to claim 2. The hash value of the corresponding original entry in the file is obtained, and the summary file hash value obtaining means obtains the secondary sum. Obtaining a hash value of a specified filtered summary file in the plurality of types of filtered summary files from a refile; and further, the summary file hash value recalculating means, the summary file hash value obtaining means, and In the verification apparatus, the summary file hash value comparison unit can process a secondary summary file in addition to a specified filtered summary file among a plurality of types of filtered summary files. .

In the invention according to claim 6, a new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user uses the user terminal to obtain the one hash value as a certification object for time authentication. A verification device for verifying the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority by making a time authentication request to the time certification authority as the user terminal Is defined for each entry and applies to the entry hash function and summary file hash function applied to the summary file, terminal function management means for managing the summary file, file management means for managing the summary file, Applying an entry hash function managed by the terminal function management means to each of a plurality of entries A hash value creation means for creating a hash value for each entry, and a hash value creation means for each entry are created by associating the hash value for each entry created by the hash value creation means with an identifier for identifying each entry. Summary file expression creation means, summary file expression composition means for combining summary file expressions for each entry created by the summary file expression creation means, and summary created as a result of combining summary file expressions by the summary file expression composition means A summary file storage means for storing a file in the file management means; and a summary file hash function managed by the terminal function management means for the summary file stored in the file management means to apply the summary file Create a hash value for A summary file hash value creation means, and a verification management means for acquiring and managing the data of the plurality of entries, the summary file created at the user terminal, and the time authentication certificate. The function management means for managing the entry hash function applied to the entry and the summary file hash function applied to the summary file, and the time authentication certificate managed by the verification management means are not altered and correct. Validity verification means for verifying this, and applying the entry hash function managed by the function management means to a plurality of entries managed by the verification management means A hash value recalculating means for recalculating the hash value of each entry, and a summary file managed by the verification managing means. A post-filter unit that shields the desired information of the file later, a hash value acquisition unit that acquires a hash value of a corresponding original entry in the summary file expression that constitutes the summary file shielded by the post-filter unit, Managed by the hash value comparison means for comparing whether or not the hash value of the entry recalculated by the hash value recalculation means and the hash value acquired by the hash value acquisition means match, and the verification management means A summary file hash value recalculation unit that recalculates a hash value of the summary file by applying a hash function for the summary file managed by the function management unit to the summary file, and the verification file Get the hash value of the original summary file included in the time authentication certificate managed by the management means Whether the hash value of the summary file recalculated by the summary file hash value acquisition unit and the summary file hash value recalculation unit matches the hash value of the original summary file acquired by the summary file hash value acquisition unit. And a summary file hash value comparison means for comparing these.

  The invention according to claim 7 is to create a new hash value from the hash values of a plurality of entries as an electronic folder or electronic file, and the user uses the user terminal to convert the one hash value to a certification object for time authentication. A verification method using a verification device that verifies the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority by making a time authentication request to the time certification authority as When the user terminal executes the bulk time authentication request program according to claim 1, a time authentication request is sent to the time certification authority using the hash value of the filtered summary file as a time authentication certification target. In the case of performing the verification, the verification device includes the plurality of entries, a summary file created by the user terminal, and a time authentication certificate. In a state having verification management means for acquiring and managing data, and function management means for managing the hash function for entry applied to the entry and the summary file hash function applied to the summary file, The verification device verifies that the time authentication certificate managed by the verification management means is correct without being falsified, and a plurality of entries managed by the verification management means. The hash value recalculation step for recalculating the hash value of each entry by applying the entry hash function managed by the function management means to a target to be verified, and the hash value recalculation step according to claim 1 The corresponding original entry in the summary file representation that constitutes the filtered summary file that has previously been occluded by the prefilter means. The hash value acquisition step of acquiring the hash value of the re, and the hash value of the entry recalculated by the hash value recalculation step and the hash value acquired by the hash value acquisition step are compared. The hash value of the filtered summary file by applying the hash function for the summary file managed by the function management unit to the summary file managed by the verification management unit A summary file hash value recalculation step for recalculating, a summary file hash value acquisition step for acquiring a hash value of the original filtered summary file included in the time authentication certificate managed by the verification management means, and The file recalculated in the summary file hash value recalculation step Executing a summary file hash value comparison step for comparing whether or not the hash value of the collected summary file matches the hash value of the original filtered summary file acquired in the summary file hash value acquisition step. Is a verification method characterized by

The invention according to claim 8 is the verification method according to claim 7,
When the user terminal executes the bulk time authentication request program according to claim 2, a time authentication request is made to the time certification authority using the hash value of the secondary summary file as a time authentication certification target. In this case, when the hash function for secondary summary file to be applied to the secondary summary file is managed by the function management unit, the hash value acquisition unit performs the filtering by the pre-filter unit according to claim 2. Obtaining a hash value of the corresponding original entry in the summary file representation comprising the specified filtered summary file among the plurality of types of filtered summary files previously masked with the desired information, and the summary file hash In the value acquisition step, the plural types of filtered summary files are extracted from the secondary summary file. A hash value of the specified filtered summary file in the file, and the summary file hash value recalculation step, the summary file hash value acquisition step, and the summary file hash value comparison step The verification method is characterized in that a secondary summary file can be processed in addition to a specified filtered summary file in the filtered summary file.

According to the ninth aspect of the present invention, a new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user uses the one hash value as a certification object for time authentication. A verification method using a verification device that verifies the validity of the time authentication certificate acquired by the user after acquiring the time authentication certificate by making a time authentication request to the user terminal Is defined for each entry and applies to the entry hash function and summary file hash function applied to the summary file, terminal function management means for managing the summary file, file management means for managing the summary file, By applying the entry hash function managed by the terminal function management means to each of the plurality of entries, A hash value creating means for creating a hash value of a bird; a summary for creating a summary file expression for each entry by associating a hash value of each entry created by the hash value creating means with an identifier for identifying each entry. Summary file created as a result of combining summary file expressions by file summary creation means, summary file expression synthesis means for combining summary file expressions for each entry created by the summary file expression creation means, and summary file expression synthesis means The summary file storage means for storing the summary file in the file management means , and applying the summary file hash function managed by the terminal function management means to the summary file stored in the file management means. A summer that creates a hash value File hash value creation means, and the verification device acquires and manages the data of the plurality of entries, the summary file created at the user terminal, and the time authentication certificate And a function management means for managing a hash function for an entry to be applied to the entry and a summary file to be applied to the summary file. Validity verification step for verifying that the time authentication certificate is correct and not falsified, and the function management for a plurality of entries managed by the verification management means to be verified A hash value recalculation step of recalculating the hash value of each entry by applying a hash function for entries managed by the means; A post-filtering step for later shielding desired information of the summary file managed by the certificate management means, and a hash of the corresponding original entry in the summary file expression constituting the summary file shielded by the post-filtering step A hash value for comparing whether or not the hash value of the entry recalculated by the hash value recalculation step and the hash value acquired by the hash value acquisition step are the same. A summary step for recalculating the hash value of the summary file by applying the summary file hash function managed by the function management unit to the summary file managed by the verification management unit Manage the file hash value recalculation step and the verification management means A summary file hash value acquisition step for acquiring a hash value of the original summary file included in the time authentication certificate, a hash value of the summary file recalculated in the summary file hash value recalculation step, and the summary file hash value acquisition step And a summary file hash value comparison step for comparing whether or not the hash value of the original summary file acquired in (1) is the same.

  An invention according to claim 10 is a verification program characterized by causing the verification apparatus according to claim 7 to execute the steps according to claim 7.

  The invention according to claim 11 is a verification program characterized by causing the verification apparatus according to claim 8 to execute each step according to claim 8.

  An invention according to claim 12 is a verification program characterized by causing the verification apparatus according to claim 9 to execute each step according to claim 9.

  A thirteenth aspect of the invention is a computer-readable recording medium for verification, wherein the verification program according to any one of the tenth to twelfth aspects is recorded.

  As described above, according to the present invention, the bulk type time authentication method is adopted by filtering (shielding) only desired information (for example, information that is not desired to be disclosed to a third party) in the summary file. However, there is an effect that it is not necessary to present to the disputed party information that is not necessarily required for time certification of specific digital data.

  First, before describing the best mode for carrying out the present invention (hereinafter referred to as “embodiment”), the invention which is the premise invented by the inventor in the course of deriving the present invention (hereinafter referred to as “premise invention”) The summary file will be described with reference to FIGS. This prerequisite invention is also disclosed in Japanese Patent Application No. 2003-321966.

[First Premise Invention]
The bulk time authentication method according to the first premise invention will be described below with reference to FIGS. FIG. 1 is a diagram showing the relationship between the appearance subjects, the communication infrastructure (Infrastructure), and the configuration of each device in the present invention. As shown in FIG. 1, the user (A) is a person who requests TSA (B) to create a time authentication certificate for an electronic folder or file as a certification target of time authentication, such as a personal computer. The user terminal 1a can make a time authentication request to the TSA time authentication apparatus 2 via the communication network 5. TSA (Otsu) is a person who creates the time authentication certificate TST1 based on the Japan Standard Time t acquired through the time infrastructure 6. However, a time authentication certificate may be created using a unique time source without acquiring Japan Standard Time t.

  In the following, an electronic folder or electronic file as a certification object of time authentication is referred to as “entry”. In this case, an electronic folder includes an electronic subfolder that is another electronic folder included in a certain electronic folder. included. This entry is derived from entry as a certification subject of time authentication. The electronic file is represented as “file”, the electronic subfolder is represented as “subfolder”, and the electronic file is represented as “file”. Each digital data is stored for each file.

  A general term of a concept in the case where either a file or a folder may be indicated or in the case where both are indicated is represented as “entry e”. When each entry e is shown, it is represented as entries e1, e2,..., En (n is a positive number).

  In particular, when the entry e is a folder, the entry is generically represented as “entry eF”, when the entry e is a subfolder, the generic designation is “entry es”, and when the entry e is a file, the generic designation is “entry ef”. It expresses.

  In this case, the entries es1, es2,... Esn (n is a positive number) are shown when the entries es related to the subfolders are respectively shown, and the entries ef1, ef2 are shown when the entries ef related to the files are shown respectively. ,... Efn (n is a positive number).

The disputed party (丙) is one of the parties that the user (I) contends with regarding the creation date and time of his / her own digital data, and the user terminal 1a or time via the communication network 5 from the contender terminal 3 such as a personal computer. A digital data transmission request can be sent to the authentication device 2.

  TTP (Ding) is a trusted third-party organization that has neutrality and objectivity, and verifies the validity of the time authentication certificate in order to help resolve the dispute between the user (A) and the disputed party (I). The verification device 4a receives a time certification verification request from the user terminal 1a via the communication network 5 by the verification device 4a, verifies the validity of the time authentication certificate, and verifies the verification result via the communication network 5. Can be transmitted to the user terminal 1a or the disputer terminal 3. Note that the user (the former) records the data necessary for the time certification verification request on a recording medium such as a CD-R without using the user terminal 1a, and brings it to the TTP (cutter) or by mailing it. Data necessary for the time certification verification request may be passed.

  Next, the user terminal 1a, the time authentication device 2, and the verification device 4a will be described. The user terminal 1a stores a time authentication request program (p1a) for causing the user terminal 1a to function as each means shown in FIG. Further, the time authentication device 2 stores a time authentication program (p2) for causing the time authentication device 2 to function as each means shown in FIG. Further, the verification device 4a stores a validity verification program (p4a) for causing the verification device 4a to function as each unit shown in FIG.

  Further, the user terminal 1a as a computer executes the time authentication request program (p1a), thereby, as shown in FIG. 1, the entry designation means 17, the summary file creation means 11, the summary file storage means 12, the summary. The file hash value creation means 14 and the transmission / reception means 15 are provided.

  Further, the summary file creation means 11 includes a hash value creation means 11a, a hash value combination means 11b, an integrated hash value creation means 11c, a summary file expression creation means 11d, and a summary file expression synthesis means 11e.

  Further, a function management means 18 and a file management means 19 are constructed in an unillustrated HD (Hard Disk) in the user terminal 1a.

Further, the function management means 18 applies a file hash function h1 _ef (hereinafter referred to as “hash function h1 _ef ”) for calculating a hash value h1 _ef (ef) applied to the entry ef related to the file, Integration hash function h2 _eF (hereinafter referred to as “hash function h2 _eF ”) for calculating the integrated hash value of the entry eF, and integration hash function h2 _es for calculating the integrated hash value of the entry es related to the subfolder (Hereinafter referred to as “hash function h2 _es ”), and a hash function h3 _eF for the summary file for calculating the hash value h3 _eF (SF) of the summary file applied to the summary file SF (hereinafter referred to as “hash function h3”). _eF ") is stored and managed. The file hash function h1 _ef , the integration hash function h2 _eF, and the integration hash function h2 _es are examples of entry hash functions.

_Further , there are MD5, SHA-1, etc. as the hash functions h1 _ef , h2 _eF , h2 _es , h3 _eF . Also, the hash functions h1 _ef , h2 _eF , h2 _es , and h3 _eF may all be the same, may be different, or some of them may be the same. . Among these, h3 _eF is a function that inputs a summary file and outputs its hash _value.If the summary file is written in a markup language that expresses the structure without ambiguity, h3 _eF May treat summary files as digital data such as byte sequences and apply hash functions such as MD5 and SHA-1 that are applied to such digital data, or may be represented by a summary file After the extracted structure is extracted and some conversion based on the structure is performed, the conversion result is treated as digital data such as a byte sequence, and the above hash function such as MD5, SHA-1, etc. applied to such digital data May be applied. As an example of such conversion, there is a method of extracting one or more specific fields in the summary file. The hash value is also referred to as an alias “digest”. In FIG. 6, it is expressed as <digest>.

  Further, the function management means 18 includes a folder summary for creating summary file expressions SFR (eF) and SFR (es) based on the entries eF and es among the summary file expressions SFR constituting the summary file SF. File representation creation function FolderSfRep is stored and managed.

This folder summary file expression creation function FolderSfRep first creates a file summary for creating a summary file expression SFR (ef) based on the entry ef of the files among the summary file expressions SFR constituting the summary file SF. The file expression creation function FileSfRep has a function of applying to each entry ef, and a plurality of summary file expressions SFR (ef) created thereby are synthesized to result in a summary file expression SFR constituting the summary file SF. It has a function to apply the ComposeSFR summary file expression synthesis function for completion.

  If the subfolder exists, the folder summary file expression creation function FolderSfRep is recursively applied to the subfolder in order to create the summary file expression SFR (es) based on the entry es related to the subfolder. In this case, when the summary file representation SFR (eF) based on the entry eF is finally created, the summary file representation synthesis function ComposeSFR is created by the folder summary file representation synthesis function FolderSfRep. The summary file representation SFR (es) or (2) a combination of the summary file representation SFR (es) and the summary file representation SFR (ef) created by the file summary file representation creation function FileSfRep.

  Next, the entry specifying means 17 is based on the identifier Id (e) or the path name epn of the entry e input by the user (the former) among the digital data G related to the plurality of files and the plurality of folders. It has a function of designating entries (e1, e2,..., En) to be certified for time authentication. The plurality of files and the plurality of folders are stored on the HD of the user terminal 1a, recorded on a recording medium such as an external CD-R, or transmitted via a communication network such as the Internet. There are cases where it comes.

Further, the hash value creation means 11a reads the hash function h1 _ef from the function management means 18, and applies the hash function h1 _ef to each entry ef related to the file designated by the entry designation means 17, thereby It has a function of creating a hash value h1 _ef (ef) for each entry ef. For the entry ef stored in the entry es related to the subfolder, the hash value h1 _ef (ef) is created by the hash value creation unit 11a.

Further, the hash value combining means 11b includes an entry identifier Id (ef), each hash value h1 _ef (ef) created by the hash value creating means 11a, and the name of a hash algorithm (algorithm) such as MD5. The additional information α1, α2,..., Αn (n is a positive number; hereinafter, the generic name thereof is expressed as “α”), and in accordance with a predetermined ordering rule, Has the function of rearranging.

Id (ef1) ‖h1 _ef1 (ef1) ‖α1,
Id (ef2) ‖h1 _ef2 (ef2) ‖α2,
...
Id (efn) ‖h1 _efn (efn) ‖αn
The ordering rule may be determined according to a lexicographic order based on the identifier Id (ef) of the entry ef. Further, the additional information α may be empty.

  Further, the hash value combining unit 11b also has a function of generating one digital data by combining the connected series.

Further, the integrated hash value creating unit 11c reads the hash function h2 _eF from the function managing unit 18 and applies it to the value combined by the hash value combining unit 11b, whereby the folder storing the plurality of entries ef is stored. Has a function of creating an integrated hash value of the entry eF according to. The created integrated hash value is as follows.

h2 _eF (Id (ef1) ‖h1 _ef1 (ef1) ‖α1‖Id (ef2) ‖h1 _ef2 (ef2) ‖α2‖
… ‖Id (efn) ‖h1 _efn (efn) ‖αn)
If the entry eF related to the subfolder is stored in the entry eF related to the folder, the above procedure is applied recursively including the subfolder in the concept of the folder, thereby integrating the entries es related to the subfolder. A hash value is created, and then an integrated hash value of the entry eF related to the folder is created.

Next, the summary file expression creation unit 11d reads out the file summary file expression creation function FileSfRep from the function management unit 18 and applies it to each entry ef, so that at least (1) the input proof target folder ( A description language in which the identifier of each file (entry) based on the path name epn of the entry) and (2) the hash value h1 _ef (ef) created by the hash value creation means 11a are described in an unambiguous manner according to a predetermined rule It has a function of creating a summary file expression SFR (ef) described in (a markup language such as XML (Extensible Markup Language)). This summary file representation SFR (ef) is created for each entry ef.

  Here, the file summary file expression creation function FileSfRep is used to obtain a value constituted by an identifier of a file as an argument and HashRep (e), as shown in FIG. Further, HashRep (e) is represented by hash data <hashdata> as shown in FIG. This hash data is represented by a hash algorithm name <algorithm> and a hash value (digest) <digest>. Note that FIG. 4 shows a case where a hash key (hashkey) dedicated to each entry e is not used as in a hash algorithm such as SHA-1 or MD5.

  The case where a hash key dedicated to each entry e is used is shown in FIG. In this case, the hash data further includes an expression of a hash key value <hashkey>. The hash algorithm in this case is HMAC-SHA-1 or HMAC-MD5.

  The summary file expression synthesizing unit 11e reads the summary file expression synthesizing function ComposeSFR from the function management unit 18 and applies it to the summary file expressions SFR (ef) for each file created by the summary file expression creating unit 11d. To synthesize multiple file summary file representations SFR (ef).

Further, the summary file expression creating unit 11d applies at least (1) an identifier of the folder based on the path name epn of the entry e input by the user (former) and (2) the integrated hash to the synthesized value. A function for creating a summary file representation SFR (eF) for a folder expressed in a description language (such as a markup language such as XML) in which the integrated hash value created by the value creating means 11c is described in an unambiguous manner according to a predetermined rule. Have. If the entry eF has a tree structure, it may be a folder summary file representation SFR (eF) reflecting this tree structure, and a new tree structure folder summary completely different from the entry eF tree structure. The file expression SFR (eF) may be used.

  When the entry es related to the subfolder is stored in the entry eF related to the folder, the summary file expression creating unit 11d uses the concept of the folder summary file expression SFR (eF) in the summary file SF as follows. A subfolder summary file representation SFR (es) and a folder summary file representation SFR (es) and a folder summary file representation SFR (eF) are created by a recursive procedure including the subfolder summary file representation SFR (es) based on the entry es related to the subfolder. In this case, the summary file expression synthesizing means 11e treats the created subfolder summary file expression SFR (es) in the same manner as the file summary file expression SFR (ef) and recursively summarizes the file expression synthesis function ComposeSFR. Apply.

  As a result, when the subfolder summary file representation SFR (es) is created by the summary file representation creation means 11d, the summary file representation synthesis means 11e can only synthesize the file summary file representation SFR (ef). In addition, the subfolder summary file representation SFR (es) once created is also included.

  In this case, the synthesis by the summary file expression synthesis unit 11e is rearranged into the following series according to a predetermined ordering rule.

SFR (e1),
SFR (e2),
...
SFR (en)
An example of the ordering rule is to determine according to the lexicographic order based on the identifier of the entry e.

  The summary file expression synthesizing unit 11e creates a summary file SF representing a tree structure by specifically combining the summary file expression SFR (e) by the method described below.

  First, the summary file expression synthesizing unit 11e includes the path name epn of the folder (entry e) input by the user (the former) and each summary file expression SFR created and rearranged by the summary file expression creating unit 11d. A summary file expression synthesis function ComposeSFR is applied to (e) to create a summary file expression SFR (e) based on the entry e. This summary file expression synthesis function ComposeSFR is a predetermined function. For example, when the summary file expression SFR (e) based on the entry e is input, the function can be expressed in the XML format as shown in FIG. It is. However, in FIG. 2, the underlined expression (for example, SFR (e1)) is not the expression itself, that is, the character string represented by the expression is not the character string SFR (e1) itself. It indicates that it is assigned to a place.

  In FIG. 2, the folder name <folder name> based on the path name epn of the input folder, HashRep (e) shown in FIG. 4 or 5 and the summary file expression SFR (e) are shown. ing.

  As described above, the summary file SF1 which is an example of the summary file SF created by the summary file creation unit 11 is shown in FIG. As shown in FIG. 6, the summary file SF1 is composed of additional elements as management information such as a user name <username> and a summary file expression SFR (eF1) based on the entry eF1 related to the folder. . Since the original data is a folder, this summary file representation SFR (eF1) employs the representation method shown in FIG. 2, and HashRep (eF1), summary file representation SFR (es1) based on entry es1, and entry It is composed of summary file representation SFR (ef2) based on ef2.

  Further, since the entry file es1 is a (sub) folder, the summary file expression SFR (es1) adopts the expression method shown in FIG. 2, and the summary file expression SFR (ef2) based on the HashRep (es1) and the entry ef2 is used. It is configured. Further, since the entry ef3 is a file, the summary file expression SFR (ef3) adopts the expression method shown in FIG. 3 and is configured by HashRep (ef3).

  On the other hand, since the entry ef2 is a file, the summary file expression SFR (ef2) adopts the expression method shown in FIG. 3 and is configured by HashRep (ef2).

  As described above, the summary file SF has the following features.

[1] Since it is described in a specific description language such as XML, it is possible to extract the constituent elements and their relationship without ambiguity from this description.

[2] The entry name and the hash data of the entry are associated with each other, and the hash data <hashdata> of the entry e is displayed.

[3] The hash data indicates the hash algorithm <algorithm> used, the calculated hash value <digest>, and in some cases the hash key <hashkey>.

[4] The tree structure is expressed as a text file, and creating the tree structure itself creates a summary file.

  Next, the summary file storage unit 12 shown in FIG. 1 has a function of storing and managing the summary file SF created by the summary file creation unit 11 in the file management unit 19. Then, when there is a dispute about the validity of the disputed partner (と) and the time authentication certificate, the summary file SF managed by the file management means 19 is read out and used for verification of the validity.

Further, the summary file hash value creation means 14 reads the hash function h3 _eF from the function management means 18 and applies it to the completed summary file SF to be stored in the file management means 19, so that the hash value h3 of the summary file is obtained. Create _eF (SF). For convenience of explanation, hereinafter, the hash value h3 _eF (SF) of the summary file is represented by “D”.

  The transmission / reception means 15 has a function for transmitting / receiving information (data) to / from other apparatuses via the communication network 5.

  Next, the time authentication device 2 shown in FIG. 1 will be described. The time authentication apparatus 2 includes a transmission / reception means 21, a time acquisition means 22, a time authentication means 23, and a digital signature creation means 24 as shown in FIG. 1 by executing a time authentication program (p2). Has reached.

  The transmission / reception means 21 has a function for transmitting / receiving information (data) to / from other devices via the communication network 5. Here, the hash value D sent from the user terminal 1a via the communication network 5 is received. The time acquisition unit 22 has a function of acquiring Japan Standard Time t from the time infrastructure 6 when the hash value D is received by the transmission / reception unit 21. An original time source may be used without acquiring Japan Standard Time t.

  Further, as shown in FIG. 9, the digital signature creating means 23 combines the hash value D data received by the transmitting / receiving means 21 with the time t obtained by the time obtaining means 22 and predetermined additional information, The target digital data TSTI (D, t) is used, and a digital signature sig (SK, TSTI (D, t)) is created for the combined whole. The digital signature sig (SK, TSTI (D, t)) represents a digital signature for the digital data TSTI (D, t) using the signature key (secret key) SK of TSA (O).

  Further, the time authenticating means 24 is the digital data to be signed TSTI (D, t) formed by combining the combined hash value D and time t and predetermined additional information, and the generated digital signature sig It has a function of creating a time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) including (SK, TSTI (d, t)). The time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) indicates the time authentication certificate as signed digital data.

  Next, the verification device 4a shown in FIG. 1 will be described.

The verification device 4a has a transmission / reception means 41 and a verification means 42 as shown in FIG. 1 by executing the verification program (p4a). Further, the verification unit 42 includes a validity verification unit 42a, a hash value recalculation unit 42b1, a hash value acquisition unit 42b2, a hash value comparison unit 42b3, a summary file hash value recalculation unit 42c1, a summary file hash value acquisition unit 42c2, and And summary fill hash value comparison means 42c3. Further, a verification management means 48 and a function management means 49 are constructed in the HD (not shown) in the verification apparatus 4a as a computer. The function management means 49 already manages the hash functions h1 _ef , h2 _eF and h3 _eF . The public key PK paired with the signature key SK is known to TTP (Ding) by some means.

  Of the verification device 4 a, the transmission / reception unit 41 has a function of transmitting / receiving information (data) to / from other devices via the communication network 5 and storing and managing the received information in the verification management unit 48. For example, the single or plural entries e sent from the user terminal 1a at the time of the time certification verification request, the summary file SF based on this entry e, and the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) are received and stored in the verification storage means 49.

  Further, the verification unit 42 verifies the validity of the time authentication certificate by the function shown below.

The validity verification means 42a is correct that the time authentication certificates TST (sig (SK, TSTI (D, t)), TSTI (D, t)) managed by the verification management means 48 have not been altered. It has a function to verify. For example, the digital signature sig (SK, TSTI (D) included in the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) managed by the verification management means 48 is used. , t)) is a digital signature for the digital data TSTI (D, t) to be signed included in the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)). Verify that there is.

The hash value recalculating unit 42b1 reads out the verification target entry e from the verification management unit 48 and the hash from the function management unit 49 based on the path name epn of the verification target entry e input by TTP (cutter). The functions h1 _ef and h2 _es are read out and applied to each entry e, thereby recalculating each hash value. This recalculation method is performed in the same procedure as the procedure of creating each hash value by the hash creating unit 11a or the integrated hash value creating unit 11c of the user terminal 1a.

  The hash value acquisition unit 42b2 has a function of acquiring the hash value D1 of the corresponding original entry in the summary file expression SFR (e) constituting the summary file SF managed by the verification management unit 48.

  In the hash value comparison unit 42b3, the hash value D1 ′ of the entry e recalculated by the hash value recalculation unit 42b1 is the same as the hash value D1 of the original entry acquired by the hash value acquisition unit 42b2 (D1 ′ = D1). It has a function to compare whether or not.

The summary file hash value recalculation unit 42c1 applies the summary file hash function h3 _eF managed by the function management unit 49 to the summary file SF managed by the verification management unit 48, thereby _obtaining a summary file. It has a function of recalculating the hash value h3 _eF (SF) of the SF.

  Hereinafter, the hash value obtained by recalculation by the summary file hash value recalculation unit 42c1 is represented by “D ′”. This recalculation method is performed in the same procedure as the procedure of creating the hash value D of the summary file SF by the summary file hash value creating means 14 of the user terminal 1a.

  The summary file hash value acquisition means 42c2 is the signature in the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) managed by the verification management means 48. It has a function of acquiring the hash value D of the original summary file included in the target digital data TSTI (D, t).

The summary file hash value comparison unit 42c3 has the hash value D ′ of the summary file SF recalculated by the summary file hash value recalculation unit 42c1 and the hash value D of the original summary file SF acquired by the validity verification unit 42a. It has a function of comparing whether or not they are the same (D ′ = D).

  As described above, as long as D1 ′ = D1 and D ′ = D are established, the verification device 4a has not been changed at least after the entry related to the hash value D1 ′ is valid and the time stamp is pressed. Therefore, the entry relating to the hash value D1 ′ outputs “valid (OK)” as the detection result, and if D ′ = D does not hold, outputs “invalid (NG)” as the detection result.

  Subsequently, the operation of the present invention will be described mainly with reference to FIGS. Here, a case will be described in which the summary file SF1 shown in FIG. 6 is created and a time authentication request is made to the TSA (second party).

  First, when the user (the former) inputs the path name epn of the entry eF1 related to the folder to be certified to the user terminal 1a, the entry designating unit 17 enters the entry eF1 from the folder management unit 16 based on the path name epn. Is read. This entry eF1 has a tree structure as shown in FIG. That is, the entry eF1 includes an entry es1 that is a subfolder and an entry ef2 that is a file, and the entry es1 includes an entry ef3 that is a file. As described above, when there is an inclusion relationship between the entry es1 and the entry ef3 included in one entry eF1, if there is a directional branch from the entry ef3 to the entry es1, the entry is included in one entry eF1. A tree structure can be constructed from the entire entry es1 and entry ef3.

  Then, the summary file creation means 11 creates the summary file SF1 according to the procedure shown in FIG.

  First, in order to create the summary file expression SFR (eF1) based on the entry eF1 which is the highest hierarchy shown in FIG. 7, the summary file expression creation means 11d reads the folder summary file expression creation function FolderSfRep from the function management means 18. (Step S1).

  However, since the entry es1 related to the subfolder and the entry ef2 related to the file are stored in the entry eF1 as the lower hierarchy, the summary file representation SFR (es1) based on the entry es1 and the entry ef2 A summary file representation SFR (ef2) needs to be created. Therefore, the summary file representation creation unit 11d reads out the folder summary file representation creation function FolderSfRep from the function management unit 18, and the summary file representation synthesis unit 11e performs the file summary file representation creation function FileSfRep from the function management unit 18. Read (step S2).

  However, since the entry es1 stores the entry ef3 related to the file as a layer below it, it is necessary to create a component SFR (ef3) based on the entry ef3. Therefore, the file summary file expression creation function FileSfRep is read out from the function management means 19 by the summary file expression synthesis means 11e (step S3).

Next, in order to create the summary file expression SFR (ef3), first, the hash value creation means 11a reads the hash function h1 _ef3 from the function management means 18 (step S4a), and applies it to the entry ef3 to thereby obtain the hash value. h1 _ef3 (ef3) is created (step S4b). Further, the summary file expression synthesizing means 11e uses the hash value h1 _ef3 (ef3) and applies the file summary file expression creation function FileSfRep read out in the step S3 to the entry ef3 to obtain the summary file expression SFR (ef3 ) Is created (step S4c).

Thereby, since the constituent elements of the summary file expression SFR (es1) based on the entry es1 shown in FIG. 7 are determined, the summary file expression SFR (es1) is created next. Therefore, first, the hash value combining unit 11b combines the hash value h1 _ef3 (ef3) with the additional information α3, and the integrated hash value creating unit 11c reads the hash function h2 _es1 from the function management unit 18 (step S5a) The combined hash value of es1 by h2 _es1 is created by applying to the result h1 _ef3 (ef3) ‖α3 (step S5b). Further, the summary file expression synthesizing unit 11e uses the integrated hash value of es1 by h2 _es1 and applies the folder summary file expression creation function FolderSfRep read in step S2 to the entry es1 to obtain the summary file expression SFR ( es1) is created (step S5c).

Further, in order to determine the constituent elements of the summary file expression SFR (eF1) based on the entry eF1 shown in FIG. 7, a summary file expression SFR (ef1) is further created. For this purpose, first, the hash value h1 _ef2 is read from the function management means 18 by the hash value creation means 11d (step S6a) and applied to the entry ef2 to create the hash value h1 _ef2 (ef2) (step S6b). . Further, the summary file expression synthesizing unit 11da uses the hash value h1 _ef2 (ef2) and applies the file summary file expression creation function FileSfRep read out in step S2 to the entry ef2 to obtain the summary file expression SFR (ef2 ) Is created (step S6c).

Thereby, since the constituent elements of the summary file expression SFR (eF1) based on the entry eF1 shown in FIG. 7 are determined, the summary file expression SFR (eF1) can finally be created. Therefore, first, the hash value combining means 11b combines the integrated hash value of es1 and the additional information α1 by h2 _es1 , and further combines the hash value h1 _ef2 (ef2) and the additional information α2. Then, the integrated hash value creation means 11c reads the integration hash function h2 _eF1 from the function management means 18 (step S7a), and results of combining as described above, that is, the integrated hash value of es1 by h2 _es1 , α1, By applying to the concatenation of h1 _ef2 (ef2) and α2, an integrated hash value of eF1 by h2 _eF1 is created (step S7b). Further, the summary file expression synthesizing means 11e uses the integrated hash value of eF1 by h2 _eF1 and applies the folder summary file expression creation function FolderSfRep read in step S1 to the entry eF1 to obtain the summary file expression SFR ( eF1) is created (step S7c).

  Finally, an additional element for management or the like is added by the summary file creating means 11 (step S8), thereby completing the summary file SF1 as shown in FIG.

  Next, the created summary file SF1 is stored in the file management means 19 and managed by the summary file storage means 12. Also, the hash value D is created by the summary file hash value creating means 14. Then, as shown in FIG. 9, the transmission / reception unit 15 transmits the hash value D to the time authentication device 2 of the TSA (second), so that the user (first) makes a time authentication request to the TSA (second) ( Step S11).

  Next, in the time authentication device 2 of the TSA (B), the digital signature sig2 is generated by the digital signature generation unit 23 based on the time t acquired by the time acquisition unit 22, and the time authentication certificate TST2 is generated by the time authentication unit 24. Create Then, as shown in FIG. 9, the TSA (B) sends a time certification response by transmitting the time certification certificate TST2 from the time certification device 2 to the user terminal 1a of the user (class A). (Step S12).

  Next, when it becomes necessary for the user (the former) to prove the time proof of the entry eF1 related to the folder to the disputed party (丙), as shown in FIG. From the user terminal 1a to the verification device 4a of TTP (Ding) via the communication network 5, the entry e to be certified, the summary file SF based on this entry e, and the time authentication certificate TST (sig (SK, TSTI (D, t)) and TSTI (D, t)) are transmitted to make a time certification verification request (step S13).

  Next, the verification device 4a verifies the entry e, the summary file SF, and the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) received by the transmission / reception means 41. The time management certificate TST (sig (SK, TSTI (D, t)), by the cooperation of the verification management unit 48 and the function management unit 49 and the verification unit 42 Verify the validity of TSTI (D, t)). Then, as shown in FIG. 9, the verification result is transmitted as a time proof verification response by the transmission / reception means 41 to the user terminal 1a or the contender terminal 3 via the communication network 5 (step S14).

  As described above, according to the present invention, a specific description language that expresses a tree structure unambiguously according to a predetermined rule, such as XML, for the name of the entry e and the hash value data of the entry e. (If necessary, a plurality of summary file representations SFR are created by expressing them in a description language that allows humans to understand this tree structure according to the rules.) As a result, the summary file SF is finally created. For this reason, if the summary file SF is stored and managed in the file management means 19, even if a change occurs in a part of the entries eF1 (for example, the entry ef3), the person can edit the summary file SF. By looking at the summary file representation SFR or by automatic analysis by a computer, it can be verified that only the changed part is invalid and the other part (for example, entry ef2) is valid.

  In addition, since the summary file SF is expressed by the summary file expression creation unit 11d by associating the name of the entry e with the hash value D of the entry e, which entry e (digital data g ), It is possible to omit the trouble of having to recalculate the hash values one by one.

[Second Premise Invention]
The bulk time authentication method according to the second premise invention will be described below with reference to FIGS. In the present invention, a case has been described in which entry ef2 related to a folder configured by a flat tree structure without subfolders is targeted for certification. Therefore, the constituent elements of the user terminal 1a are the same as the constituent elements of the first premise invention, and the description thereof is omitted.

  The summary file SF2 shown in FIG. 10 has a tree structure as shown in FIG. FIG. 11 shows an entry ef2 configured by a flat tree structure without subfolders. As shown in FIG. 11, the entry ef2 stores entries ef11 and ef12 related to files without including subfolders.

  As shown in FIG. 10, the summary file SF2 is configured by an additional element for management such as a user name <username> and a summary file expression SFR (eF2) based on the entry eF2. Since the original data is a folder, this summary file representation SFR (eF2) adopts the representation method shown in FIG. 2, and HashRep (eF2), the summary file representation SFR (ef11) based on the entry ef11, and the entry It is composed of summary file representation SFR (ef12) based on ef12.

  Furthermore, since the entry ef11 is a file, the summary file expression SFR (ef11) adopts the expression method shown in FIG. 3 and is configured by HashRep (ef11). Similarly, since the entry ef12 is a file, the summary file expression SFR (ef12) adopts the expression method shown in FIG. 3 and is configured by HashRep (ef12).

  As described above, according to the premise invention, the same effects as those of the first premise invention can be obtained.

[Third premise invention]
The bulk time authentication method according to the third premise invention will be described below with reference to FIGS.

  FIG. 12 shows an example of two personal computers (personal computers) P1 and P2 connected via a communication network such as a LAN (Local Area Network) or the Internet, and entries stored in the personal computers P1 and P2, respectively. FIG. A folder P is stored in the personal computer P1, and files a1, a2, a3, a4 are stored therein. A folder B is stored in the personal computer P2, and files a5, b1, b2, b3, and b4 are stored therein.

  FIG. 13 shows that a1, a2, a3, a4, a5, b1, b2, b4 are specified by the entry specifying means among the files shown in FIG. 12, and a1, a2, a3, a4, a5 are grouped into one group. Entry α and b1, b2, b4 as one group as entry β. Entry b3 is the entry that was not specified. In this example, a group consisting of entry α and entry β is defined as a new group, and entry γ is defined by the group definition means. Let ide be the function that represents the identifier for the entry, and idh be the function that represents the identifier for the hash function. The hash function applied to entries a1, a2, a3, a4, and a5 is set to ha, the hash function applied to b1, b2, and b4 is set to hb, and the hash functions for entries α, β, and γ are set to h. The identifier for the entry and hash function is digital data that can be concatenated with the hash value for the entry. An expression in which digital data are arranged across a ridge represents digital data that is a concatenation of these digital data.

An example of summary file representation is shown for this example. In this example, as the summary file representation for each entry, the hash value of the entry, the identifier of the hash value creating means used to create the hash value, and the digital value obtained by concatenating the identifier specifying the entry Use data. At this time, the summary file expressions for the entries a1, a2, a3, a4, a5 are respectively
ha (a1) ‖ide (a1) ‖idh (ha),
ha (a2) ‖ide (a2) ‖idh (ha),
ha (a3) ‖ide (a3) ‖idh (ha),
ha (a4) ‖ide (a4) ‖idh (ha),
ha (a5) ‖ide (a5) ‖idh (ha)
It becomes. The summary file representations for entries b1, b2, and b4 are respectively
hb (b1) ‖ide (b1) ‖idh (hb),
hb (b2) ‖ide (b2) ‖idh (hb),
hb (b4) ‖ide (b4) ‖idh (hb)
It becomes. The summary file representations for entry α and entry β are
h (ha (a1) ‖ide (a1) ‖idh (ha) ‖ha (a2) ‖ide (a2) ‖idh (ha) ‖
ha (a3) ‖ide (a3) ‖ idh (ha) ‖ha (a4) ‖ide (a4) ‖idh (ha) ‖
ha (a5) ‖ide (a5) ‖idh (ha)) ‖
ide (α) ‖idh (h) ‖
ha (a1) ‖ide (a1) ‖idh (ha) ‖
ha (a2) ‖ide (a2) ‖idh (ha) ‖
ha (a3) ‖ide (a3) ‖idh (ha) ‖
ha (a4) ‖ide (a4) ‖idh (ha) ‖
ha (a5) ‖ide (a5) ‖idh (ha)
When
h (hb (b1) ‖ide (b1) ‖idh (hb) ‖hb (b2) ‖ide (b2) ‖idh (hb) ‖
hb (b4) ‖ide (b4)) ‖
ide (β) ‖idh (h) ‖
hb (b1) ‖ide (b1) ‖idh (hb) ‖
hb (b2) ‖ide (b2) ‖idh (hb) ‖
hb (b4) ‖ide (b4) ‖idh (hb)
The summary file representation for entry γ is as shown in FIG.

[Fourth Premise Invention]
The bulk type time authentication method according to the fourth premise invention will be described below. In addition, since this premise invention is a modification of the said 3rd premise invention, only a different part is demonstrated.

  In the base invention, a summary file SF3 is generated by adding predetermined additional data to the summary file expression for the entry γ created in the third base invention.

  The hash value of the summary file SF3 may be the result of treating the SF3 as digital data such as a byte string and applying a hash function such as MD5 or SHA-1 that is applied to such digital data. When the hash value of the summary file SF3 is determined in this way, the time authentication certificate TST3 for the hash value of this summary file is used to authenticate one digital data subject to time certification, for example, time authentication for a1. In order to verify the proof, the summary file itself must use SF3.

Alternatively, from the summary file representation of entry γ included in SF3, the part representing the hash value of entry γ
h (h (ha (a1) ‖ide (a1) ‖idh (ha) ‖ha (a2) ‖ide (a2) ‖idh (ha) ‖
ha (a3) ‖ide (a3) ‖idh (ha) ‖ha (a4) ‖ide (a4) ‖idh (ha) ‖
ha (a5) ‖ide (a5) ‖idh (ha)) ‖
ide (α) ‖idh (h) ‖
h (hb (b1) ‖ide (b1) ‖idh (hb) ‖hb (b2) ‖ide (b2) ‖idh (hb) ‖
hb (b4) ‖ide (b4)) ‖
ide (β) ‖idh (h))
May be extracted and used as the hash value of the summary file SF3. When the hash value of the summary file SF3 is determined in this way, the time authentication certificate TST3 for the hash value of this summary file is used to authenticate one digital data subject to time certification, for example, time authentication for a1. The verification of the proof can be performed as follows using the digital data that is the contents of a1 and the individualized summary file for entry a1. Here, the personalization summary file for entry a1 is the data related to a1 to be verified.
ha (a1) ‖ide (a1) ‖idh (ha)
And entries related to the sibling of a1 to be verified
ha (ai) ‖ide (ai) ‖idh (ha) (i = 2, ..., 5)
And the identifier ide (α) of the entry α corresponding to the parent, the identifier idh (h) of the hash function, and the data related to the entry β corresponding to the parent sibling
h (hb (b1) ‖ide (b1) ‖idh (hb) ‖hb (b2) ‖ide (b2) ‖idh (hb) ‖
hb (b4) ‖ide (b4)) ‖ide (β) ‖idh (h)),
And the identifier ide (γ) of the entry γ corresponding to the parent of the parent and the identifier idh (h) of the hash function. Since the data related to the entries b1, b2, b4 corresponding to the children of the parent sibling β are not included, the data amount is smaller than that of the summary file SF3.

In general, when the total number of files subject to time certification is n, the amount of data in the summary file is proportional to n, but the individualized summary file for one of the entries will appropriately group these multiple entries. By doing so, the amount of data can be on the order of log _m (n) (where m is the number of elements in each group in the grouping). Therefore, the verification method using the individualized summary file has an advantage that the amount of data required for verification can be remarkably reduced when n is large as compared with the verification method using the summary file.

  In order to verify the time authentication certificate using the individualized summary file for a1, first, the hash value ha (a1) is calculated by applying a predetermined hash function ha to the digital data that is the content of a1, and this It is verified whether or not the value matches the hash value included in the data related to a1 of the personalization summary file for a1.

  When the first verification fails, the verification of the time authentication certificate for a1 fails.

  When the first verification is successful, the hash value of the summary file SF3 is calculated from the individualized summary file by the individualized summary file using type summary file / hash value recalculating means as follows.

First, data related to a1 from the personalization summary file for a1
ha (a1) ‖ide (a1) ‖idh (ha)
To extract.

Second, the data related to the entry a1
ha (a1) ‖ide (a1) ‖idh (ha)
And data related to one or more entries a2, a3, a4, a5 that are siblings of the entry a1 in the hierarchical structure of entries subject to time certification
ha (a2) ‖ide (a2) ‖idh (ha),
ha (a3) ‖ide (a3) ‖idh (ha),
ha (a4) ‖ide (a4) ‖idh (ha),
ha (a5) ‖ide (a5) ‖idh (ha)
Are applied, and the hash function h for the entry α corresponding to the parent of the entry a1 is applied, and the hash value of the entry α corresponding to the parent of the entry a1 is applied.
h (ha (a1) ‖ide (a1) ‖idh (ha) ‖
ha (a2) ‖ide (a2) ‖idh (ha) ‖
ha (a3) ‖ide (a3) ‖idh (ha) ‖
ha (a4) ‖ide (a4) ‖idh (ha) ‖
ha (a5) ‖ide (a5) ‖idh (ha))
Calculate

Third, the identifier ide (α) of the entry α corresponding to the parent of the entry a1, the hash value for the α, and the identifier idh (h) of the entry hash function h for α are concatenated to be the parent of the entry a1. Data related to entry α
h (ha (a1) ‖ide (a1) ‖idh (ha) ‖
ha (a2) ‖ide (a2) ‖idh (ha) ‖
ha (a3) ‖ide (a3) ‖idh (ha) ‖
ha (a4) ‖ide (a4) ‖idh (ha) ‖
ha (a5) ‖ide (a5) ‖idh (ha)) ‖
ide (α) ‖idh (h)
Calculate

Fourth, the data related to the entry α corresponding to the parent of the entry a1 and the data related to β corresponding to the sibling of the entry a1.
h (hb (b1) ‖ide (b1) ‖idh (hb) ‖hb (b2) ‖ide (b2) ‖idh (hb) ‖
hb (b4) ‖ide (b4)) ‖ide (β) ‖idh (h))
And the hash function h for the entry γ of the highest hierarchy is applied to the result, and the hash value of the summary file SF3 is calculated.

  The above shows the procedure for calculating the summary file hash by the summary file hash value recalculation means using the individualized summary file when the hierarchy structure is three stages, but the hierarchy structure is deeper than three stages. In addition, as the individualized summary file of the entry subject to time certification, the data consisting of the following (1) to (3) is used as the individualized summary file, so that the summary file hash using the individualized summary file is used. The value recalculation means can recalculate the hash value of the summary file including the entry.

(1) Digital data that is the contents of the entry.

(2) An identifier for an entry corresponding to the entry and its ancestor (an entry corresponding to a parent, a parent of a parent, a parent of a parent of a parent, and the like) and an identifier of a hash function assigned to the entry.

(3) Data related to the entry in the sibling relationship of the entry or its ancestor entry.

  The fourth premise invention has the following effects as compared with the related art.

  Another related technology is SDML (Signed Document Markup Language Specifications Version 2.0), which is a markup language for unifying and describing structured digital documents and their digital signatures. (Posted on http://www.fstc.org/)). The original purpose of use of this language is to express the contents of a message to be digitally signed in the language and express it as a character string, and to construct a structured digital document including the character string and a digital signature for it. There is to create. SDML uses a set of identifiers (path names) and hash values of digital data (electronic files, etc.) subject to time certification instead of message contents, and is trusted as a digital signature used in SDML. By using a digital signature with a time stamp issued by a three-party organization, it can be used for the same purpose of time certification as the present invention. At this time, in order to obtain a time certificate by grouping multiple digital data, each digital data identifier / hash value pair is treated as a data block in SDML, and these multiple data blocks are Thus, a digital signature with a time stamp issued by a trusted third party is obtained to generate a signature block, which is used as a time certificate. In order to verify the time certificate for one piece of digital data, the signature block is verified according to the procedure defined in the SDML, and at the same time, the identifier of the digital data and its hash value are Verify that the set matches the contents of the corresponding SDML data block. However, even if such an extension is performed, blocks are not allowed to be nested in SDML, so it is not clear from the literature how to realize time proof for a collection of digital data having multiple levels.

  Based on SDML, as a method for realizing time certification for multiple digital data layered in multiple layers, the hierarchical structure of multiple digital data layers in multiple layers is ignored, and multiple digital data -It is possible to treat as a simple collection of data and apply the above method. However, when this method is used, in order to verify the time certificate for a certain digital data by a third party, it is necessary to provide the time certificate together with the digital data to the verifier. However, there is a problem that the data amount of the time certificate increases in proportion to the number N of digital data that is the subject of time certification.

On the other hand, in the fourth premise invention layered in multiple stages, the minimum information required for the verifier to verify the time certificate for one digital data is extracted from the original summary file. You can create a personalized summary file and use it to verify the time certificate. The data amount of the individualized summary file is proportional to m · log _m N, where m is the number of branches in each hierarchy. Therefore, in the method of the fourth premise invention using the individualized summary file, when N is large, the communication amount when a third party verifies the time certificate for one digital data is remarkably reduced. At the same time, there is an advantage that disclosure of information that may be related to privacy is minimized by disclosing only information necessary for verification. Furthermore, since the amount of data handled at the time of verification is reduced, there is an advantage that the processing time for verification is shortened.

  The above description is the premise invention, and the embodiment will be described below.

[First Embodiment]
Hereinafter, a bulk time authentication method (pre-filter method) according to the first embodiment of the present invention will be described with reference to FIGS. 15 and 16. FIG. 15 is a diagram illustrating the relationship between the appearance subjects, the communication infrastructure, and the configuration of each device in the present embodiment. FIG. 16 is a workflow diagram for explaining processing in the present embodiment.

  The present embodiment is characterized in that the user terminal 1b according to the first premise invention shown in FIG. 1 further uses the user terminal 1b to which the pre-filter means 13 is added. The filter means 13 will be described. The user terminal 1b stores a time authentication request program (p1b) for causing the user terminal 1b to function as each means shown in FIG.

  The pre-filter means 13 shown in FIG. 15 applies a filter function F to the summary file SF created by the summary file creation means 11 as shown in FIG. Filter (conceal) the information specified by (Exhibit A) (in this case, information that the user (Exhibit A) does not want to disclose to third parties including the disputed party (I), for example, the identifier of entry e1) can do. Here, when the summary file SF is described in the markup language XML, the filter function F is easily defined by XSLT (eXtwnsible Stylesheet Language Transformations) which is a format for describing the transformation method of the XML document. Can do. In general, the filter function F conceals a part of information included in the summary file SF, but does not conceal the hash value (i = 1,..., N) of the entry ei originally included in the SF. Restrict to functions, i.e., such that the filtered summary file F (SF) contains all entries ei (i = 1, ..., n).

Further, the file management means 19 in this case stores the summary file F (SF) filtered by the pre-filter means 13. Furthermore, the summary file hash value creation means 14 in this case _applies a hash function h3 _eF to the summary file F (SF) filtered by the previous filter means 13 as shown in FIG. A hash value h3 _eF (F (SF)) can be created.

  Next, since the time authentication device 2 has the same configuration and the same function as the first premise invention, the same reference numerals are given and the description thereof is omitted.

  The verification device 4a has the same configuration and the same function as the verification device 4a shown in FIG. 1, but uses a filtered summary file F (SF) as a verification target instead of the summary file SF. Is different. In this case, in order to guarantee the originality at the time attached to the time authentication certificate of the entry ei specified for time authentication, the hash value of the entry ei is included in the filtered summary file F (SF). Need to be included. As described above, since F (SF) defines the filter function F so as to include all the hash values (i = 1,..., N) of ei originally included in SF, the time of entry ei The originality at the time attached to the authentication certificate can be guaranteed.

  Subsequently, processing in the first embodiment will be described with reference to FIGS. 15 and 16.

First, the summary file SF created by the summary file creation means 11 is subjected to the filter function F by the pre-filter means 13, and the user (the former) includes the disputed party (サ) in the summary file SF. Filtered summary information F (SF) is created by filtering information that you do not want to disclose to the users. Then, the summary file hash value creation means 14 causes the hash function h3 _eF to act on the filtered summary file F (SF) to create a filtered summary file hash value h3 _eF (F (SF)). Here, for convenience of explanation, h3 _eF (F (SF)) is represented by “D”. Then, by transmitting / receiving the time authentication request TSR (D) including the filtered summary file hash value D to the time authentication device 2 of the TSA by the transmission / reception means 15, as shown in FIG. A time authentication request is made to (step S21).

  On the other hand, in the TSA (B), the transmission / reception means 21 of the time authentication device 2 receives the time authentication request TSR (D) including the filtered summary file hash value D. Then, the digital signature creation means 23 combines the filtered summary file hash value D received by the transmission / reception means 21 with the time t acquired by the time acquisition means 22 and predetermined additional information to sign the digital signature in the time authentication certificate. The data TSTI (D, t) is used, and a digital signature sig (SK, TSTI (D, t)) is created for the digital data to be signed.

  Next, the time authenticating means 24 includes the time authentication certificate TST (sig (sig (s)) including the digital data to be signed TSTI (D, t) and the created digital signature sig (SK, TSTI (d, t)). (SK, TSTI (D, t)), TSTI (D, t)) are created. Then, as shown in FIG. 16, the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is sent to the user terminal 1b by the transmission / reception means 21. Is transmitted, a time proof response is made to the user (step A) (step S22).

  Next, when a situation occurs in which the user (the former) proves that the entry ei exists at the time t with respect to the disputed party (丙), the user (the former) Thus, from the user terminal 1b to the TTP (cutter) verification device 4a, the entry ei, the hash function identifier id (hi) designated for the entry ei, the filtered summary file F (SF), and the time By transmitting the authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)), a time certificate verification request is made to TTP (Ding) (step S23). Thus, the entry ei relating to the original digital data is also transmitted to the verification device 4a in order to verify that the hash value hi (ei) is included in the filtered summary file F (SF). This is because it is necessary to verify that the contents of the entry ei existed at time t.

  Next, in the verification device 4a of TTP (Ding), the transmission / reception means 41 uses the entry ei, hash function identifier id (hi), filtered summary file F (SF), and time authentication certificate TST4 = TST (sig (SK, TSTI (D, t)), TSTI (D, t)) are received. Then, the following three verification steps are executed.

  First, the digital data TSTI (D, t) and digital signature sig (SK, TSTI (D, t)) to be signed are extracted from the time authentication certificate TST4, and are digitally signed using the public verification key PK. It is verified that sig (SK, TSTI (D, t)) is made for the digital data to be signed TSTI (D, t) (42a).

  Second, the hash value h ′ of the hash function h3 of the filtered summary file recalculated using the hash function h3 that is guaranteed to work correctly by TTP (Ding), and TSTI (D, t) (42c2) It is compared whether or not the hash values D match (42c3).

  Third, (42b1) the hash value hi (ei) recalculated by the hash function specified by the hash function identifier id (hi) of the entry ei and the (42b2) element obtained from the filtered summary file F (SF) Are compared with each other (42b3).

  When the above three verification steps are passed, the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is sure that the entry ei exists at time t. It is verified that this is proved, and a time proof verification response indicating that it is valid is sent to the user terminal 1 of the user (step A) (step S24). If any of the above three verification steps is unacceptable, a time certification verification response indicating that the verification is invalid is made (step S24). As a result, the user (the former) can use it for dispute resolution by transmitting the verification result from the user terminal 1b to the disputed party terminal 3 of the disputed party (丙) via the communication network 5.

  In addition, the user (the former) in this embodiment may perform the role of TTP (Ding) by himself. However, in this case, for the hash values hi (ei) and h3 (F (SF)), the values of the hash values hi (ei) and h3 (F (SF)) calculated by the user (the user A) Confirm that the hash values hi (gi) and h3 (F (SF)) calculated by the disputed party (丙) are the same between the user (I) and the disputed party (丙) There is a need.

  In this embodiment, the user (the former) makes a time certification request to the TSA (second party) and a time certification verification request to the TTP (two). However, the present invention is not limited to this. (Exhibit A1) and the time certification verification requester (Exhibit A2) may be different persons. However, in this case, the time certification requester (Exhibit A1) makes the time certification verification requester (Exhibit A2) an entry e that has been subject to time authentication in advance and the time authentication certificate TST (sig (SK, TSTI ( D, t)), TSTI (D, t)), and filtered summary file F (SF) must be passed. In addition, the time certification requester (Exhibit A1) makes the time certification verification requester (Execution A2) the entry e that is the subject of the time certification and the time certification certificate TST (sig (SK, TSTI (D, t)), (D, t)) is passed in advance and the filtered summary file is not passed, the time proof verification requester (Exhibit A2) makes the time proof verification requester ( A) requests the filtered summary file F (SF), and the time certification requester (A1) responds to the time certification verification requester (A1) with the filtered summary file F ( SF).

  Further, when the filtered summary file F (SF) is shown to the disputed party (丙), the user (A) may show it or the TTP (Ding) may show it.

  Next, an example of summary file filtering will be described with reference to FIGS.

  First, FIG. 17 shows SF1a that is the result of hiding the folder name based on SF1. A portion where the original SF1 is changed by this concealment processing is indicated by an underline. FIG. 18 shows SF1b that is the result of hiding the file name based on SF1. Similarly to FIG. 17, the portion where the original SF1 is changed by this concealment processing is indicated by an underline. FIG. 19 shows SF1c that is the result of hiding both the folder name and the file name based on SF1. Similarly to FIG. 17, the portion where the original SF1 is changed by this concealment processing is indicated by an underline.

  On the other hand, FIG. 20 shows SF2d that is the result of concealing all the information about the top-level folder and the folder made up of subfolders included in SF1d based on SF1 and converting it to represent a simple file sequence. . In this operation, the summary file is flattened as in the case shown in FIG. FIG. 21 shows SF1e as a result of performing flattening based on SF1 (SF1d) and further concealing the file name. In this case, a portion where the flattened SF1d is changed by this concealment processing is indicated by an underline.

  As described above, according to the present embodiment, the pre-filter means 13 filters information that the user (the former) does not want to be disclosed to third parties including the disputed party (丙) in the summary file SF. Therefore, even if it is necessary to prove the time proof of the entry related to specific digital data to the disputed party (丙), the information to the disputed party (丙) is not necessarily required for the time proof of the specific entry. There is an effect that the time certification can be realized without disclosure.

[Second Embodiment]
The bulk time authentication method (pre-filter method (secondary summary file)) according to the second embodiment of the present invention will be described below with reference to FIGS. FIG. 22 is a diagram illustrating the relationship between the appearance subjects, the communication infrastructure, and the configuration of each device in the present embodiment. FIG. 23 is a configuration diagram of a later-described secondary summary file and its hash value. 24 and 25 are workflow diagrams illustrating the processing in this embodiment.

  The present embodiment is characterized in that the user terminal 1c in which the secondary summary file creating unit 11 ′ is further added to the user terminal 1b according to the first embodiment shown in FIG. 15 is used. The secondary summary file creation means 11 ′ will be mainly described. The user terminal 1c stores a time authentication request program (p1c) for causing the user terminal 1c to function as each means shown in FIG.

  As described above, the summary file SF can be used not only for the user (the former) but also for the other party (丙 1) or for other parties (丙 2) in the future. Expected to show. In this case, for example, there is a case where it is desired to filter different parts of the disputed opponent (丙 1) and the disputed opponent (丙 2).

  In addition, each of the plurality of filtered summary files generated based on a single summary file in the first embodiment is created and generated with the intention of being used for different purposes. For example, SF1d is a time proof for electronic data contained in a folder (ie, the electronic data existed at a certain time) for a party who does not want to know the hierarchical structure inside a folder or in such a situation. SF1e is suitable not only for the internal hierarchy of a folder but also for the names of the files contained in it and for those who do not want to be known. In such a situation, it is suitable for use for time certification for the electronic data contained therein. As described above, even if the same summary file is used, the type of filtered summary file suitable for the time proofing partner and the situation differs.

  Therefore, in order to cope with various opponents and situations where time certification may be performed, it is desirable that a filtered summary file suitable for each opponent or situation can be used.

  However, if a plurality of types of summary files SF are created, there is no point in combining the hash values of a plurality of entries into one. Therefore, the present embodiment is characterized in that the secondary summary file SSF is created by combining the hash values of the plurality of types of summary files SF into one by the secondary summary file creating means 11 '. The secondary summary file creation means 11 ′ is a plurality of types of filtered summary files (for example, the first embodiment) created by various filtering methods based on one summary file created by the summary file creation means 11. And a hash value of SF1a to SF1e) described in the above description is created to create one secondary summary file SSF.

Further, the secondary summary file hash value creation means 14 ′ adds a secondary summary file hash function h4 _eF (hereinafter referred to as “hash function h4 _eF ”) to the secondary summary file SSF created by the secondary summary file creation means 11 ′. To create a hash value h4 _ef (SSF) of the secondary summary file SSF. The hash function h4 _eF can be recorded and managed in advance in the function management means 18, and can be read from the function management means 18 when applied to the secondary summary file SSF.

  Hereinafter, with reference to FIG. 23, a method for performing time certification using various filtered summary files based on the same summary file will be described in detail.

  First, the pre-filter means 13 creates a plurality of filtered summary files SF1, SF1a to SF1e by various filtering methods based on a certain summary file, for example, SF1 (step S31).

Second, the hash functions h3 ₀ and h3a to h3e designated for the plurality of filtered summary files SF1, SF1a to SF1e are applied by the secondary summary file creating means 11 ′, and each hash value h3 ₀ ( SF1), h1a (SF1a) to h1e (SF1e) are generated (step S32).

Third, the secondary summary file creation means 11 ′ uses the hash values h3 ₀ (SF1), h1a (SF1a) to h1e (SF1e) of the filtered summary file generated in step S32 to obtain a secondary summary. A file SSF1 is created (step S33).

  Finally, the secondary summary file hash value creating means 14 'generates the hash value h4 (SSF1) of the secondary summary file SSF1 using the hash function h4 designated by the user (the former) (step S34).

  Subsequently, processing in the second embodiment will be described with reference to FIGS. 24 and 25.

First, the summary file SF created by the summary file creation means 11 is subjected to the filter function F by the pre-filter means 13, and the user (the former) includes the disputed party (サ) in the summary file SF. Filtered summary information F (SF) is created by filtering information that you do not want to disclose to the users. In this case, the pre-filter means 13 causes various filter functions F1,..., Fm to act on the summary file SF so that the user (the former) includes the disputed party (丙) in the summary file SF. Filter information that is not desired to be disclosed to a third party according to various criteria, and create a filtered summary file F1 (SF),..., Fm (SF). Then, a secondary summary file SSF including F1 (SF),..., Fm (SF) is created by the secondary summary file creating means 11 '. Further, the secondary summary file hash value creating means 14 ′ applies the hash function h4 to the secondary summary file to create the secondary summary file hash value h4 (SSF), which is set as “D”. . Then, as shown in FIG. 25, the transmission / reception unit 15 transmits a time authentication request TSR (D) including the secondary summary file hash value D to the time authentication device 2 of the TSA (B), thereby A time authentication request is made to (step S51).

  On the other hand, in TSA (B), the time authentication request TSR (D) including the secondary summary file hash value D is received by the transmission / reception means 21 of the time authentication device 2. Next, the digital signature creation unit 23 combines the secondary summary file hash value D received by the transmission / reception unit 21 with the time t acquired by the time acquisition unit 22 and predetermined additional information to sign the signature in the time authentication certificate. Digital data TSTI (D, t) is used, and a digital signature sig (SK, TSTI (D, t)) is created for the digital data to be signed.

  Next, the time authenticating means 24 includes the time authentication certificate TST (sig (sig (s)) including the digital data to be signed TSTI (D, t) and the created digital signature sig (SK, TSTI (d, t)). (SK, TSTI (D, t)), TSTI (D, t)) are created. Then, as shown in FIG. 25, the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is transmitted to the user terminal 1c by the transmission / reception means 21. Is transmitted, a time certification response is made to the user (step A) (step S52).

  Next, when a situation occurs in which the user (A) proves that the entry ei exists at the time t with respect to the disputed partner (A), the user (A) is shown in FIG. As described above, the entry ei, the hash function identifier id (hi), the summary file Fj (SF), the hash function identifier id (hj ′), and the secondary summary are sent from the user terminal 1c to the TTP (cutter) verification device 4a. By transmitting the file SSF and the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)), a time certificate verification request is made to the TTP (Ding) (step S53). ). In this way, the original entry ei is also transmitted to the verification device 4a because the entry ei is verified by verifying that the hash value hi (ei) is included in the filtered summary file Fj (SF). This is because it is necessary for verifying that the contents of exist at time t.

Next, in the verification device server 104 for TTP (Ding), the digital data ei, the hash function identifier id (hi), the filtered summary file Fj (SF), the hash function identifier id (hj ′) are transmitted by the transmission / reception means 41. The secondary summary file SSF and the time authentication certificate TST4 = TST (sig (SK, TSTI (D, t)), TSTI (D, t)) are received. Then, the following four verification steps are executed.
First, the digital data TSTI (D, t) and digital signature sig (SK, TSTI (D, t)) to be signed are extracted from the time authentication certificate TST4, and are digitally signed using the public verification key PK. It is verified that sig (SK, TSTI (D, t)) is made for the digital data to be signed TSTI (D, t) (42a).

  Second, a hash value D ′ by the hash function h4 of the secondary summary file recalculated using the hash function h4 guaranteed by TTP (Ding) to work correctly, and TSTI (D, t) (42c2) It is compared whether or not the hash value D of the secondary summary file matches (42c3).

  Third, the hash value hj ′ (Fj (SF)) recalculated by the specified hash function hj ′ of the filtered summary file Fj (SF) and obtained from the secondary summary file SSF (42c2) It is compared whether or not the original hash value matches (42c3).

Fourth, the hash value hi (ei) recalculated with the hash function specified by the hash function identifier id (hi) of the entry ei (42b1) and the original (42b2) obtained from the filtered summary file Fj (SF) Are compared with each other (42b3).

  When the above four verification steps are passed, the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is sure that the entry ei exists at the time t. It is verified that this is proved, and a time proof verification response is sent to the user (the former) user terminal 1c to confirm that it is valid (step S54). If any of the above four verification steps is unsuccessful, a time certification verification response indicating that the verification step is invalid is performed (step S54). Thereby, the user (the former) can use it for dispute resolution by transmitting the verification result from the user terminal 1 c to the disputed party terminal 3 of the disputed party (丙) via the communication network 5.

  As described above, according to the present embodiment, even when a plurality of types of filtered summary files are created, a time summary request can be collectively issued by creating a secondary summary file together. There is an effect that it can be performed. In addition, even if it becomes necessary to prove the time proof of a specific entry to a specific dispute partner (丙), information that is not necessarily required for the time proof of a specific entry can be used. The time certification can be realized without disclosing information that is not desired to be disclosed in (1), and it is possible to select appropriate information according to the disputed party as information disclosed at this time.

  In addition, the user (the former) in this embodiment may perform the role of TTP (Ding) by himself. However, in this case, the hash values hi (ei), hj ′ calculated by the user (the user A) are used for the hash values hi (ei), hj ′ (Fj (SF)), and h4 (SSF). The values of (Fj (SF)) and h4 (SSF) are the same as the hash values hi (ei), hj '(Fj (SF)), and h4 (SSF) calculated by the disputed party (丙) It is necessary to confirm that there is something between the user (the former) and the disputed party (the niece).

  In this embodiment, the user (the former) makes a time certification request to the TSA (second party) and a time certification verification request to the TTP (two). However, the present invention is not limited to this. (Exhibit A1) and the time certification verification requester (Exhibit A2) may be different persons. However, in this case, the time certification requester (Exhibit A1) makes the time certification verification requester (Exhibit A2) an entry e that has been subject to time authentication in advance and the time authentication certificate TST (sig (SK, TSTI ( D, t)), TSTI (D, t)), filtered summary file Fj (SF), hash function identifier id (hj ′), and secondary summary file SSF must be passed. In addition, the time certification requester (Exhibit A1) makes the time certification verification requester (Execution A2) the entry e that is the subject of the time certification and the time certification certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is passed in advance and the filtered summary file F (SF), hash function identifier id (hj ′), and secondary summary file SSF are not passed, the time certificate verification requester ( Exhibit A2) requests the above-mentioned secondary summary file SSF, filtered summary file Fj (SF), and hash function identifier id (hj ') from the time certification requester (Exhibit A1) when making a time certification verification request. In response to this, the time certification requester (Exhibit A1) responds to the time certification verification requester (Exhibit A2) with the secondary summary file SSF, the filtered summary file Fj (SF), and the hash function identifier id (hj '). give.

  Further, when the secondary summary file SSF and the filtered summary file Fj (SF) are to be shown to the disputed party (利用), the user (Exhibit A) or TTP (Ding) may be shown.

[Third Embodiment]
Hereinafter, with reference to FIGS. 26 and 27, a bulk time authentication method (post-filter method) according to a third embodiment of the present invention will be described. FIG. 26 is a diagram illustrating the relationship between the appearance subjects, the communication infrastructure, and the configuration of each device in the present embodiment. FIG. 27 is a workflow diagram for explaining processing in the present embodiment.

  The present embodiment is characterized in that a verification device 4b in which a post-filter means 42d is further added is used for the verification device 4a according to the first premise invention shown in FIG. 42d will be described. The verification device 4b stores a time authentication request program (p4b) for causing the verification device 4b to function as each unit shown in FIG.

The post-filter means 42d applies a filter function F defined in the XSLT (eXtensible Stylesheet Language Transformations) format or the like to the summary file SF received at the time certification verification request from the user terminal 1a, and includes the summary file SF. Filter the information specified by the user (Exhibit A) in this case (in this case, the information that the User (Extra) does not want to disclose to the third party including the disputed party (I), for example, the identifier of the entry e1) Can be concealed).

  Subsequently, processing in the third embodiment will be described with reference to FIGS. 26 and 27.

  First, a summary file hash value D = H (SF) is created in the user terminal 1a, and as shown in FIG. 27, a time authentication request TSR (D including the summary file hash value D is sent to the time authentication device 2 of the TSA. ) Is transmitted to the TSA (second party) to make a time certification request (step S61). In this case, since the user terminal 1a does not have the pre-filter means 13, the integrated hash value H (SF) is a hash value of the unfiltered summary file SF. As a result, the time authentication device 2 of TSA (B) creates time authentication certificates TST (sig (SK, TSTI (D, t)), TSTI (D, t)) and uses them as shown in FIG. By sending the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) to the user terminal 1 of the user (the user), A time certification response is made (step S62). In this case, since the hash value h3 (SF) of the unfiltered summary file SF is used, D = h3 (SF).

Next, when a situation occurs in which the user (the former) proves that the entry ei exists at the time t with respect to the disputed partner (丙), the user (the former) is shown in FIG. As described above, from the user terminal 1a to the TTP (cutter) verification device 4b, the entry ei, the hash function number identifier id (hi), the unfiltered summary file SF, and the time authentication certificate TST (sig By transmitting (SK, TSTI (D, t)), TSTI (D, t)), a time certification verification request is made to TTP (Ding) (step S63). Thereby, in the verification device 4b of TTP (Ding), the entry ei, the identifier id (hi) of the hash function number, the unfiltered summary file SF, and the time authentication certificate TST (sig (SK, TSTI (D , t)), TSTI (D, t)). Then, the following four verification steps are executed.
First, from the time authentication certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) to the digital signature sig (SK, TSTI (D, t)) and the signature target data TSTI (D , t) is extracted, and the digital signature sig (SK, TSTI (D, t)) is made on the digital data to be signed TSTI (D, t) using the public verification key PK. This is verified (42a).

  Second, recalculated using the hash function h3 guaranteed to work correctly by TTP (42c1) (42c1) Obtained from the hash value h3 of the summary file hash function h3 and TSTI (D, t) ( 42c2) It is verified that the hash values D match (42c3).

  Third, the filter function F is applied to the unfiltered summary file SF to generate F (SF) (42d).

  Fourth, the hash value hi (ei) recalculated by the hash function specified by the hash function identifier id (hi) of the entry ei and the original hash value obtained from the summary file SF (42b2) Compare (42b3).

  This verification is performed by TTP (Ding), and at the same time, F (SF), ei, hi (ei) is shown to the disputed party (丙), and the party can confirm. In the present embodiment, for the TTP (Ding) to correctly calculate the filtered summary file F (SF) from the summary file SF, the disputed party (丙) needs to trust TTP (Ding). For the hash value hi (ei), the disputed party (丙) calculates hi (ei) from ei using a program that implements the hash function hi prepared by itself, and the value indicated by TTP (Ding) is You may make it verify that it is correct.

  If the time verification certificate TST (sig (SK, TSTI (D, t)), TSTI (D, t)) is valid as a result of the above four verification steps, the user (the user) is used. A time proof verification response is sent to the terminal 1a (step S64). If it is unfair, a time proof verification response indicating that it is unfair is performed (step S64). Further, the post-filter means 42d filters information that the user (the former) does not want to be disclosed to third parties including the disputed party (丙) in the summary file SF. The information to be filtered is specified based on a notification (telephone) from the user terminal 1a via the communication network or telephone contact. This filtered summary file F (SF) is sent to the disputed party (丙) at the time of future dispute resolution.

  As described above, according to the present embodiment, the user (the former) included the disputed party (丙) in the summary file SF by the verification means 42 (with the post-filter means 42d) by the TTP. Even if it is necessary to prove the time proof of a specific entry to the disputed party (丙) by filtering information that you do not want to disclose to a third party, it is not always necessary for the time proof of specific digital data. There is an effect that the time proof can be realized without disclosing information to the disputed party (丙).

  Note that the user (the former) in the present embodiment may perform four verification steps performed by himself / herself with TTP (cutter). However, in this case, for the hash value hi (gi), the hash values hi (ei) and h3 (SF) calculated by the user (the former) and the hash value hi calculated by the disputed party (丙) It is necessary to confirm that the value of (ei) and h3 (FS) are the same between the user (the former) and the disputed party (the niece). Even in this case, the summary file SF is filtered on the TTP side.

[Others]
In the first to third embodiments, the summary file creation unit 11 creates a summary file SF using all of one or more entries e managed by the folder management unit 16. However, the present invention is not limited to this, and the summary file SF may be created using a part of one or more entries e. In this case, only entries that are designated to be included in the summary file SF by a predetermined designation method are subject to time certification. As the designation method, when a specific file name is designated, when an extension of the file name is designated, an attribute of an entry provided by the file system in the user terminal 1a or 1b as a computer (for example, a read-only attribute) , Hidden file attribute, archive attribute).

  In addition, the recording and installation operations of the programs (p1a), (p1b), (p1c), (p2), (p4a), (p4b) are the user terminals 1a, 1b, 1c, the time authentication device 2, respectively. Use a recording medium such as a CD-ROM in which each program (p1a), (p1b), (p1c), (p2), (p4a), (p4b) readable by the verification devices 4a, 4b is recorded It is also possible to do this.

The figure which showed the structure of the appearance main body relationship, communication infrastructure (Infrastructure), and each apparatus in the bulk type | mold time authentication method based on the 1st premise invention of this invention. The figure which expressed a part of summary file SF. The figure which expressed a part of summary file SF. The figure which expressed a part of summary file SF. The figure which expressed a part of summary file SF. The figure expressing the whole summary file SF1. The figure which showed the tree structure of the entry which concerns on the summary file SF1 shown in FIG. FIG. 7 is a flowchart showing a creation process of the summary file SF1 shown in FIG. The sequence diagram which showed the data communication process in 1st premise invention. The figure expressing the whole summary file SF2 in 2nd premise invention. The figure which showed the tree structure of the entry which concerns on the summary file SF2 shown in FIG. The third premise invention is shown, and two personal computers (personal computers) P1 and P2 connected via a communication network such as a LAN (Local Area Network) or the Internet, and entries stored in the personal computers P1 and P2, respectively. The figure which showed an example. The figure which showed the tree structure of the summary file newly created based on the entry shown in FIG. The figure which showed the summary file expression with respect to entry (gamma). The figure which showed the relationship of the appearance subject in 1st Embodiment, the communication infrastructure, and the structure of each apparatus. The workflow figure explaining the process in 1st Embodiment. The figure which showed an example of filtering of a summary file. The figure which showed an example of filtering of a summary file. The figure which showed an example of filtering of a summary file. The figure which showed an example of filtering of a summary file. The figure which showed an example of filtering of a summary file. The figure which showed the relationship of the appearance subject in 2nd Embodiment, the communication infrastructure, and the structure of each apparatus. The block diagram of a secondary summary file and its hash value. The workflow figure explaining the process in 2nd Embodiment. The workflow figure explaining the process in 2nd Embodiment. The figure which showed the relationship of the appearance subject in 3rd Embodiment, the communication infrastructure, and the structure of each apparatus. The workflow figure explaining the process in 3rd Embodiment. The figure which showed the relationship of the appearance subject in the conventional time authentication method, and a communication infrastructure. The figure which showed the relationship of the appearance subject in the conventional bulk type | mold time authentication method, the communication infrastructure, and the structure of each apparatus. The sequence diagram which showed the data communication process in the conventional bulk type | mold time authentication method.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 User terminal 2 Time authentication apparatus 3 Contestant terminal 4 Verification apparatus 5 Communication network 6 Time infrastructure 11 Summary file creation means 11a Hash value creation means 11b Hash value combination means 11c Integrated hash value creation means 11d Summary file expression creation means 11e Summary File representation synthesis means 12 Summary file storage means 13 Prefilter means 14 Summary file hash value creation means 15 Transmission / reception means 17 Entry designation means 18 Function management means 19 File management means 21 Transmission / reception means 22 Time acquisition means 23 Digital signature creation means 24 Time authentication Means 41 Transmission / reception means 42 Verification means 42a Validity verification means 42b1 Hash value recalculation means 42b2 Hash value acquisition means 42b3 Hash value comparison means 42c1 Summary file hash value recalculation means 42c2 Summary File hash value acquisition means 42c3 Summary file hash value comparison means 42d Post-filter means 48 Verification management means 49 Function management means
h1 file hash function (example of entry hash function)
h2 integration hash function (example of entry hash function)
h3 summary file hash function
h4 Hash function for secondary summary file

Claims (13)

A new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user requests the time certification to the time certification authority using the one hash value as a certification subject for time certification by the user terminal. A program for requesting bulk time authentication for performing
The computer serving as the user terminal manages the summary file and function management means for managing the entry hash function defined for each entry and applied to the entry and the summary file hash function applied to the summary file. In the state with the file management means,
A hash value creating means for creating a hash value of each entry by applying an entry hash function managed by the function managing means to each of the plurality of entries;
A summary file expression creating means for creating a summary file expression for each entry by associating a hash value of each entry created by the hash value creating means with an identifier for identifying each entry;
Summary file expression synthesis means for combining summary file expressions for each entry created by the summary file expression creation means;
Pre-filter means for previously shielding desired information from the summary file created as a result of combining the summary file expressions by the summary file expression synthesis means;
Summary file storage means for storing the summary file shielded by the pre-filter means in the file management means;
A summary file hash for creating a hash value of the shielded filtered summary file by applying a hash function for the summary file managed by the function managing unit to the shielded summary file to be stored in the file managing unit Value creation means;
By making the computer function, a bulk time authentication request program for enabling a time authentication request to a time certification authority using the hash value of the filtered summary file as a subject of time authentication. The bulk type time authentication request program according to claim 1,
Further, in the state where the function management means manages the hash function for the secondary summary file applied to the secondary summary file,
When a plurality of types of filtered summary files are created by the pre-filter means, a secondary summary file that creates a summary file different from the summary file by looking at these filtered summary files as entries Summary file creation means,
Instead of the summary file hash value creation means, the secondary summary file hash function managed by the function management means is applied to the secondary summary file created by the secondary summary file creation means, Secondary summary file hash value creating means for creating a hash value of the secondary summary file;
A program for requesting bulk time authentication, which causes the computer to function.   A computer-readable recording medium on which the bulk type time authentication request program according to claim 1 is recorded. A new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user requests the time certification to the time certification authority using the one hash value as a certification subject for time certification by the user terminal. A verification device for verifying the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority,
When the user terminal executes the bulk time authentication request program according to claim 1, a time authentication request is made to the time certification authority using the hash value of the filtered summary file as a time authentication certification target. In case
A verification management means for acquiring and managing the data of the plurality of entries, the summary file created in the user terminal, and the time authentication certificate;
A function management means for managing a hash function for an entry to be applied to the entry and a hash function for the summary file to be applied to the summary file;
Correctness verification means for verifying that the time authentication certificate managed by the verification management means has not been altered and is correct;
The hash value of each entry is re-applied by applying the entry hash function managed by the function management unit to the verification target among the plurality of entries managed by the verification management unit. A hash value recalculation means to calculate,
A hash value acquisition means for acquiring a hash value of a corresponding original entry in a summary file representation that constitutes a filtered summary file in which desired information is previously shielded by the pre-filter means of claim 1;
A hash value comparison unit that compares whether the hash value of the entry recalculated by the hash value recalculation unit and the hash value acquired by the hash value acquisition unit match;
A summary file hash for recalculating the hash value of the filtered summary file by applying the summary file hash function managed by the function management unit to the summary file managed by the verification management unit A value recalculation means;
Summary file hash value acquisition means for acquiring the hash value of the original filtered summary file included in the time authentication certificate managed by the verification management means;
Compare whether or not the hash value of the filtered summary file recalculated by the summary file hash value recalculating unit matches the hash value of the original filtered summary file acquired by the summary file hash value acquiring unit. Summary file hash value comparison means,
The verification apparatus characterized by having. The verification device according to claim 4,
When the user terminal executes the bulk time authentication request program according to claim 2, a time authentication request is made to the time certification authority using the hash value of the secondary summary file as a time authentication certification target. In case
Managing a hash function for a secondary summary file to be applied to the secondary summary file in the function management means,
In the hash value acquisition means, the pre-filter means according to claim 2 includes a summary file representing a specified filtered summary file among a plurality of types of filtered summary files in which desired information is previously blocked. Get the hash value of the corresponding original entry of
Further, the summary file hash value acquisition means acquires a hash value of a specified filtered summary file among the plurality of types of filtered summary files from the secondary summary file,
Further, the summary file hash value recalculation unit, the summary file hash value acquisition unit, and the summary file hash value comparison unit add 2 to the filtered summary file specified in the plural types of filtered summary files. A verification apparatus capable of processing a next summary file. A new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user requests the time certification to the time certification authority using the one hash value as a certification subject for time certification by the user terminal. A verification device for verifying the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority,
The user terminal defines an entry hash function defined for each entry and applies to the entry and a summary function hash function applied to the summary file, and a file management that manages the summary file. Means, applying a hash function for entry managed by the terminal function management means to each of the plurality of entries, and creating a hash value of each entry, and the hash value creation means A summary file expression creating means for creating a summary file expression for each entry by associating a hash value of each entry created with the identifier identifying each entry, and for each entry created by the summary file expression creating means Summary file representation synthesizer that combines summary file representations If the summary file storage means for storing the summary file created as a result of coupling summary file represented by the summary file representation combining means to said file management means, the terminal function with respect to the summary file stored in the file management means In a state having summary file hash value creation means for creating a hash value of the summary file by applying a hash function for the summary file managed by the management means,
A verification management means for acquiring and managing the data of the plurality of entries, the summary file created in the user terminal, and the time authentication certificate;
A function management means for managing a hash function for an entry to be applied to the entry and a hash function for the summary file to be applied to the summary file;
Correctness verification means for verifying that the time authentication certificate managed by the verification management means has not been altered and is correct;
The hash value of each entry is re-applied by applying the entry hash function managed by the function management unit to the verification target among the plurality of entries managed by the verification management unit. A hash value recalculation means to calculate,
Post-filter means for shielding the desired information of the summary file managed by the verification management means later;
A hash value acquisition means for acquiring a hash value of the corresponding original entry in the summary file expression constituting the summary file shielded by the post-filter means;
A hash value comparison unit that compares whether the hash value of the entry recalculated by the hash value recalculation unit and the hash value acquired by the hash value acquisition unit match;
The summary file hash value re-calculation is performed by applying the summary file hash function managed by the function management unit to the summary file managed by the verification management unit and recalculating the hash value of the summary file. A calculation means;
Summary file hash value acquisition means for acquiring a hash value of the original summary file included in the time authentication certificate managed by the verification management means;
Summary file hash value for comparing whether the hash value of the summary file recalculated by the summary file hash value recalculation unit matches the hash value of the original summary file acquired by the summary file hash value acquisition unit A comparison means;
The verification apparatus characterized by having. A new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user requests the time certification to the time certification authority using the one hash value as a certification subject for time certification by the user terminal. A verification method using a verification device that verifies the validity of the time authentication certificate after obtaining the time authentication certificate from the time certification authority,
When the user terminal executes the bulk time authentication request program according to claim 1, a time authentication request is made to the time certification authority using the hash value of the filtered summary file as a time authentication certification target. In case
A verification management unit that acquires and manages data of the plurality of entries, a summary file created in the user terminal, and a time authentication certificate; and a hash for entry applied to the entry In a state having function management means for managing the hash function for the summary file applied to the function and the summary file,
The verification device includes:
A legitimacy verification step for verifying that the time authentication certificate managed in the verification management means is correct and not falsified;
The hash value of each entry is re-applied by applying the entry hash function managed by the function management unit to the verification target among the plurality of entries managed by the verification management unit. A hash value recalculation step to calculate,
A hash value acquisition step of acquiring a hash value of a corresponding original entry in a summary file representation constituting a filtered summary file in which desired information is previously blocked by the pre-filter means according to claim 1;
A hash value comparison step for comparing whether or not the hash value of the entry recalculated by the hash value recalculation step matches the hash value acquired by the hash value acquisition step;
A summary file hash for recalculating the hash value of the filtered summary file by applying the summary file hash function managed by the function management unit to the summary file managed by the verification management unit A value recalculation step;
A summary file hash value acquisition step of acquiring a hash value of the original filtered summary file included in the time authentication certificate managed by the verification management unit;
Compare whether the hash value of the filtered summary file recalculated in the summary file hash value recalculation step matches the hash value of the original filtered summary file acquired in the summary file hash value acquisition step Summary file hash value comparison step,
The verification method characterized by performing. The verification method according to claim 7, comprising:
When the user terminal executes the bulk time authentication request program according to claim 2, a time authentication request is made to the time certification authority using the hash value of the secondary summary file as a time authentication certification target. In case
Managing a hash function for a secondary summary file to be applied to the secondary summary file in the function management means,
In the hash value acquisition means, the pre-filter means according to claim 2 is used to express a summary file that constitutes a specified filtered summary file among a plurality of types of filtered summary files in which desired information is previously blocked. Get the hash value of the corresponding original entry of
In the summary file hash value acquisition step, a hash value of a filtered summary file designated among the plurality of types of filtered summary files is acquired from the secondary summary file,
Further, in the summary file hash value recalculation step, the summary file hash value acquisition step, and the summary file hash value comparison step, in addition to the filtered summary file designated among the plural types of filtered summary files, 2 A verification method characterized in that the next summary file can be processed. A new hash value is created from the hash values of a plurality of entries as an electronic folder or electronic file, and the user makes a time authentication request to the time certification authority using the one hash value as a proof of time authentication. A verification method using a verification device that verifies the validity of the time authentication certificate acquired by the user after acquiring the time authentication certificate,
The user terminal defines an entry hash function defined for each entry and applies to the entry and a summary function hash function applied to the summary file, and a file management that manages the summary file. Means, applying a hash function for entry managed by the terminal function management means to each of the plurality of entries, and creating a hash value of each entry, and the hash value creation means A summary file expression creating means for creating a summary file expression for each entry by associating a hash value of each entry created with the identifier identifying each entry, and for each entry created by the summary file expression creating means Summary file representation synthesizer that combines summary file representations If the summary file storage means for storing the summary file created as a result of coupling summary file represented by the summary file representation combining means to said file management means, the terminal function with respect to the summary file stored in the file management means Applying a summary file hash function managed by the management means to create a hash value of the summary file, and a summary file hash value creating means,
A verification management unit that acquires and manages data of the plurality of entries, a summary file created in the user terminal, and a time authentication certificate; and a hash for entry applied to the entry In a state having function management means for managing the hash function for the summary file applied to the function and the summary file,
The verification device includes:
A legitimacy verification step for verifying that the time authentication certificate managed in the verification management means is correct and not falsified;
The hash value of each entry is re-applied by applying the entry hash function managed by the function management unit to the verification target among the plurality of entries managed by the verification management unit. A hash value recalculation step to calculate,
A post-filtering step for later shielding desired information of the summary file managed by the verification management unit;
A hash value acquisition step of acquiring a hash value of a corresponding original entry in the summary file representation constituting the summary file shielded by the post-filter step;
A hash value comparison step for comparing whether or not the hash value of the entry recalculated by the hash value recalculation step and the hash value acquired by the hash value acquisition step are the same;
The summary file hash value re-calculation is performed by applying the summary file hash function managed by the function management unit to the summary file managed by the verification management unit and recalculating the hash value of the summary file. A calculation step;
A summary file hash value acquisition step of acquiring a hash value of the original summary file included in the time authentication certificate managed by the verification management means;
Summary file hash value for comparing whether the hash value of the summary file recalculated in the summary file hash value recalculation step is the same as the hash value of the original summary file acquired in the summary file hash value acquisition step A comparison step;
The verification method characterized by performing.   A verification program that causes the verification device according to claim 7 to execute the steps according to claim 7.   A verification program that causes the verification device according to claim 8 to execute the steps according to claim 8.   A verification program that causes the verification device according to claim 9 to execute the steps according to claim 9.   A computer-readable recording medium for verification, wherein the verification program according to any one of claims 10 to 12 is recorded.

Images