JP4235193B2 - Event history storage device, event information verification device, event history storage method, event information verification method, and event information processing system - Google Patents

Description

The present invention includes an event history storage device and a method for storing the occurrence history of the event information using event hash creation techniques to create an event hash value used to manage the generation history of the event information, the event history storage technology The present invention relates to an event information verification apparatus and method for verifying event information using event history information accumulated by the above, and an event information processing system constructed by the event history accumulation apparatus and event information verification apparatus .

  There are several ways to store the movement of an object as an electronic record and realize that the person who receives it confirms its origin and passage history.

  Many of them store "time", "location", and "object identification information" in an IC tag or network storage device, and later confirm (trace) history information by referring to the stored information. (See, for example, Patent Documents 1 and 2 and Non-Patent Document 1).

  For example, information such as “time” and “location” is added / accumulated in an IC tag at a passing base or base, and a person who receives the IC tag refers to the information in the IC tag. The history is confirmed. As another example, information such as “time”, “location”, and “identification information” is added to and stored in a storage device such as a database at the base where the thing has passed and the base, and the information is stored on the network. The history information can be referred to from a plurality of users by connecting devices.

  The order of the history depends solely on the stored time information. The time is the time information of the client system at the base where the passage of the object is detected, or the time information held by the storage function (IC tag itself or history storage device). It is based. With regard to the accuracy of the time, a person can adjust the time appropriately using the time tuning function of the device itself, or provide a time correction function such as NTP (Network Time Protocol) to keep the time of related equipment accurate. This is an effort. When checking the history, it is common to consider that events have occurred in the order of the accumulated time information.

In general, there is a hash chain as a means for verifying the continuity of the order of information, and a plurality of hash values Hmn are inputted to a hash function F to obtain a new hash value Hn + 1. The resulting hash value H column shows the context,
Hn + 1 = F (H1n, H2n,..., Hmn)
It is known that it is possible to verify using the fact that the above relationship holds (for example, see Non-Patent Document 2).

  Since Hn and Hn + 1 are closely related via a hash function, it is virtually impossible to insert a new Ha between Hn and Hn + 1. When inserting, it is necessary to recalculate all hash values after Hn + 1 by obtaining F (Hn, Ha).

Examples of services using the nature of the hash function include a time stamp service (see, for example, Non-Patent Document 2) and an electronic document existence proof service provided by NTT DATA Corporation using the technology of US Surety Corporation ( For example, refer nonpatent literature 3).
JP-A-7-61532 JP-A-8-268513 EPCglobal Version 1.0 Specifications. Savant Specification. [Online], Internet <URL: http://www.epcglobalinc.org/about/AutoID-Archive/documents/6-auto-id-savant-1-0.pdf> Encyclopedia of Cryptography, by Bruce Schneier, "Chapter 4.1 Time Stamp Service Connection Protocol" NTT Data Corporation, “Secure Seal”, [On line search on March 24, 2005], Internet <URL: http://www.ssc.nttdata.co.jp/outline/outline01.html>

  When event information (thing identification information, time information, location information, etc.) indicating the passage of goods or operations on goods is stored in the storage device as an input, the system timer on the client side that creates the event information is accurate. If there is an error in time that cannot be ignored between clients, or if the time of the server that accumulates the history is changed, the order of the stored event information becomes unreliable.

  In the prior art, an accurate NTP server is used to coordinate the system time of the client side and the server. For this purpose, all client and server devices must adjust the time using NTP. However, it is impossible to deal with devices having independent clocks such as IC tags and portable terminals and devices that cannot receive network services.

  If no NTP server is used, it is difficult to keep the time of all devices involved in creating event information within a certain range of error.

  Also, the possibility that the stored information has been tampered with or that different information has been stored for some reason cannot be dispelled. It was necessary and proved to be a problem.

  In addition, when referring to the history accumulated at the same time, it is necessary to check whether or not the event information as the return information has been tampered with, which is a problem.

  In view of such circumstances, the present invention detects the movement of an object or an operation on the object and generates time information of the device that generates event information, and the time of the device that stores the event information is not accurate. Even if the information is inaccurate, it provides a means to guarantee the storage order and make it verifiable by using the properties of the hash chain, and that the accumulated event information has been altered for some reason. The purpose is to provide a means that can be detected using the properties of a hash chain.

  On the other hand, when event information creation is lost in a client or the like in the process of storing event history information, it is necessary to insert the missing event into the data of the history information storage device after the fact.

  However, in the conventional hash chain calculation method, inserting a new hash value into a once created hash chain requires recalculation of all hash values after the insertion point. In some cases, a large amount of calculation is required, which is a problem.

  In consideration of such circumstances, when the present invention achieves the above-described object using a hash chain, when event information is missing, and then when the missing event is inserted, An object of the present invention is to provide means for reducing the amount of calculation compared to a conventional hash chain calculation method.

  In order to achieve the above object, the present invention positions a node associated with event information (hash node: basically records event information and a hash value created therefrom) as a basic element of recording. By creating a hash node that creates a hash value for each event information that occurs and records it, and chaining the generated hash nodes in the order in which they were generated, it is difficult to tamper with the event A system capable of verifying the order of information generation is realized.

  Here, it is preferable that this hash node records the event information and the hash value created therefrom, but if the event information is stored in another storage device, do not record the event information, The present invention can also be realized by recording information indicating which storage device is stored in which storage position.

  The event information processing system of the present invention includes an event history storage device and an event information verification device described below.

[1] Configuration of the event history storage device of the present invention The event history storage device of the present invention stores an occurrence history of event information, and in order to realize this,
(A) an input means for inputting event information including at least time information, location information, and item identification information;
(B) Creates a hash value corresponding to the input event information based on the input event information and the hash value generated according to the event information input previously for the same event information component value And generating means for generating a hash node which is defined as a hash node associated with the input event information and records the created hash value and the input event information,
(C) Create a hash node chain by setting a parent-child relationship with the hash node generated one time earlier for the same event information component value as the newly generated hash node, and store the hash node chain Execution means for storing in the device;
And (d) provided in the generator operates to insert the new Ha Sshunodo already in the hash node chain that is generated, with the insertion source hash nodes and the newly generated hash node the branch information recording area, when verify the hash node chain, instructs to perform the verification according to the relationship between the separate insertion source Ha Sshunodo the verification according parentage hash node chain, event information generated sequence the when verifying the insertion source in the recording child branch display information instructing to perform the validation in preference hash Shunodo connected by a parent-child relationship in the hash node, additional means that perform the insertion When,
(E) provided to the generating means operates to delete a certain hash Shunodo with the hash node chain that is generated already, the state record area with the hash node of that verifies the hash node chain the time, instructing to perform instructs to perform the verification it is therefore a parent-child relationship of the hash node chain, when verify the order of occurrence of the event information, the verification is regarded as the event information is not registered by recording information deletion display of a deleting means for executing the deletion,
(F) When a certain operation is performed on a plurality of objects, a hash value corresponding to the operation information is based on the hash value corresponding to the event information of those objects and the operation information. And an operation event processing means for generating an operation event node for recording the operation information and the generated hash value and storing the operation event node in the operation event node storage device.

  When adopting this configuration, if the execution means is to use another storage device in place of the storage device used so far, the execution means will last with respect to the storage device used so far. The storage device used so far when processing the hash nodes stored in the storage device to be stored in the storage device to be used in the future and storing the hash node chain in the storage device to be used in the future. You will be able to enter that accumulation without referring to.

  The event history storage method of the present invention realized by the operation of each of the above processing means can also be realized by a computer program, and this computer program is provided by being recorded on a suitable computer-readable recording medium. The present invention is realized by being provided via a network, installed when the present invention is implemented, and operating on a control means such as a CPU.

[2] Configuration of Event Information Verification Device of the Present Invention The event information verification device of the present invention is verified by referring to the hash node chain storage device that stores the hash node chain generated by the event history storage device of the present invention. In order to verify the event information given as the target,
(A) search range setting means for narrowing down the search range on the hash node chain based on the event information to be verified;
(B) All hash nodes included in the narrowed search range as processing targets, event information associated with the processing target hash node, and hash recorded by the hash node immediately before the processing target hash node The hash node chain is validated by creating a hash value based on the value and repeatedly evaluating whether the created hash value matches the hash value recorded by the hash node to be processed. A verification means for verifying the event information to be verified based on the evaluation result,
(C) output means for outputting a verification result ;
(D) It is provided in the verification means and operates when branch display information is recorded in the branch information recording area of the hash node on the hash node and the hash node chain to be processed , and the hash node chain is verified. When verifying the order of occurrence of event information, the verification is performed between the hash nodes where the branch display information is recorded separately from the verification according to the parent-child relationship of the hash node chain. and additional hash node verification means for performing a verification of that form to prioritize than hash node hash node in question the branch displays information linked by parent-child relationship in the hash node on the hash node chain recorded,
(E) It operates when the delete display information is recorded in the state recording area of the hash node to be processed provided in the verification means, and when the hash node chain is verified , the delete display information It executes the validation form to ignore, whereas, when verifying the occurrence order of the event information, verification deletes the hash node considers the event information is not registered in accordance with the deleted displayed information to perform the verification And a means is provided.

  Here, the verifying means first verifies whether the event information to be verified matches the event information associated with the hash node, thereby not verifying the event information to be verified. Extraction and then evaluating the validity of the hash node chain to verify whether the event information to be verified has not been tampered with and the order of occurrence of those event information, or first Next, the validity of the hash node chain is evaluated, and then the event information to be verified is not falsified by verifying whether the event information to be verified matches the event information associated with the hash node. Whether or not and the occurrence order of the event information are verified.

In the case employing this arrangement, the verification unit, when the hash node to be processed is registered in the form of branches from the hash node chain, with additional hash node verifying means, corresponds to the hash node of that A hash value is created based on the event information to be attached and the hash value recorded by the branch source hash node, and it is evaluated whether the created hash value matches the hash value recorded by the hash node. .

Also, the verification means, the status recording area with the hash node to be processed, if the information indicating that the hash node that was deleted is recorded, with the deletion hash node verifying means, information of that When verifying the validity of the hash node chain in a form that ignores the event information and verifying whether the event information to be verified matches the event information associated with the hash node, the verification is performed in consideration of that information. Do.

  Further, when the operation event node is stored in the operation event node storage device by the event history storage device of the present invention, the verification means records the operation event node using the hash value as the verification target for the operation information. The operation information to be verified is verified by evaluating the validity of the operation information to be verified and verifying whether or not the operation information to be verified matches the operation information evaluated as valid.

  The event information verification method of the present invention realized by the operation of each of the above processing means can also be realized by a computer program. This computer program is provided by being recorded on a suitable computer-readable recording medium. The present invention is realized by being provided via a network, installed when the present invention is implemented, and operating on a control means such as a CPU.

[3] Implementation of the event information processing system of the present invention For the objects handled in the present invention, event information is generated across multiple bases, and event information is generated across multiple bases. There is. For example, there are things that generate event information only in company A and company B, and things that generate event information in both company A and company B by being transferred from company A to company B. is there.

  For event information of things that do not cross multiple sites, the event history storage device of the present invention is provided at each site, and the hash node chain is stored in the local hash node chain storage device provided therein. On the other hand, for event information of a thing across a plurality of bases, the event history storage device of the present invention is provided in a form shared by each base, and the hash node chain is included in the global hash node chain storage device provided therein. It is preferable to adopt a configuration of accumulating.

  In the case of adopting such a configuration, when event information about a certain thing occurs, it is determined whether the thing is across multiple bases or not across multiple bases. Based on the determination result, for an item that does not cross a plurality of bases, the event information is transferred to the event history storage device of the present invention provided in association with the base where the event information is generated, while crossing a plurality of bases For the goods, a distribution mechanism is prepared for transferring to the event history storage device of the present invention provided in a shared form at each site.

  Here, the event information verification device of the present invention can be configured to correspond to each of the event history storage devices of the present invention, and a plurality of the present invention can be obtained by using a communication network. It is also possible to adopt a configuration in which the event history storage device is provided in a shared form.

[4] Operation of the present invention [4-1] Operation of the event history storage device of the present invention The event history storage device of the present invention configured as described above comprises at least time information, place information, and item identification information. When event information is generated, first, the event information is input.

  Subsequently, based on the input event information and the hash value created according to the event information input the previous time for the same event information component value (for example, the same thing), the input event information A corresponding hash value is created and defined as a hash node that is associated with the input event information, and a hash node that records the created hash value and the input event information is generated.

For example, if the input event information is represented by En, the hash value created according to the event information previously input for the same event information component value is represented by Hn-1, and the hash functions are represented by F, F ₁ and F _2. If
Hn = F (En, Hn-1)
The hash value Hn corresponding to the input event information is created according to the relational expression, or the temporary hash value Tn is created according to F ₁ (En).
_{Hn = F 2 (Tn, Hn} -1)
The hash value Hn corresponding to the input event information is generated according to the relational expression, and a hash node for recording the generated hash value Hn and the input event information En is generated.

  Subsequently, the hash node chain storage device generates a hash node chain by setting a parent-child relationship with the previously generated hash node for the same event information component value as the newly generated hash node. To accumulate.

  That is, the node identification information of the newly generated hash node Qn is represented by Nn, the previous node pointer of the hash node Qn is represented by PPn, and the hash event Qn-1 of the previously generated hash node Qn-1 for the same event information component value is represented. If the node identification information is represented by Nn-1, and the next node pointer of the hash node Qn-1 is represented by PFn-1, the node identification information is set to Nn-1 in the previous node pointer PPn of the hash node Qn. By setting the node identification information Nn to the next node pointer PFn-1 held by the hash node Qn-1, a hash node chain is generated and stored in the hash node chain storage device.

  Since the hash node chain accumulated in this way has the property that it is difficult to tamper with and the generation order can be verified, it can be verified whether the event information recorded in the hash node has been tampered with. And the generation order of the event information recorded in the hash node can be verified.

  However, the hash node chain has the property that it is difficult to add a hash node and it is difficult to delete the hash node as a reverse of the property that can realize such a thing.

  Therefore, in the event history storage device of the present invention, when a newly generated hash node is added to an already generated hash node chain, the newly generated hash node and the branch source of the hash node chain are used. Addition is performed by setting a branching relationship with the hash node.

  That is, the hash node that is the branch source of the hash node chain is Qn, the node identification information of the hash node Qn is Nn, the branch destination pointer of the hash node Qn is PBn, the hash node to be added is Qb, and the hash node Qb If the node identification information of Nb and the branch source pointer of the hash node Qb are represented by PRb, the node identification information Nb is set in the branch destination pointer PBn of the hash node Qn and the branch source pointer of the hash node Qb By adding the node identification information Nn to PRb, addition of the hash node Qb is executed.

  If such an addition method is used, it is not necessary to recalculate the hash value of the hash node chain that has already been generated, so that a hash node can be added very easily.

  Then, in the event history storage device of the present invention, when deleting a hash node that has already been generated in the hash node chain, it is determined that the deleted hash node is in the state recording area of the hash node. The deletion is executed by setting the indicated information.

  That is, instead of deleting the hash node from the hash node chain, the deletion is executed by setting information indicating that the hash node has been deleted in the status recording area of the hash node. .

  If such a deletion method is used, it is not necessary to recalculate the hash value of the already generated hash node chain, so that the hash node can be deleted very easily.

  On the other hand, in addition to event information related to an object, there is a case where it is desired to verify operation information applied to a plurality of objects.

  Therefore, in order to respond to such a request, in the event history storage device of the present invention, when a certain operation is performed on a plurality of things, hash values corresponding to the event information of those things and information on the operations Based on the above, a hash value corresponding to the operation information is created, and an operation event node that records the operation information and the created hash value is generated and stored in the operation event node storage device Is adopted.

  In this way, the event history storage device of the present invention creates a hash value for each event information generated when event information including at least time information, location information, and item identification information is generated, and the generated hash A hash node that records a value and its event information is generated, a hash node chain is generated by chaining the generated hash nodes in the order of generation, and processing is performed so as to store the hash node chain in the hash node chain storage device. .

  When a certain operation is performed on a plurality of objects, a hash value corresponding to the operation information is created based on the hash value corresponding to the event information of the objects and the operation information. Then, an operation event node for recording the operation information and the created hash value is generated and processed so as to be stored in the operation event node storage device.

[4-2] Operation of the event information verification device of the present invention In response to the processing of the event history storage device of the present invention, the event information verification device of the present invention configured as described above makes a request for verification of event information. If there is, first, the search range on the hash node chain is narrowed down based on the event information to be verified.

  For example, by specifying the time zone when the event information occurred from the event information to be verified, the search range on the hash node chain is narrowed down, or the hash node that records the event information from the identifier of the event information to be verified By specifying, the search range on the hash node chain is narrowed down by narrowing down the search range on the hash node chain.

  Subsequently, with all hash nodes included in the narrowed search range being processed, event information recorded by the hash node to be processed and a hash value recorded by the hash node immediately before the hash node to be processed The hash value is created based on the above, and the validity of the hash node chain is evaluated by repeatedly evaluating whether the created hash value matches the hash value recorded by the hash node to be processed. Then, the event information to be verified is verified based on the evaluation result.

  In other words, if the evaluation result that the hash node chain is valid is obtained and it is found that the event information recorded by the hash node has not been tampered with, the event information to be verified and the record of the hash node associated therewith are recorded. The event information to be verified is determined to be valid if it matches, and if not, the event information to be verified is valid. It is judged that it is not a thing.

  As another method, before evaluating the validity of the hash node chain, it is verified whether the event information to be verified matches the event information recorded by the hash node associated therewith. If not, it immediately determines that the event information to be verified is not valid, and if it matches, evaluates the validity of the hash node chain and evaluates that the hash node chain is valid Is obtained, it is determined that the event information to be verified is valid.

  Here, if the evaluation result that the hash node chain is valid cannot be obtained, the event information recorded by the hash node may be falsified, so the event information to be verified is verified. You can't do that.

  Subsequently, by outputting the verification result, it is output which verification target event information has been verified. At this time, the verified event information may be output side by side on the hash node chain, and the generation order thereof may also be output.

  When performing this verification, the event history storage device of the present invention may add a hash node to the hash node chain using a branching relationship, so that the hash node is additionally registered in the form of branching from the hash node chain The hash value is created based on the event information recorded by the added hash node and the hash value recorded by the branch source hash node, and the created hash value is stored in the hash node of the added hash node. By evaluating whether or not it matches the hash value to be recorded, it is determined whether or not the event information recorded by the added hash node is valid.

  In addition, since the event history storage apparatus of the present invention may delete the hash node from the hash node chain by setting the deletion information in the state recording area of the hash node, the state recording area of the hash node to be processed has If deletion is set, the validity of the hash node chain is evaluated in a form that ignores the deletion information, and whether the event information to be verified matches the event information recorded by the hash node associated with it When verifying whether or not, if the deletion information is set, it is determined that they do not match, thereby verifying the event information to be verified.

  In addition, since the event history storage device of the present invention may generate an operation event node and store the operation event node in the operation event node storage device, if the operation event node is stored, the operation information is also a verification target, By creating a hash value of the operation event node associated with the operation information to be verified and evaluating whether the created hash value matches the hash value recorded by the operation event node, the operation event Evaluate whether the operation information recorded by the node is valid or not, and if it is evaluated that the operation information is valid, whether the operation information matches the operation information to be verified By verifying, the operation information to be verified is verified.

  Here, if the evaluation result that the operation information recorded in the operation event node is valid cannot be obtained, the operation information may be falsified. You can't do it.

  As is clear from the above description, the present invention has the following effects.

(1) Effect of using a hash node chain Information on newly generated events is unpredictable, and in order to tamper with a hash node chain, a consistent hash value is discovered before and after, and the original information is It must have a meaningful format / value as event information. Therefore, it is virtually impossible to tamper with the hash node chain. Thus, according to the present invention, the event information can be accurately verified.

(2) Effect of storing event information (time, place, ID) as it is Time information is ambiguous and will not be used as information for verifying the order of event information. By using as a key, the search range can be easily narrowed down. Thus, according to the present invention, the search range of event information can be easily narrowed down.

(3) Effect of additional deletion method that minimizes the impact on the existing hash node chain When using a data structure that records hash values called hash nodes, hash values in the middle of the existing event history and other It is possible to insert / delete another hash node without recalculating the additional information, thereby improving the flexibility of the history information. This makes it possible to add unread event information such as an IC tag with a low reading rate later in an appropriate environment, or to delete event information registered by erroneous reading. Thus, according to the present invention, a practical system can be constructed.

(4) Effectiveness of verification processing The order of event information can be verified without using time information input from an event generation terminal or the like. Thus, according to the present invention, the order of event information can be verified without using ambiguous time information.

  Hereinafter, the present invention will be described in detail according to an embodiment in which event information En including “object identification information”, “time information”, and “location information” is used.

  FIG. 1 shows an example of an event hash value creation flow in the present invention. In the drawings, the event hash value may be simply referred to as a hash value.

  As shown in this creation flow, when creating an event hash value, first, the first event hash value H0 is determined (step S10), and then 1 is set to the variable n (step S11).

  Subsequently, after waiting for the input of the event (step S12) and receiving the input of the event, the event information En is selectively acquired from the input information (step S13), and the acquired event information En is input to the hash function F. A temporary hash value Tn is created (step S14).

  Subsequently, a new event hash value is created by inputting the created temporary hash value Tn together with the previously created event hash value Hn-1 to the hash function F, and the event hash of the input event is created. A value Hn is set (step S15). Subsequently, after the value of the variable n is incremented by 1 (step S16), the input of the event is waited again (step S12).

  Thereafter, the same processing is repeated every time an input event is received. As a result, a chain of event hash values consisting of Hn (n ≧ 1) is created.

  If the chain of event hash values created in this way is altered, the context Hn = F (F (En), Hn-1) does not hold or the input event is given from the outside. When it is an unpredictable value, it has a feature that forged data cannot be replaced.

  FIG. 2 shows the data flow when creating the event hash value. Here, how to use the hash function depends on how the same function is used or how many times it is used.

  FIG. 3 shows a configuration example of the hash node chain, and FIG. 4 shows a conceptual diagram when configuring the hash node chain.

  Next, the hash node and its chain will be described with reference to FIGS.

  Since only the event hash value created by the creation flow of FIG. 1 cannot hold the history search and information related to the event, as shown in FIG. By configuring, it is realized as history information that is meaningful for information processing.

  Here, 311 and 321 are node IDs, which are identification information for uniquely identifying hash nodes. Reference numerals 312 and 322 denote deletion flags, which are information indicating whether or not the hash node is in a deleted state. Reference numerals 313 and 323 denote product IDs, which are information for identifying products in which this event has occurred. Reference numerals 314 and 324 denote reader IDs, which are information for identifying the reader that has read the event, and are information for specifying the location if the reader is generally fixed. Reference numerals 315 and 325 are time stamps, which are time information when this event occurs. Reference numerals 316 and 326 denote parent node IDs, which are pointers to upper hash nodes. Reference numerals 317 and 327 denote child node IDs, which are pointers to lower hash nodes. Reference numerals 318 and 328 denote hash values (event hash values) of event information created by the event hash creation means (480 shown in FIG. 4) of the present invention.

  As can be seen from FIG. 4, when the event hash value 420 is input from the event hash creation means 480 when there is a predetermined root hash node 410, the root hash node is determined after determining the node ID of the hash node 450. The node ID is set to the child node ID 410. In addition to setting the node ID, the hash node 450 stores the node ID of the root hash node 410 as the parent node ID, the event hash value 420 input as the event hash value, and the event a Product ID information, reader ID information, and time stamp information are obtained and stored.

  Hereinafter, when events b and c are input, a chain of serial hash nodes is similarly created. At this time, the hash node created last becomes the current hash node, and becomes one of the input information when creating the event hash when the next event is inputted.

  As a result, by connecting event information of the same thing ID that is one hash node chain, an information chain that can trace the movement history of the thing can be realized, and event information having the same leader ID can be connected. By doing so, it is possible to realize an information chain that can trace the order of things that have passed through a certain place.

  Next, a method for accumulating operation event history information will be described with reference to FIGS. 5, 6, and 7.

  First, in order to ensure the uniqueness of operation event history management, a chain of hash nodes is configured using information on an object related to the operation type and time information on the operation.

  FIG. 5 is an image diagram showing an operation of packing two boxes 510 and 520 in one outer box 530.

  FIG. 6 shows an event type “boxed”, an event that detects a boxed outer box 530 as an event parent node, an event that detects two packed boxes 510 and 520 as an event child node, and a hash node chain. An example of configuration is shown.

  The hash node 630 represents the outer box 530, and the item ID of the outer box 530, the time information when it is detected as an event, and the reading reader ID are set, so that it is possible to know when and what is detected. ing. Hash nodes 640 and 650 represent boxes 510 and 520 to be packed, respectively. Similarly, it is possible to know when and what is detected.

  The operation event node 660 represents an operation for the boxes 510 and 520 and the outer box 530. The event parent 1 item ID 661 is set with the mono ID of the outer box 530, and the event child 1 item ID 662 is set with the mono ID of the box 510. The event child 2 product ID 663 is set with the product ID of the box 520, the event type 665 is set with information indicating the boxing operation, and the time stamp 664 is set with the operation (boxing) time. The node ID of the hash node 630 is set in the parent node ID 666, the node ID of the hash node 640 is set in the event child 1 node ID 667, and the node ID of the hash node 650 is set in the event child 2 node ID 668. .

  In order to uniquely identify related information based on the operation based on the above information, the event type 665 and the event hash values 631, 641, 651 related to the time stamp 664 are used as inputs. Similar to the processing described above, the operation event hash value 669 is generated and stored using a hash function.

  FIG. 7 shows an example in which an operation event history is created with a plurality of items, and for the item IDs 001, 002, 003, 004, 005, 006, the state of storing the chain of hash nodes 711, 712, 713, 714, 715, 716.

  The operation event nodes 721, 722, 723, 724, and 725 are operation event nodes (hash nodes), respectively. For example, the operation event node 721 has a product with an item ID 001 of hash nodes 731 → 732 → 733 → This indicates that an operation has been performed when an item with the product ID 004 is detected as the hash node 735 when a history of 734 is passed.

  Next, a method for adding halfway hash nodes will be described with reference to FIGS.

  For example, when information such as an IC tag is read from a reader and handled as an event, there is a case where event leakage occurs because information on a certain item cannot be read due to information reading failure. At this time, if what has already been read is registered as a hash node chain, adding it may require a great deal of processing such as recalculation of the event hash value.

  Therefore, in order to avoid this, in the present invention, the added hash node is branched in order not to affect the event hash value stored in the existing hash node.

  FIG. 8 shows a state in which a hash node 850 (event C) is added between the hash node 820 (event A) and the hash node 830 (event B).

  FIG. 9 shows a configuration example of a hash node in that case. By providing a branch node ID 913 and a branch source node ID 932 as hash node correlation information, a hash node 930 is provided between the hash node 910 and the hash node 920. Can be inserted.

  When a value is set in the branch node ID 913 during the hash node search, the event C is inserted between the event A and the event B by searching with priority over the child node ID 912 in the hash node. The state can be realized. At this time, the event hash value 933 of the added hash node 930 is created by the event hash value creation method described above using the event hash value 914 stored in the hash node 910 that is the branch source.

  Next, a hash node deletion method will be described with reference to FIGS.

  For example, it is necessary to delete the stored hash node due to erroneous reading or storage device failure. At this time, if what has already been read is registered as a hash node chain, a large amount of processing such as recalculation of an event hash value may be required for deletion.

  Therefore, in order to avoid this, in the present invention, the deletion flag of the hash node prepared in advance is set to ON, and when the value of the deletion flag is set to ON when searching for the hash node, the hash node is skipped. The hash node deletion is realized without affecting the event hash values stored in the preceding and following hash nodes. However, when the hash node corresponding to the child node is verified, the event hash value stored in the deleted hash node is still used.

  FIG. 10 shows a state in which the hash node B is deleted. FIG. 11 is a configuration example of the hash node in that case. When the hash node 1131 corresponding to the child node of the deleted hash node 1121 is verified, the event hash value 1122 stored in the deleted hash node 1121 is still used.

  Next, a method for verifying event history information will be described with reference to FIG. 12, FIG. 13, and FIG.

  Here, FIG. 12 is a schematic diagram of event verification, FIG. 13 is an example of an event verification flow, and FIG. 14 shows a data flow during event verification.

  As shown in FIG. 12, the event verification unit 1230 receives the event group 1200 to be verified (a list of events that are external input event groups to be verified and include a product ID, a reader ID, and an event occurrence time). Are acquired in the order of the hash node chain storage device 1240 and verified, and the event that has been verified successfully is returned using the verified event list 1220, and the event that has failed verification is returned using the unverified event list 1210 return.

  FIG. 13 shows an example of the verification flow.

  As shown in this verification flow, when one or more external event information is received as a verification target (step S1310), hash node information corresponding to the input verification-target event information is received from the hash node chain storage device 1240. All are acquired (step S1311). At this time, event information that does not exist in the hash node chain storage device 1240 is added to the unverified event list 1210 (step S1312).

  Here, in this step S1311, it is checked whether or not the event information to be verified and the event information recorded on the hash node chain associated therewith are completely matched, and the hash node chain for those that completely match. When the hash node information is acquired from the storage device 1240 and event information that does not exist in the hash node chain storage device 1240 is input as a verification target, the event information is immediately stored in the unverified event list 1210. Will be added.

  Note that the event information recorded on the hash node chain has been falsified, and the event information to be verified may not be stored in the hash node chain storage device 1240. In this case, the event information Since verification cannot be performed, there is no problem with adding event information to be verified to the unverified event list 1210.

  Subsequently, the acquired hash nodes are sorted in the order of node IDs, and using the maximum node number M and the minimum node number N, all the numbers between the Mth and Nth from the hash node chain storage device 1240 again. The hash node information and the hash node information with the node ID = N−1 are acquired (step S1313).

  The verification process of each hash node starts from the Nth hash node (step S1314), and inputs the event information of the mono ID, reader ID, and time included in the hash node to be verified to the hash function, thereby providing a temporary hash. A value Tn is created (step S1315). Then, an event hash value is created by inputting the created temporary hash value Tn and the event hash value Hn-1 stored in the parent hash node into a hash function, and the created event hash value is It is verified whether the hash value Hn of the hash node to be verified is equal to the event hash value Hn (step S1316).

  If the event hash value to be verified is not broken or the event information has not been tampered with, the two event hash values match at this time and the verification succeeds (step S1317). At this time, it is added to the verified event list 1220 (step S1318).

  On the other hand, if the event hash value to be verified is broken or the event information is falsified, the two event hash values do not match at this time and the verification fails (step S1317). If there is a hash node that does not match at the time of verification, the hash node to be verified after that is added to the unverified event list 1210 without verification (step S1321).

  As described in the hash node deletion method described above, all hash nodes are subject to verification regardless of the deletion state of the hash nodes. If no hash node is found (step S1312), the hash node may be returned as a non-verification target. In addition, when sorting is performed in order of node ID in step S1313, if there is a branch node, the hash nodes in the branch are preferentially searched and arranged.

  The verification described above continues until the hash node obtained in step S1313 ends (steps S1319 and S1320). The verification result is obtained by returning the verified event list 1220 and the unverified event list 1210 (step S1322). At this time, depending on the implementation, the verification mismatch list and the non-target list including hash nodes that are not in the verification range may be returned separately.

  Here, in the verification flow shown in FIG. 13, in step S1311, it is checked whether or not the event information to be verified and the event information recorded on the hash node chain associated therewith completely match. Hash node information is acquired from the hash node chain storage device 1240 for those that match the above, but the hash node chain storage device 1240 is unconditionally obtained with respect to the event information to be verified without determining such a match. After the hash node information is obtained from step S1317 and the validity of the hash node is confirmed in step S1317, whether the event information to be verified and the event information recorded in the hash node associated therewith completely match or not. And verify the event list accordingly. 1220 and may be distributed to the unverified events list 1210.

  In this way, the event verification unit 1230 acquires and verifies the received event group 1200 to be verified in the order that the hash node chain storage device 1240 has, as shown in FIG. Is returned using the verified event list 1220, and event information that has failed verification is returned using the unverified event list 1210.

  Here, although not described in the verification flow of FIG. 13, when the operation event node described in FIGS. 5 to 7 is accumulated, the operation information is verified using information recorded in the operation event node. It will be.

  That is, an operation event hash value is created by inputting the event type recorded in the operation event node associated with the operation information to be verified, the operation time information, and the related thing event hash value into the hash function. By verifying whether the created operation event hash value is equal to the operation event hash value recorded by the operation event node, it is evaluated whether the operation information recorded by the operation event node is valid. If the operation information is evaluated as valid, the operation information to be verified is verified by verifying whether the operation information matches the operation information to be verified. Become.

  Next, an event history information storage system realized by the present invention will be described with reference to FIG.

  As shown in this figure, an event history information storage system 1500 realized by the present invention includes, as an example, an event generation terminal 1510, 1520, 1530, an event original storage device 1540, a hash node chain storage server 1550, And a network 1560 connecting them.

  The event generation terminal 1510 includes an event information transmission / reception unit 1511, an event information acquisition / creation unit 1512, a mono ID information acquisition unit 1513, a location information acquisition unit 1514, a time generation unit 1515, and an IC tag reader / writer 1516. The other event generation terminals 1520 and 1530 have the same configuration.

  The event original storage device 1540 stores the event original (event information) itself in the event original storage means 1541. For example, the event original storage apparatus 1540 applies the event information to the user by the event search means 1542 and the event reference means 1543. Service is provided.

  Here, as a means for accumulating the original event, a portable event accumulating means 1580 (for example, an IC card or an IC tag with a memory) that moves together with the box 1570 is used to store event information and move together with the box 1570. You may let them.

  The hash node chain storage server 1550 is a server that implements and includes each method of the present invention as means, and includes an event hash creation means 1551, event history storage means 1552, event history addition means 1553, and event history verification means 1554. An event history deleting unit 1555, an operation event registering unit 1556, and a hash node chain storage device 1557.

  Here, in the example of this figure, it is assumed that the hash node chain storage device 1557 stores the individual hash node chains and stores the history for each of the three items of the thing ID = A, B, C. is doing.

  In the event history information storage system 1500 configured as described above, for example, when the box 1570 to which the IC tag 1571 is attached moves from the event generation terminal 1510 → the event generation terminal 1520 → the event generation terminal 1530, the IC tag 1571 When the content (mono ID) is read by the IC tag reader / writer 1516, 1521, 1531, the mono ID is first acquired by the mono ID information acquisition means 1513 through the IC tag reader / writer 1516, and at the same time, the location information is acquired. The reader ID is acquired by the means 1514, the time of the system timer, for example, is acquired by the time generation means 1515, and is processed into event information by the event information acquisition / creation means 1512.

  Event information created by the event generation terminal 1510 in this way is passed to the event original storage device 1540 and the hash node chain storage server 1550 through the network 1560. Further, it may be stored wirelessly in a local event storage means (not shown).

  For example, the event A passed to the hash node chain storage server 1550 is passed to the event history storage unit 1552 together with the event hash value generated by the event hash generation unit 1551, and is configured as a hash node by the hash node generation method described above. Thus, it is added as A5 to the end of the hash node chain corresponding to the corresponding product ID in the hash node chain storage device 1557.

  Similarly, the history passing through the event generation terminals 1520 and 1530 is stored together with time information in the event original storage device 1540 and the portable event storage means 1580, and the hash node chain storage device 1557 is A6 and A7. It accumulates by the method of.

  At this time, when the time information serving as the reference of the time generation means 1515 is different in the event generation terminals 1510, 1520, and 1530 (for example, the reference time is different due to international movement or an incorrect time is set due to an error in equipment maintenance. If the event information stored in the original event storage device 1540 or the portable event storage unit 1580 is referred to, the passing order may be returned different from the actual one.

  Therefore, in the present invention, for example, a plurality of event information referred from the event original storage device 1540 is input to the event history verification unit 1554 of the hash node chain storage server 1550 and verified by the verification method of the present invention. is there.

  By this verification, it is possible to know whether or not those events have been tampered with and the exact order.

  Next, the processing of the present invention that is executed when an event occurs across a plurality of bases will be described.

  In FIG. 16, the box 1640 moves across a plurality of companies A and B, and the history is stored in the individual event original storage devices 1611 and 1621. At the same time, the hash nodes of the read events at that time are the local hashes. An example of the event history information storage system of the present invention in the case of being stored in node chain storage servers 1614 and 1624 is shown.

  In this event history information storage system, a hash node of event information shared between two companies is stored in a shared hash node chain storage server 1630 managed by a third party. The local hash in which the local hash node chain storage servers 1614 and 1624 of the company are provided and the shared hash node chain storage server 1630 for sharing the hash nodes shared between the companies is installed for each company. It is characterized in that it is separately installed as a means having functions equivalent to those of the node chain storage servers 1614 and 1624.

  The event information sorting means 1615 and 1625 are for sorting events of an IC tag attached to a specific object such as a pallet that circulates between companies. The selected event information is sent through the event information transmission / reception means 1616 and 1626. The information is transmitted to the shared hash node chain storage server 1630 and stored in the shared hash node chain storage server 1630.

  In the event history information storage system shown in FIG. 16, for example, when a box 1640 with an IC tag attached moves from the event generation terminal 1612 → the event generation terminal 1613 → the event generation terminal 1622 → the event generation terminal 1623, FIG. If event information is generated by the same method as that of the event generation terminal and passes through the company A, the event information is stored in the local hash node chain storage server 1614 in the company A. The event information selection means 1615 in the server identifies whether or not to share the event information based on a predetermined selection criterion, and stores the event information only for the company A in the local hash node chain storage server 1614. In the case of shared event information, event information transmission / reception means 1616 Through and stored in the shared hash node chain storage server 1630.

  The case where event information is registered with respect to FIG. 16 has been specifically described above. However, with respect to a method for adding, deleting, and verifying event information, means similar to the means described in FIG. 1614, 1624.

  In other words, even when adding, deleting, or verifying an event, the event information selection unit 1615 identifies whether the event is a shared event by making a request to the local hash node chain storage servers 1614 and 1624 once. When stored in the company A, it is shared by each means of the local hash node chain storage server 1614, and when stored in the company B, it is shared by each means of the local hash node chain storage server 1624. Sometimes implemented by means of shared local hash node chain storage server 1630.

  Although the present invention has been described according to the illustrated embodiment, the present invention is not limited to this. For example, in the embodiment, the description has been made by configuring the hash node chain for the event information related to the same thing, but the event information other than the thing is configured such that the hash node chain is configured for the event information related to the same place. A hash node chain may be configured for event information related to the component value.

It is a creation flow of an event hash value. It is explanatory drawing of the flow of data in the creation process of an event hash value. It is explanatory drawing of a hash node chain. It is explanatory drawing when comprising a hash node chain. It is an image figure of boxing operation. It is explanatory drawing of the hash node chain of boxing operation. It is explanatory drawing of an operation event log | history. It is explanatory drawing of hash node addition. It is explanatory drawing of the hash node chain in hash node addition. It is explanatory drawing of hash node deletion. It is explanatory drawing of the hash node chain in hash node deletion. It is explanatory drawing of an event verification process. It is an event verification flow. It is explanatory drawing of the data flow in the verification process of an event. It is a figure which shows an example of the event history information storage system implement | achieved by this invention. It is a figure which shows another example of the event history information storage system implement | achieved by this invention.

Explanation of symbols

1500 Event history information storage system 1510 Event generation terminal 1511 Event information transmission / reception means 1512 Event information acquisition / creation means 1513 Product ID information acquisition means 1514 Location information acquisition means 1515 Time generation means 1516 IC tag reader / writer 1540 Event original storage apparatus 1550 Hash node Chain storage server 1551 Event hash creation means 1552 Event history storage means 1553 Event history addition means 1554 Event history verification means 1555 Event history deletion means 1556 Operation event registration means 1557 Hash node chain storage device

Claims (9)

An event history storage device for storing event information occurrence history,
Means for inputting event information including at least time information, location information, and item identification information;
Based on the input event information and the hash value created in accordance with the event information input the previous time for the same event information component value, create a hash value corresponding to the input event information, A means for generating a hash node that is defined as a hash node associated with the input event information and records the created hash value;
A means for creating a hash node chain by storing a parent-child relationship between the newly generated hash node and the previously generated hash node for the same event information component value, and storing the hash node chain in the storage device; e,
Further, the generating means includes
(I) When a new hash node is inserted into a hash node chain that has already been generated, the hash node is inserted into the hash information of the insertion source and the branch information recording area of the newly generated hash node. When verifying the chain, instruct to verify according to the relationship with the hash node of the insertion source separately from the verification according to the parent-child relationship of the hash node chain, and when verifying the occurrence order of event information Means for performing the insertion by recording branch display information instructing to perform verification in preference to the hash node connected to the original hash node in a parent-child relationship;
(Ii) It operates when deleting a hash node of a hash node chain that has already been generated, and when verifying the hash node chain in the state recording area of the hash node, the parent and child of the hash node chain In addition to instructing to verify as it is in accordance with the relationship, when verifying the occurrence order of event information, record deletion display information instructing to verify that event information is not registered. And means for performing the deletion,
Feature event history storage device . The event history storage device according to claim 1 ,
The generating means generates a hash node for recording the input event information.
Feature event history storage device . In the event history storage device according to claim 1 or 2 ,
If the storage means uses another storage device instead of the storage device used so far, the hash node stored last for the storage device used so far Is stored in the storage device to be used in the future,
Feature event history storage device. In the event history storage device according to any one of claims 1 to 3 ,
When an operation is performed on a plurality of things, a hash value corresponding to the operation information is created based on the hash value corresponding to the event information of those things and the information of the operation, Comprising means for generating an operation event node for recording the operation information and the created hash value;
Feature event history storage device . A hash value corresponding to the input event information is created based on the input event information and the hash value created in accordance with the event information input previously for the same event information component value. A hash node that is defined as a hash node that is associated with the input event information and records the created hash value is generated, and the event information component value that is the same as the newly generated hash node is generated one time before. An event information verification device that verifies event information given as a verification target by referring to a device that accumulates a hash node chain generated by setting a parent-child relationship with the hash node,
Based on the event information to be verified, means for narrowing the search range on the hash node chain,
Based on all hash nodes included in the search range as processing targets, event information associated with the processing target hash node, and a hash value recorded by the hash node immediately preceding the processing target hash node Create a hash value and verify the hash node chain by repeatedly evaluating whether or not the created hash value matches the hash value recorded by the processing target hash node. A means for verifying the event information to be verified based on,
For example Bei and means for outputting the result of the verification,
Further, the means for verifying is as follows:
(I) When the branch node information is recorded in the branch information recording area of the hash node and the hash node on the hash node chain, the hash node chain is verified. In addition to the verification according to the parent-child relationship of the chain, verification is performed between hash nodes in which the branch display information is recorded. Means for executing the verification in a form giving priority over a hash node connected to a hash node on a hash node chain in which display information is recorded in a parent-child relationship;
(Ii) It operates when the deletion display information is recorded in the status recording area of the hash node to be processed, and when the hash node chain is verified, the deletion display information is ignored in the verification mode. On the other hand, when verifying the occurrence order of the event information, the event information is regarded as not registered according to the deletion display information, and a means for executing the verification is provided.
A featured event information verification device . In the event information verification device according to claim 5 ,
The means for verifying, when a certain operation is performed on a plurality of things, a hash value corresponding to the event information of those things and a hash value created based on the operation information, If an operation event node that records the operation information is accumulated, the operation information is also verified, and the validity of the operation information recorded by the operation event node is evaluated using a hash value. Verifying the operation information to be verified based on the results,
A featured event information verification device . Provided with an input means and generating means and the storage means, a event history storage method event history accumulation unit executes to accumulate occurrence history of event information,
It said input means, even without least time information, place information, enter the event information comprising identification information of goods,
Hash said generating means, in which the event information on fill force, on the basis of the same for the event information component values hash value created in response to the event information entered in the previous, corresponding to the event information the input Create a value, define a hash node that is associated with the input event information, generate a hash node that records the created hash value,
It said storing means, to generate and accumulate device hash node chain by setting the parent-child relationship between the hash node that generated in the previous for newly generated identical event information component values and the hash node Accumulate,
Furthermore, the generating means includes
(I) When a new hash node is inserted into a hash node chain that has already been generated, the hash node is inserted into the hash information of the insertion source and the branch information recording area of the newly generated hash node. When verifying the chain, instruct to verify according to the relationship with the hash node of the insertion source separately from the verification according to the parent-child relationship of the hash node chain, and when verifying the occurrence order of event information Record the branch display information instructing to perform verification in preference to the hash node connected to the original hash node in a parent-child relationship, and execute the insertion.
(Ii) It operates when deleting a hash node of a hash node chain that has already been generated, and when verifying the hash node chain in the state recording area of the hash node, the parent and child of the hash node chain In addition to instructing to verify as it is in accordance with the relationship, when verifying the occurrence order of event information, record deletion display information instructing to verify that event information is not registered. To perform that deletion,
Characteristic event history storage method. And an output means and narrowing means and verification means, and event information entered, based on the hash value created in response to the event information entered in the previous for the same event information component values, the input A hash value corresponding to the event information created is created and defined as a hash node associated with the input event information. A hash node that records the created hash value is generated, and a newly created hash node Event that is given as a verification target by referring to a device that stores a hash node chain generated by setting a parent-child relationship with the hash node generated previously for the same event information component value an event information verification method event information verification device for verifying the information to be executed
Said narrowing means, based on the event information verification target, narrow down the search range on the hash node chain,
It said verification means, all of the hash nodes included in the above Symbol search range as a processing target, and an event information associated with the hash node of the processing target, and records of the previous hash node hash node of the processing target Create a hash value based on the hash value, and verify the hash node chain by repeatedly evaluating whether the created hash value matches the hash value recorded by the hash node to be processed. Te, verify the event information to be verified based on the evaluation result,
The output means, to force out the results of the above Symbol verification,
Furthermore, the verification means includes
(I) When the branch node information is recorded in the branch information recording area of the hash node and the hash node on the hash node chain, the hash node chain is verified. In addition to verification according to the parent-child relationship of the chain, verification is performed between hash nodes in which the branch display information is recorded. On the other hand, when verifying the occurrence order of event information, the hash node to be processed is branched. The verification is executed in a form that gives priority to the hash node connected to the hash node on the hash node chain in which the display information is recorded in a parent-child relationship,
(Ii) It operates when the deletion display information is recorded in the status recording area of the hash node to be processed, and when the hash node chain is verified, the deletion display information is ignored in the verification mode. On the other hand, when verifying the occurrence order of event information, it is assumed that event information is not registered according to the deletion display information, and that verification is executed,
A featured event information verification method. An event information processing system for accumulating event information occurrence history and verifying event information using the accumulated data,
Consists of one or a plurality of processing means, input event information, and a hash value created according to the event information previously input for the same event information component value as the input event information Based on the input event information, a hash value corresponding to the input event information is created, a hash node for recording the hash value is generated, and a parent and child are generated between the same event information component value and the hash node generated immediately before By setting the relationship, a hash node chain is generated and stored in the storage device. Further, in this processing, (i) it operates when a new hash node is inserted into the already generated hash node chain. Record the branch display information in the branch information recording area of the hash node of the insertion source and the newly generated hash node. (Ii) It operates when deleting a hash node in a hash node chain that has already been generated, and records the deletion display information in the status recording area of the hash node. by a first processing mechanism to run the deletion,
Consists of one or more processing means, narrows down the search range on the hash node chain stored in the storage device based on the event information to be verified, and processes all hash nodes included in the search range As a result, a hash value is created based on the event information associated with the hash node to be processed and the hash value recorded by the hash node immediately before the hash node to be processed. The validity of the hash node chain is evaluated by repeatedly evaluating whether the hash value recorded by the hash node to be processed matches, and the event information to be verified is verified based on the evaluation result. Furthermore, in this processing, (i) on the hash node and hash node chain to be processed It operates when branch display information is recorded in the branch information recording area of the hash node, and when verifying the hash node chain, the branch display information is separate from the verification according to the parent-child relationship of the hash node chain. When verifying between the recorded hash nodes and verifying the occurrence order of event information, the hash node on the hash node chain where the branch display information is recorded (Ii) The hash node is operated when deletion information is recorded in the status recording area of the hash node to be processed. When verifying a chain, the verification is performed in a form that ignores the deleted display information, while the occurrence order of event information That upon verification, and a second processing mechanism to run the verification is regarded as the event information is not registered in accordance with the deleted displayed information,
A featured event information processing system.

Images