WO2022209503A1

WO2022209503A1 - Physical distribution management apparatus and physical distribution management method

Info

Publication number: WO2022209503A1
Application number: PCT/JP2022/008090
Authority: WO
Inventors: 耕史山▲崎▼
Original assignee: 耕史山▲崎▼
Priority date: 2021-03-31
Filing date: 2022-02-25
Publication date: 2022-10-06
Also published as: JP2022158809A

Abstract

A physical distribution management apparatus (20) is configured such that a processor acquires a first original code corresponding to a first layer node in flow information, derives a first n-dimensional code and a first seed value on the basis of the first original code, derives a second original code corresponding to a second layer node on the basis of the first seed value, derives a second n-dimensional code and a second seed value on the basis of the second original code, and stores the first and second seed values in a memory, and a communication device transmits the first n-dimensional code to a first terminal and the second n-dimensional code to a second terminal.

Description

Physical distribution management device and physical distribution management method

The present disclosure relates to a physical distribution management device and a physical distribution management method.

Conventionally, a logistics management system using blockchain is known (see Patent Document 1). In this system, a computer system held by each person concerned, a logistics block chain creation unit that builds a logistics block chain in common in a logistics management application, and an open PIN code and a closed PIN code are set for each block or data. ing. In this system, the logistics management application receives the input of the open PIN code to unlock the data in the logistics block, the data editing function to edit the data, and the input of the close PIN code to successfully open the edited data. a locking function that terminates and closes. In this system, edited data and hash value data in logistics process blocks are exchanged between logistics process block chains.

WO2020/085348

With conventional blockchain technology, one block is generated from a set of transaction records that occur within a certain period of time, each generated block is encrypted, and each encrypted block is linked in order. Therefore, data indicating that a transaction has occurred can be recorded. However, blockchain technology does not determine whether transactions involving data are legitimate. For example, when a parcel is delivered between a sender and a recipient, it does not indicate that the sender or recipient is the legitimate sender or recipient. Also, with blockchain technology, transaction data is shared and held by a large number of participants, resulting in a very large-scale system. Also, with blockchain technology, transaction data records are bundled, encrypted, and chained, but the purpose is not to determine the situation at the moment of delivery of the package. After the delivery of the package, the main purpose is not whether the delivery of the package is valid, but whether or not the transaction data has been altered.

The present disclosure has been made in view of the above circumstances, and provides a physical distribution management device and a physical distribution management method that simplify the configuration of the system and can determine that the sending and receiving of parcels in the physical distribution process is valid.

One aspect of the present disclosure is a physical distribution management device that manages physical distribution, comprising a processor, a memory, and a communication device, wherein the processor controls the distribution of a package according to the order in which it is distributed through a plurality of physical distribution bases. Flow information in which a plurality of nodes corresponding to a plurality of physical distribution bases are hierarchically arranged, wherein a node corresponding to the physical distribution start base is disposed at the top layer, and a node corresponding to the physical distribution completion base. is arranged in the lowest layer, acquires flow information in which two nodes in adjacent layers are connected corresponding to two adjacent points where the cargo circulates, and corresponds to the first layer node in the flow information A first original code, which is a code to be encrypted, is obtained, and the first original code is encrypted using a first function used in a decryptable encryption method to generate first encrypted data. , dividing the first encrypted data to derive a first n-dimensional code (n is an integer of 1 or more) and a first seed value, and based on the first seed value, the first Deriving a second original code that is a code to be encrypted corresponding to a node in a second layer that is one level lower than the layer, encrypting the second original code using the first function, generating second encrypted data, dividing the second encrypted data to derive a second n-dimensional code and a second seed value, and obtaining the first seed value and the second seed value and in the memory, the communication device transmits the first n-dimensional code to a first terminal associated with a node of the first layer, and transmits the second n-dimensional code to the A logistics management device that transmits to a second terminal associated with a second layer node.

One aspect of the present disclosure is a physical distribution management device for managing physical distribution, comprising a processor and a memory, the memory holding a plurality of seed values, the processor providing a first terminal with obtaining a held first n-dimensional code and a second n-dimensional code held in a second terminal; obtaining said second n-dimensional code and a plurality of seed values held in said memory; A second seed value, which is a seed value of one of the , decoding the second original code to derive decoded data, wherein the decoded data is any seed value held in the memory, wherein the first seed value other than the second seed value and if the decoded data matches the first seed value, the delivery order of the package from the user of the first terminal to the user of the second terminal is valid. It is a physical distribution management device that determines that there is.

One aspect of the present disclosure is a physical distribution management method for managing physical distribution, wherein a plurality of nodes corresponding to the plurality of physical distribution bases are arranged hierarchically according to the order in which a package circulates through the multiple physical distribution bases. wherein a node corresponding to the start point of the physical distribution is arranged in the highest layer, a node corresponding to the completion point of the physical distribution is arranged in the lowest layer, and two adjacent nodes through which the goods are distributed are arranged. Acquiring flow information in which two nodes in adjacent layers corresponding to a base are connected, acquiring a first original code that is a code to be encrypted corresponding to a node in the first layer in the flow information, Encrypting the first original code using a first function used in a decryptable encryption method to generate first encrypted data, dividing the first encrypted data, dividing the first n-dimensional data A code and a first seed value are derived, and based on the first seed value, a second code, which is a code to be encrypted corresponding to a node in a second layer that is one level lower than the first layer, is generated. deriving an original code; encrypting the second original code using the first function to generate second encrypted data; dividing the second encrypted data to obtain a second n-dimensional deriving a code and a second seed value; storing the first seed value and the second seed value in memory; and transmitting the second n-dimensional code to a second terminal associated with the node of the second layer.

One aspect of the present disclosure is a physical distribution management method for managing physical distribution, comprising: a first n-dimensional code held in a first terminal; a second n-dimensional code held in a second terminal; and combining the second n-dimensional code with a second seed value, which is one of a plurality of seed values held in memory, to obtain a code to be decoded, 2, and based on a first function used in a decryptable encryption scheme, the second original code is decrypted to derive decrypted data, and the decrypted data is held in the memory. It is determined whether any seed value matches a first seed value other than the second seed value, and if the decoded data matches the first seed value, the first It is determined that the delivery order of the parcels from the user of the first terminal to the user of the second terminal is correct.

According to this disclosure, it is possible to determine whether the sending and receiving of packages in the distribution process is valid.

A diagram showing an example of a physical distribution management system according to an embodiment of the present disclosure Block diagram showing a configuration example of a terminal Block diagram showing an example of server configuration A diagram showing an example of delivery information for delivering a package Flowchart showing an example of operation when a code is encrypted by a logistics management device Flowchart showing example of operation when code is encrypted by logistics management device (continuation of FIG. 5A) A diagram showing an example of dividing encrypted data into two-dimensional codes and seed values A diagram showing an example of adding a branch number to a seed value Diagram for supplementary explanation of operations during encryption by the logistics management system Diagram for supplementary explanation of operations during encryption by the logistics management system Diagram for supplementary explanation of operations during encryption by the logistics management system Diagram for supplementary explanation of operations during encryption by the logistics management system Diagram for supplementary explanation of operations during encryption by the logistics management system Diagram for supplementary explanation of operations during encryption by the logistics management system Flowchart showing an example of the operation when the logistics management device decodes the code Flowchart (continuation of FIG. 14A) showing an example of the operation when the logistics management device decodes the code A diagram for supplementary explanation of the operation during decryption by the logistics management system A diagram for supplementary explanation of the operation during decryption by the logistics management system A diagram for supplementary explanation of the operation during decryption by the logistics management system A diagram for supplementary explanation of the operation during decryption by the logistics management system

Hereinafter, embodiments will be described in detail with reference to the drawings as appropriate. However, more detailed description than necessary may be omitted. For example, detailed descriptions of well-known matters and redundant descriptions of substantially the same configurations may be omitted. This is to avoid unnecessary verbosity in the following description and to facilitate understanding by those skilled in the art. It should be noted that the accompanying drawings and the following description are provided to allow those skilled in the art to fully understand the present disclosure and are not intended to limit the claimed subject matter thereby.

<Configuration of logistics management system>
FIG. 1 is a block diagram showing a configuration example of a physical distribution management system 5 according to an embodiment of the present disclosure. A physical distribution management system 5 includes a plurality of terminals 10 and a physical distribution management device 20 . The terminal 10 and the physical distribution management device 20 are connected via a network, for example. This network may include the Internet, a public communication network (eg, a cellular network), a wired LAN (Local Area Network), a wireless LAN, and the like.

The terminal 10 is a smartphone, tablet terminal, or other mobile terminal, and may be a terminal other than a mobile terminal. The terminal 10 may be carried by the user and be mobile. The terminal 10 is a terminal 10A owned by a sender UA (delivery person) who sends (hands over) a parcel 50 to a recipient UB at a predetermined base, and a terminal 10A owned by a recipient UB who receives the parcel 50 from the sender UA at a predetermined base. may include terminals 10B, etc. that The physical distribution management device 20 is a server, a PC, or the like. The physical distribution management device 20 manages physical distribution. The physical distribution management device 20 may be located at the delivery point of the parcel 50 or other locations.

FIG. 2 is a block diagram showing a configuration example of the terminal 10. As shown in FIG. Terminal 10 comprises processor 11 , communication device 12 , memory 13 , operation device 14 and display device 15 .

The processor 11 is configured by, for example, a processor, and implements various functions by executing a program held in the memory 13 by the processor. The processor may include an MPU (Micro processing Unit), a CPU (Central Processing Unit), a DSP (Digital Signal Processor), and the like. The processor 11 controls the operation of each unit of the terminal 10 and performs various processes.

The communication device 12 communicates various data or information. The communication method of the communication device 12 is WAN (Wide Area Network), LAN (Local Area Network), cellular communication for mobile phones (for example, LTE, 5G), or short-range communication (for example, infrared communication or Bluetooth (registered trademark ) communication) and the like.

The memory 13 includes a primary storage device (for example, RAM (Random Access Memory) or ROM (Read Only Memory)). The memory 13 may include a secondary storage device (eg, HDD (Hard Disk Drive) or SSD (Solid State Drive)) and a tertiary storage device (eg, optical disk, SD card). Memory 13 may include other storage devices. The memory 13 stores various data, information, programs, and the like. The memory 13 may hold, for example, an acquired two-dimensional code CD2, which will be described later.

The operation device 14 may include various buttons, keys, touch panels, microphones, or other input devices. The operation device 14 receives input of various data and information.

The display device 15 may include a liquid crystal display device, an organic EL device, or other display devices. The display device displays various data and information.

FIG. 3 is a block diagram showing a configuration example of the physical distribution management device 20. As shown in FIG. A physical distribution management device 20 includes a processor 21 , a communication device 22 and a memory 23 .

The processor 21 is configured by, for example, a processor, and implements various functions by executing a program held in the memory 23 by the processor. Processors may include MPUs, CPUs, DSPs, and the like. The processor 21 controls the operation of each part of the physical distribution management device 20 and performs various processes.

The communication device 22 communicates various data and information. The communication method by the communication device 22 may include, for example, communication methods such as WAN, LAN, power line communication, and cellular communication for mobile phones.

The memory 23 includes a primary storage device (for example, RAM or ROM). The memory 23 may include a secondary storage device (eg, HDD or SSD) or a tertiary storage device (eg, optical disc, SD card). Memory 23 may include other storage devices. The memory 23 stores various data, information, programs, and the like. The memory 23 may hold, for example, delivery information DI, derived seed values SD and hash values HS, etc., which will be described later.

The operation device 24 may include various buttons, keys, touch panels, microphones, or other input devices. The operation device 24 receives input of various data and information.

The display device 25 may include a liquid crystal display device, an organic EL device, or other display devices. The display device displays various data and information.

<Operation of Logistics Management System>
Next, the operation of the physical distribution management system 5 will be explained.

In this embodiment, delivery (sending and receiving) of various packages 50 occurs at multiple bases. Each location may include a distribution center, a destination customer's residence, and the like. Distribution centers may include one or a few central distribution centers to multiple distribution center branches. In other words, a plurality of bases for delivering the package 50 may exist hierarchically, and the package 50 may be delivered sequentially at each base. In delivery of the package 50, the sender UA of the package 50 sends the package 50, and the receiver UB of the package 50 receives the package 50. - 特許庁The sender UA of the parcel 50 and the receiver UB of the parcel 50 at each base can possess the terminal 10 .

FIG. 4 is a diagram showing an example of delivery information DI for delivering the package 50. FIG. The delivery information DI includes delivery flow information DF corresponding to the delivery route and delivery order, and delivery related information DR related to delivery. The delivery information DI is held in the memory 23, for example. It should be noted that the delivery flow information DF does not particularly mean an instruction by a drawing as long as it is in the form of a flow.

The delivery flow information DF includes information in which a plurality of nodes ND corresponding to a plurality of distribution bases are hierarchically arranged according to the order in which the package 50 is distributed through the plurality of distribution bases. In addition, in the delivery flow information DF, a node ND corresponding to a distribution start point is arranged in the highest layer, a node ND corresponding to a distribution completion point is arranged in the lowest layer, and a node ND corresponding to a distribution relay point is arranged. ND contains information located in the middle layer. Further, the delivery flow information DF includes information in which two nodes ND in adjacent layers are connected corresponding to two adjacent bases through which the package 50 is distributed. In other words, in the delivery flow information DF, each node ND corresponding to each base to which packages are delivered is hierarchically arranged. Also, in the delivery flow information DF, two nodes ND in adjacent layers corresponding to two adjacent bases through which the package 50 is distributed are connected by a connection line LN. That is, the connection line LN indicates a delivery route.

In addition, in the delivery flow information DF, the node ND corresponding to the upstream (close to the delivery start point) base in delivery is indicated in the upper layer, and the downstream (far from the delivery start point, that is, close to the delivery target point) node in delivery is indicated in the upper layer. A node ND corresponding to the base is shown in the lower layer. The delivery of the parcel 50 repeats the start and end of delivery between two bases, and when the final delivery target base (delivery completion base, for example, the base where the orderer of the parcel 50 is located) is reached, the delivery is completed. do. A connection line LN connects a node ND corresponding to a base from which a parcel departs and a node ND corresponding to a base to which a parcel arrives in adjacent layers. The point where the package arrives here can be a relay point. A node ND corresponding to a base from which a parcel departs is positioned one level higher than a node ND corresponding to a base to which a parcel arrives.

Also, multiple nodes ND may exist within the same hierarchy. In this case, one node ND in a predetermined hierarchy is connected to a plurality of nodes ND one level lower than the predetermined hierarchy by connection lines LN. This indicates that the parcel 50 may branch from one base and be delivered to two bases. Of the two nodes ND connected by the connection line LN, the node ND on the upstream side of delivery is also called a "parent node", and the node ND on the downstream side of delivery is also called a "child node". Therefore, the child node is arranged one step below the parent node. One or more child nodes are connected to one parent node by connection lines LN.

In this way, in the delivery flow information DF, each node ND corresponding to each base places the base where the delivery of the package 50 is started in the highest layer, taking into consideration the order of delivery of the package 50 or the branching of the delivery route. Bases are arranged hierarchically, with bases that have completed delivery of packages as bases in the lowest layer.

The delivery-related information DR is associated with each node ND in the delivery flow information DF. The delivery-related information DR may be held in association with each package 50 . The delivery-related information DR includes, for example, a delivery person ID that identifies a delivery person, model number information of the product that is the package 50, information on the seller of the product that is the package 50, or information on the date of manufacture of the product that is the package 50. OK. The delivery person here is the delivery person who delivers the package 50 from the base corresponding to the node ND associated with the delivery-related information DR to the base (next base) corresponding to the child node of this node ND. This deliverer becomes the recipient UB of the package 50 at the base corresponding to the node ND associated with the delivery-related information DR, and the sender UA of the package 50 at the base corresponding to the child node of this node ND.

The physical distribution management device 20 assigns a cryptographic source code CD, which is a code to be encrypted, in association with each node ND. The physical distribution management device 20 encrypts the encryption source code CD to generate encrypted data CR, and conversely decrypts the encrypted data CR to generate decrypted data DD. Each cryptographic code CD corresponding to each node ND is a different code for each node ND, and the node ND may be uniquely identified by the cryptographic code CD. Therefore, it may be possible to uniquely identify the site by the cryptographic code CD.

<Operation during encryption>
5A and 5B are flowcharts showing an operation example when the distribution management device 20 encrypts a code (original code). Note that the processor 21 of the physical distribution management device 20 sets a variable n that identifies the hierarchy of the hierarchically arranged nodes ND. That is, the variable n indicates the n-th layer. Possible values of the variable n are integers of 1 or more. For example, n=1 indicates the highest layer (first layer). For example, n=2 indicates that the layer is the second layer, which is one step below the top layer. Also, the variable k indicates the number of layers in which the node ND is arranged in the delivery flow information DF.

First, in the physical distribution management device 20, the processor 21 acquires the delivery information DI (S11). The delivery information DI may be held in the memory 23 and the processor 21 may acquire the delivery information DI from the memory 23 . Processor 21 may obtain delivery information DI from an external server via communication device 22 . Processor 21 also sets variable n to the value one. The delivery information DI includes delivery flow information DF and delivery related information DR.

The processor 21 assigns an arbitrary code to the node ND of the n-th layer (here, n=1, so the highest layer) as the encryption original code CD (S12). For example, the processor 21 generates a random number and assigns this random number as the cryptographic code CD.

The processor 21 encrypts the assigned cryptographic code CD using a decryptable encryption method function (eg, RSA, DES, AES, elliptic curve cryptography, hybrid cryptography) to obtain encrypted data CR (S13).

The processor 21 divides the obtained encrypted data CR into a seed value SD and a two-dimensional code CD2 (eg, QR code (registered trademark)) (S14). In this case, the processor 21 sets one of two divided data (also referred to as first divided data) obtained by dividing the encrypted data CR into two as a seed value SD, and sets the other of the two divided data as a two-dimensional code CD2 (second (an example of divided data). The processor 21 may divide the encrypted data CR into the two-dimensional code CD2 and the seed value SD by taking into consideration the number of digits of the encrypted data CR and dividing the encrypted data CR into two equal digits. In addition, the processor 21 divides the encrypted data CR into the two-dimensional code CD2 and the seed value SD in such a way that the number of digits of the two-dimensional code CD2 and the seed value SD are different from each other. value SD. FIG. 6 is a diagram showing an example of dividing the encrypted data CR of the node A into the two-dimensional code CD2 and the seed value SD. In FIG. 6, the left half obtained by dividing the encrypted data CR is the seed value SD, and the right half is the two-dimensional code CD2, but the present invention is not limited to this.

The processor 21 determines whether or not the variable n is equal to the variable k, that is, whether or not the layer to be encrypted is the lowest layer (S15). If the variable n is equal to the variable k, go to step S21 of FIG. 5B.

On the other hand, if the variable n is different from the variable k, that is, if the layer to be encrypted is not the lowest layer, the processor 21 adds 1 to the variable n (S16). In other words, the layer to be encrypted is moved to a lower layer. The processor 21 determines whether or not there are a plurality of nodes ND in the n-th layer (the n-th layer after the layer movement in step S16) based on the delivery flow information DF (S17).

If there is only one node ND in the nth layer (No in S17), the processor 21 selects the (n-)th (n− 1) Assign a seed value SD corresponding to the node ND of the layer (S18). That is, the processor 21 uses the seed value SD corresponding to the (n−1)-th layer parent node as it is as the encryption code CD of the n-th layer child node.

If there are a plurality of nodes ND in the nth layer (No in S17), the processor 21 selects the (n−1)th ) layer with a branch number for identifying the node ND added to the seed value SD of the node ND of the layer (S19). That is, the processor 21 attaches a branch number to the seed value SD of the parent node of the (n−1)-th layer as an example of node identification information capable of identifying each of the plurality of child nodes existing in the n-th layer. , generates the encryption source code CD of the child node.

The branch number can be added at any position with respect to the seed value SD, and may be added at any position before, during, or after the seed value SD. A branch number is represented by a predetermined number of digits (for example, four digits). For example, if two child nodes exist for the same parent node, branch numbers "0001" and "0002" may be added immediately before the seed value SD. For example, when the branch number is attached to the seed value SD, it may be added inside a predetermined number of digits indicating the seed value SD (for example, at the beginning or at the end). The number of digits to which the branch number is assigned and the position relative to the seed value SD are determined in advance and stored in the memory 23, for example, so that the processor 21 can recognize them. FIG. 7 is a diagram showing an example of adding a branch number to the seed value SD of node A. In FIG.

It should be noted that if there is only one node ND in the n-th layer, it is not necessary to assign branch numbers as shown in step S18. When there is one node ND in the n-th layer, the parent node of this node ND has a single child node, so the parent node does not branch into a plurality of child nodes. In this case, the processor 21 may add information indicating that there is no branch (no-branch information) to the seed value SD instead of the branch number.

The no-branch information, like the branch number, is represented by a predetermined number of digits (eg, 4 digits), and may be represented by "0000", for example. The no-branch information may be added before, during, or after the seed value SD. When added in the seed value SD, it may be added inside a predetermined number of digits indicating the seed value SD (for example, at the beginning or at the end). The number of digits to which the no-branch information is attached and the position with respect to the seed value SD are determined in advance and stored in the memory 23, so that the processor 21 can recognize them.

After the processing of step S18 or step S19, proceed to step S13. In other words, the physical distribution management device 20 encrypts the original code CD (S13) and divides the encrypted data CR (S14) for each node ND in the n-th layer after the layer movement. Then, it moves to the next layer (one layer below) (S16), assigns the original code to each node ND of the n-th layer after the layer movement (S18, S19), encrypts the original code CD (S13) and The division of the encrypted data CR (S14) is repeated. This repetition is continued until encryption of the encryption original code CD corresponding to each node ND in the lowest layer (k-th layer) and division of the encryption data CR are performed.

In step S15, if the variable n is equal to the variable k, that is, if the encryption of the original code CD corresponding to the lowest layer node NDE and the division of the encrypted data CR are completed, the process proceeds to step S21 in FIG. 5B. The processor 21 calculates a hash value HS using a hash function (for example, SHA256) based on the encrypted data CR for each node ND in each layer (S21). A hash function is an example of a one-way function, that is, a function of a cryptosystem that is difficult to decrypt, and other one-way functions may be used. The hash value HS is an example of the value of the calculation result of the one-way function, and may be the value of the calculation result of another one-way function.

The processor 21 transmits the two-dimensional code CD2 corresponding to each node ND of each layer to each designated destination via the communication device 22 (S22). The designated destination is determined for each node ND, and may be the terminal 10 possessed by the deliverer (sender UA of the parcel 50) identified by the above-described deliverer ID. The designated destination may be included in the delivery-related information DR. That is, the communication device 22 may transmit the two-dimensional code CD2 corresponding to each node ND in each layer to the terminal 10 corresponding to each node ND.

In each terminal 10 as each designated destination, the processor 11 receives the two-dimensional code CD2 corresponding to each node ND in each layer transmitted from the physical distribution management apparatus 20 in step S22 via the communication device 12. , this two-dimensional code CD2 is held in the memory 13 . This two-dimensional code CD2 is used when decrypting the encryption original code CD.

The processor 21 stores the seed value SD and hash value HS derived corresponding to each node ND in each layer in the memory 23 (S23). The seed value SD and hash value HS are used when decrypting the original code CD. The seed value SD and hash value HS are held in pairs. On the other hand, the memory 23 does not hold information indicating which layer and which node ND the seed value SD and hash value HS are related to in the delivery flow information DF. In other words, the memory 23 holds pairs of the seed value SD and the hash value HS without consideration of the hierarchy and node positions in the delivery flow information DF. Therefore, for example, even if a third party obtains some of the seed values SD and hash values HS from the memory 23, it is unknown which seed values SD and hash values HS correspond to which hierarchical node ND. Therefore, it is very difficult to grasp which base the information is about. Therefore, the physical distribution management device 20 can greatly reduce the possibility that the encryption source code CD to be encrypted will be decrypted.

8 to 13 are diagrams for supplementary explanation of the encryption operation performed by the distribution management system 5. FIG. 8 to 13 are arranged in chronological order when the encryption source code CD is encrypted by the physical distribution management system 5. FIG. In each of FIGS. 8 to 13, nodes ND are hierarchically arranged corresponding to the delivery flow information DF.

Here, A, B, C, and D are added to the end of the code indicating each part from the 1st layer to the 4th layer so that the layers can be identified. In addition, when there are multiple nodes ND in the same hierarchy, it is possible to identify multiple parts in the same hierarchy by adding "1", "2", . . . I have to. For example, the node NDA is arranged in the first layer, the node NDB is arranged in the second layer, the nodes NDC (NDC1, NDC2) are arranged in the third layer, and the nodes NDD (NDD1, NDD2) are arranged in the fourth layer. It is

In FIG. 8, an arbitrary cryptographic code CDA (an example of a cryptographic code CD) is assigned in association with the node NDA in the highest layer. This process corresponds to the process of step S12 in FIG. 5A.

In FIG. 9, the encrypted data CRA obtained by encrypting the encrypted original code CDA corresponding to the node NDA in the highest layer is divided into the seed value SDA and the two-dimensional code CD2A. A cryptographic code CDB (an example of a cryptographic code CD) based on the seed value SDA of the node NDA of the first layer is assigned to the node ND of the second layer. These processes correspond to the processes of steps S14, S18, S19, etc. in FIG. 5A.

In FIG. 10, similarly to the node NDA of the first layer, the encrypted data CR obtained by encrypting the original code CD corresponding to the node NDB of the second layer is divided into the seed value SD and the two-dimensional code CD2. there is This process corresponds to the process of step S14 in FIG. 5A.

In FIG. 11, for all nodes ND from the highest layer to the lowest layer, the encrypted data CR obtained by encrypting the encrypted original code CD linked to the node ND is divided into the seed value SD and the two-dimensional code CD2. ing. A plurality of nodes NDC exist in the third layer, and a connection line LN connected from one node NDB in the second layer is connected to the nodes NDC1 and NDC2. That is, the node NDB branches to the node NDC1 and the node NDC2. In this case, the branch number is included in the encryption original code CD corresponding to the node NDC1 and the encryption original code CD corresponding to the node NDC2. In other words, the branch number is added to the seed value SD corresponding to the node NDB as the parent node to form the encryption code CD corresponding to the nodes NDC1 and NDC2 as the child nodes. These processes correspond to the processes of steps S13 to S19 in FIG. 5A.

In FIG. 12, a hash value HS is calculated for each pair of two-dimensional code CD2 and seed value SD corresponding to each node ND in each layer (that is, each encrypted data CR before division). This process corresponds to the process of step S21 in FIG. 5B.

In FIG. 13, the two-dimensional code CD2 corresponding to each node ND of each layer is transmitted to the specified destination associated with each node ND. The transmitted two-dimensional code CD2 is excluded from being stored in the memory 23 . On the other hand, the seed value SD and hash value HS corresponding to each node ND in each layer are held in the memory 23 . This processing corresponds to the processing of steps S22 and S23 in FIG. 5B.

As described above, according to an example of operation at the time of code encryption, the physical distribution management device 20, according to the positional relationship and connection relationship of each node ND in the delivery flow information DF, encrypts the original code CD, the encrypted data CR, and the two A dimension code CD2 and a seed value SD can be derived sequentially. Since the child node generates the cryptographic original code CD to be encrypted based on the seed value SD of the parent node, the parent node and the child node are associated. The state in which the parent node and the child node are associated is inherited throughout the delivery flow information DF, thereby forming a series of connection relationships (chains) in which all nodes ND are associated based on the seed value SD. be. Therefore, at the time of decryption, the physical distribution management device 20 acquires the seed value SD and the two-dimensional code CD2 that are separately stored in the physical distribution management device 20 and the terminal 10, thereby obtaining encrypted data CR (to be described later) corresponding to the child node. It is possible to derive the original decryption code CD3) and decrypt the seed value SD corresponding to the parent node from the encrypted data CR.

Also, when the seed value SD and hash value HS are stored in the memory 23, the hierarchical information of the node ND corresponding to the seed value SD and hash value HS is not retained. Therefore, since it is impossible to determine which two nodes ND are the parent node and the child node, even if some of the seed values SD and hash values HS held in the memory 23 are stolen, the encryption corresponding to each node ND It is very difficult to obtain the original code CD. Therefore, the physical distribution management device 20 can easily generate an encrypted chain based on the seed value SD and can ensure security.

Although FIG. 5A and FIG. 5B exemplify deriving the hash value HS at the time of encryption, it is not limited to this. The processor 21 may omit processing related to derivation and recording of the hash value HS. That is, the process of step S21 in FIG. 5B may be omitted, and the process of storing the hash value HS in the memory 23 in step S23 may be omitted.

Even if the hash value HS is not calculated, the physical distribution management device 20 simplifies the processing related to the encryption of the encryption source code CD, shortens the processing time related to the encryption, and evaluates the validity of the delivery order of the packages 50. can. Also, when the physical distribution management apparatus 20 calculates the hash value HS and stores it in the memory 23, it can evaluate the legitimacy of the terminal 10 associated with the node ND corresponding to the hash value HS.

<Decryption operation>
Next, the operation at the time of code decoding by the distribution management system 5 will be described.
At the time of code decryption, the above-described operation at the time of code encryption (for example, the operation shown in FIGS. 5A and 5B) is completed. Therefore, at the time of decryption, the information contained in the delivery flow information DF is assumed, and the sequential encryption of the encryption source code CD corresponding to each node ND is completed. At the start of decoding by the physical distribution management system 5, the memory 23 of the physical distribution management device 20 holds the seed value SD and hash value HS derived in association with each node ND of the delivery flow information DF. Note that the hash value HS does not have to be held in the memory 23 .

FIGS. 14A and 14B are sequence diagrams showing an operation example when the distribution management system 5 decrypts the code (decryption source code). 14A and 14B, the terminal 10A is also simply referred to as terminal A, and the terminal B is simply referred to as terminal B. FIG.

FIGS. 14A and 14B are implemented, for example, when the sender UA of the package 50 and the receiver UB of the package 50 deliver the package 50 at a predetermined base. In the physical distribution of the package 50, the sender UA of the package 50 at the same base is positioned upstream from the receiver UB of the package. Therefore, in the delivery flow information DF, the node ND corresponding to the base corresponding to the sender UA of the parcel 50 is located one level higher than the node ND corresponding to the base corresponding to the recipient UB of the parcel 50 . In the operation examples of FIGS. 14A and 14B, as an example, the terminal 10A possessed by the package sender UA transmits the two-dimensional code CD2TA of the terminal 10A and the two-dimensional code CD2TB of the terminal 10B to the physical distribution management apparatus 20. Illustrate.

The owner of the terminal 10 is the sender UA or the recipient UB of the parcel 50 at a predetermined base. The delivery-related information DR included in the delivery flow information DF includes a delivery person ID. The delivery person ID associated with each node ND in the delivery flow information DF is the identification ID of the recipient UB of the package 50 at the base corresponding to this node ND, for example, the ID of the terminal 10B possessed by the recipient UB. be. Therefore, this node ND is associated with the terminal 10B. Similarly, the parent node of this node ND is associated with terminal 10A.

First, at the time of sending (handing over) the package 50, the processor 11 stores the two-dimensional code CD2 (the two-dimensional code CD2TB of the terminal 10B) distributed from the physical distribution management device 20 and held in the memory 13. , is displayed on the display device 15 . The processor 11 of the terminal 10A reads the two-dimensional code CD2TB of the terminal 10B via a two-dimensional code reader (hardware or software). Then, the terminal 10A distributes the read two-dimensional code CD2TB of the terminal 10B and the two-dimensional code CD2 held in the memory 13 of the terminal 10A (the two-dimensional code CD2TA of the terminal 10A). Send to the management device 20 . Since the two-dimensional code CD2 is distributed to each terminal 10 at the time of encryption, the user of the terminal 10 (the sender UA or the recipient UB of the parcel 50) can easily enter the two-dimensional code CD2 of the other party to whom the parcel 50 is delivered. can be obtained.

When decoding the code, it is performed in order from downstream to upstream of the chain corresponding to the distribution from downstream to upstream. Therefore, decoding based on the two-dimensional code CD2TA of the terminal 10A must be performed after decoding based on the two-dimensional code CD2TB of the terminal 10B. Therefore, the terminal 10A may transmit the two-dimensional code CD2TA of the terminal 10A to the physical distribution management apparatus 20 after the communication device 12 has transmitted the two-dimensional code CD2TB of the terminal 10B to the physical distribution management apparatus 20 . Alternatively, the processor 11 may transmit to the physical distribution management device 20 order instruction information for maintaining the decoding order based on the two-dimensional code CD2TB. Here, the order instruction information includes information instructing decoding based on the two-dimensional code CD2TA of the terminal 10A after decoding based on the two-dimensional code CD2TB of the terminal 10B.

In the physical distribution management device 20, the communication device 22 acquires (receives) the two-dimensional code CD2TA of the terminal 10A and the two-dimensional code CD2TB of the terminal 10B from the terminal 10A (S31). In this case, the communication device 22 receives the two-dimensional code CD2TA of the terminal 10A after receiving the two-dimensional code CD2TB of the terminal 10B. Alternatively, the communication device 22 obtains the above order indication information. The processor 21 determines to perform decoding based on the two-dimensional code CD2TB before decoding based on the two-dimensional code CD2TA, based on the order of reception of the two-dimensional codes CD2TA and CD2TB or the order indication information.

The processor 21 refers to the information held in the memory 23 and searches for a seed value SD that can be successfully decoded in combination with the obtained two-dimensional code CD2TB of the terminal 10B. That is, the processor 21 searches whether or not there is a seed value SD generated in association with the two-dimensional code CD2TB of the terminal 10B. Here, the memory 23 does not hold information indicating the order of the chain generated at the time of encryption. Therefore, the processor 21 cannot determine which seed value SD among the one or more stored seed values SD is associated with the two-dimensional code CD2TB of the terminal 10B.

Therefore, the processor 21 combines an arbitrary seed value (a seed value that has not yet been combined with the two-dimensional code CD2TB of the terminal 10B) held in the memory 23 with the two-dimensional code CD2TB of the terminal 10B to perform decoding of the terminal 10B. A target original code (decoded original code CD3) is generated (S32). The decryption source code CD3 corresponds to the encrypted data CR generated during encryption. In this case, the processor 21 attaches a flag indicating that the combination has been completed to the seed values SD that have been combined once, thereby determining whether or not the seed values have not yet been combined. It may be excluded from subsequent combination candidates.

The processor 21 performs back calculation using the decryptable encryption method function (for example, the RSA function) used at the time of encryption, decrypts the original decryption code CD3 of the terminal 10B, and obtains the decrypted data DC of the terminal 10B (S33). . The decrypted data DC corresponds to the code source code CD which was the code to be encrypted at the time of encryption.

The processor 21 determines whether or not the branch number is included in the obtained decoded data DC of the terminal 10B (S34). At the time of encryption, assuming that a plurality of child nodes exist for the same parent node, if a branch number is added to the seed value SD of the parent node to generate the encryption code CD of the child node, this encryption code The branch number is included in the decoded data DC corresponding to CD. For example, the processor 21 may refer to a predetermined area (eg, the first four digits) in the decoded data DC to determine whether or not the decoded data DC of the terminal 10B includes the branch number. For example, when the no-branch information is included in a predetermined area (for example, the first four digits) of the decoded data DC, the processor 21 determines that the decoded data DC of the terminal 10B does not include a branch number. you can

When the branch number is included in the decoded data DC of the terminal 10B, the processor 21 deletes (excludes) the branch number from the decoded data DC of the terminal 10B (S35). Deleting (excluding) the branch number may include changing the branch number to no-branch information (for example, changing the area indicating whether or not there is a branch to "0000").

If the branch number is not included in the decoded data DC of the terminal 10B in step S34, or after the branch number is deleted from the decoded data DC of the terminal 10B in step S35, the processor 21 determines that the decoded data DC of the terminal 10B is , and other seed values SD held in the memory 23 (S36). The other seed value SD here is any seed value SD held in the memory 23 and is a seed value SD other than the seed value SD of the decoding original code CD3 of the terminal 10B.

If the decoded data DC of the terminal 10B matches another seed value SD held in the memory 23, it is determined that the delivery order of the package 50 is correct (S37). Validity of the delivery order of the package 50 is an example of valid delivery of the package 50 . The terminal 10A is the terminal of the sender UA who sends the parcel 50 at a predetermined base. The terminal 10B is the terminal of the recipient UB who receives the parcel 50 at this base. Considering the time of encryption, the decrypted data DC obtained by decrypting the original decryption code CD3 of the terminal 10B corresponds to a node (parent node) in the next higher layer where the connection line LN is connected to the node ND corresponding to the terminal 10B. It should contain the seed value SD. If the decoded data DC of the terminal 10B matches another seed value SD held in the memory 23, the processor 21 can determine that the seed value SD corresponds to this parent node. Therefore, processor 21 can estimate that node ND corresponding to terminal 10A is a parent node, and node ND corresponding to terminal 10B is a child node of this parent node. Therefore, the processor 21 succeeds in decoding the decoding source code CD3 of the terminal 10B, and determines that the delivery order of the parcel 50 is valid.

On the other hand, if the decoded data DC of the terminal 10B does not match the other seed values SD held in the memory 23 in step S36, it is determined whether or not all the seed values SD held in the memory 23 have been combined with the terminal 10B. (S38).

If there is a seed value SD that has not yet been combined with the two-dimensional code CD2TB of the terminal 10B in the memory 23 (No in S38), the processor 21 proceeds to step S32 and repeats the processing of steps S32 to S38. That is, the processor 21 combines the obtained two-dimensional code CD2TB of the terminal 10B and an arbitrary seed value SD among the plurality of seed values SD held in the memory 23 while changing the seed value SD, This is repeated until the decoded data DC of 10B matches another seed value SD held in the memory 23 (until the decoding is successful).

If the combination of the two-dimensional code CD2TB of the terminal 10B and any seed value SD held in the memory 23 does not succeed in decoding (No in S38), the sender UA of the package 50 possessing the terminal 10A possesses the terminal 10B. It is determined that the delivery of the package 50 to the recipient UB of the package 50 is not valid (S47 in FIG. 14B).

Proceeding to FIG. 14B, the processor 21 calculates the hash value HS' of the terminal 10B based on the decryption source code CD3 of the terminal 10B that has been successfully decrypted (S41).

The processor 21 combines the calculated hash value HS' of the terminal 10B and the hash value HS held in the memory 23 with the seed value SD of the decryption source code CD3 of the successfully decrypted terminal 10B. It is determined whether or not HS matches (S42).

If the hash value HS' of the terminal 10B matches the hash value HS (Yes in S42), the processor 21 determines that the terminal 10B is valid, that is, the recipient UB of the package 50 possessing the terminal 10B is valid. (S43). Validity of the terminal 10B is an example of validation of delivery of the parcel 50 . On the other hand, if the hash value HS' of the terminal 10B does not match the hash value HS (No in S42), the processor 21 receives the package 50 possessing the terminal 10B from the sender UA of the package 50 possessing the terminal 10A. It is determined that the delivery of the package 50 to the person UB is not valid (S47).

The processor 21 combines the two-dimensional code CD2TA obtained by the terminal 10A obtained in step S31 and the seed value SD of the terminal 10A searched from the memory 23, based on the decryption source code CD3 of the terminal 10A. A hash value HS' of 10A is calculated (S44). The seed value SD of the terminal 10A here is another seed value SD retrieved from the memory 23 when the decoding is successful in steps S36 and S37.

The processor 21 combines the calculated hash value HS' of the terminal 10A with the hash value HS held in the memory 23 and paired with the seed value SD of the decryption source code CD3 of the terminal 10A. It is determined whether or not they match (S45).

If the hash value HS' of the terminal 10A matches the hash value HS (Yes in S45), the processor 21 determines that the terminal 10A is valid, that is, the sender UA of the package 50 possessing the terminal 10A is valid. (S46). Validity of the terminal 10A is an example of validation of delivery of the package 50 . On the other hand, if the hash value HS' of the terminal 10A does not match the hash value HS (No in S45), the processor 21 receives the package 50 having the terminal 10B from the sender UA of the package 50 having the terminal 10A. It is determined that the delivery of the package 50 to the person UB is not valid (S47).

Note that the processor 21 may use a hash function (an example of a one-way function) to calculate a hash value SDHS of the seed value SD from the seed value SD of the terminal 10A whose legitimacy is guaranteed. Processor 21 may transmit hash value SDHS to terminal 10A via communication device 32 . In the terminal 10A, the processor 11 may receive the hash value SDHS of the terminal 10A via the communication device 12 and store it in the memory 13. FIG. Since this hash value SDHS is based on the seed value SD forming part of the chain, it is highly reliable and can be used as an electronic seal stamp for the terminal 10A, for example.

14A and 14B, as an example, the terminal 10A possessed by the package sender UA transmits the two-dimensional code CD2TA of the terminal 10A and the two-dimensional code CD2TB of the terminal 10B to the physical distribution management apparatus 20. However, it is not limited to this. 14A and 14B, the terminal 10B possessed by the package recipient UB may transmit the two-dimensional code CD2TA of the terminal 10A and the two-dimensional code CD2TB of the terminal 10B to the physical distribution management apparatus 20. .

In this case, the terminal 10A causes the processor 11 to display on the display device 15 the two-dimensional code CD2 (the two-dimensional code CD2TA of the terminal 10A) distributed by the physical distribution management device 20 and held in the memory 13. The processor 11 of the terminal 10B reads the two-dimensional code CD2TA of the terminal 10A via a two-dimensional code reader (hardware or software). Then, the communication device 12 distributes the read two-dimensional code CD2TA of the terminal 10A and the two-dimensional code CD2 held in the memory 13 of the terminal 10B (the two-dimensional code CD2TB of the terminal 10B). Send to the management device 20 . Even in this case, code decoding is performed sequentially from downstream to upstream in the chain corresponding to downstream to upstream distribution. Therefore, decoding based on the two-dimensional code CD2TA of the terminal 10A is performed after decoding based on the two-dimensional code CD2TB of the terminal 10B.

Regardless of whether the terminal 10 that transmits the two-dimensional codes CD2TA and CD2TB to the physical distribution management device 20 is either the terminal 10A or the terminal 10B, the physical distribution management device 20 can transmit the two-dimensional codes CD2TA and CD2TB to the physical distribution management device 20 according to the operation examples of FIGS. Both the legitimacy and the legitimacy of the terminal 10B can be guaranteed.

It should be noted that the process of verifying the hash value for the terminal 10B in steps S41 to S43 in FIG. 14B can be omitted. That is, steps S41 to S43 may be omitted. Further, the process of verifying the hash value regarding the terminal 10A in steps S44 to S46 of FIG. 14B can be omitted. That is, steps S44 to S46 may be omitted.

When the hash value HS is not calculated, the physical distribution management device 20 can evaluate the validity of the delivery order of the parcels 50 while simplifying the processing related to the decoding of the decoding source code CD3 and shortening the processing time related to the decoding. . Further, when calculating the hash value HS, the physical distribution management device 20 can evaluate the legitimacy of the terminal 10 associated with the node ND corresponding to the hash value HS.

Further, in step S38 of FIG. 14A, if the combination of the two-dimensional code CD2TB of the terminal 10B and any seed value SD held in the memory 23 does not succeed in decoding, the process proceeds to step S47 of FIG. 14B. However, it is not limited to this. Even if the combination of the two-dimensional code CD2TB of the terminal 10B and any seed value SD held in the memory 23 does not succeed in decoding in step S38 of FIG. 14A, the hash value verification processing of steps S41 to S47 is performed. You may

For example, if the node ND corresponding to the terminal 10B is the highest layer node ND in the delivery flow information DF, there is no parent node having the node ND corresponding to the terminal 10B as a child node. Therefore, there is no seed value SD of the parent node corresponding to the decoded data DC obtained by decoding the original decoded code CD3 of the child node. Even in this case, the physical distribution management device 20 performs verification using the hash value HS of the terminal 10B, and finds that the delivery order is incorrect, but the terminal 10B is one of the terminals 10 forming the chain. At least the legitimacy of the terminal 10B can be guaranteed.

Also, for example, if the node ND corresponding to the terminal 10A is the lowest layer node ND in the delivery flow information DF, there is no child node whose parent node is the node ND corresponding to the terminal 10A. Therefore, there is no child node to be decoded to obtain the decoded data DC corresponding to the seed value SD of the parent node. Even in this case, the physical distribution management device 20 performs verification using the hash value HS of the terminal 10A to confirm that the delivery order is invalid, but that the terminal 10A is one of the terminals 10 forming the chain. At least the legitimacy of the terminal 10A can be guaranteed.

Further, when the owner of the terminal 10 cannot send or receive the parcel 50 at a predetermined base, for example, the parcel 50 cannot be delivered from the previous base to the next base after passing through the predetermined base. It can be shipped. When the parcel 50 passes through one base and is delivered at the next base of the next base in this way, the delivery order is determined by decoding based on the decoding source code CD3 of the terminal 10B possessed by the recipient UB of the parcel 50. is determined to be improper. Even in this case, the physical distribution management device 20 performs verification using the hash value HS of the terminal 10A or the terminal 10B to confirm that the delivery order is incorrect, but the terminal 10A or 10B is one of the terminals 10 forming the chain. It is one and can at least guarantee the legitimacy of the terminal 10A or 10B. As a result, even if the delivery order is changed due to, for example, a sudden illness, it can be dealt with.

The physical distribution management device 20 verifies using the hash value that the two-dimensional codes CD2TA and CD2TB held by the terminal 10A or the terminal 10B have been tampered with or the two-dimensional codes held by other terminals 10 have been replaced. In this case, it can be determined that the terminal 10A or the terminal 10B is not legitimate. Therefore, the physical distribution management device 20 can detect fraud and spoofing.

When the processor 21 determines that the delivery order and the terminal 10A or the terminal 10B are valid, the physical distribution management device 20 transmits information indicating that the delivery order and the terminal 10A or the terminal 10B are valid to the terminal 10A. You can Terminal 10A may cause processor 11 to receive this information via communication device 12 and cause display device 15 to display information indicating the delivery order and the validity of terminal 10A or terminal 10B. In this case, the sender UA of the package 50 possessing the terminal 10A can confirm that it is safe to deliver the package 50 to the recipient UB.

15 to 18 are diagrams for supplementary explanation of the decoding operation by the distribution management system 5. FIG. 15 to 18 are arranged in chronological order when the original decoding code CD3 is decoded by the distribution management system 5. FIG. 15 to 18, for the sake of explanation, the seed value SD corresponding to the node ND hierarchically arranged corresponding to the delivery flow information DF at the time of encryption (that is, the seed value SD corresponding to the chain obtained by encryption Seed value SD), etc. are arranged, but the memory 23 does not hold information about this hierarchy.

In FIG. 15, the terminal 10A reads the two-dimensional code CD2TB displayed by the terminal 10B, and transmits the two-dimensional code CD2TB of the terminal 10A held by the terminal 10A and the two-dimensional code 2TB of the terminal 10B to the physical distribution management device 20. there is These processes correspond to the process of step S31 in FIG. 14A.

FIG. 16 shows that the memory 23 holds a plurality of seed values SD. An arbitrary seed value SD in the memory 23 and the two-dimensional code CD2TB of the terminal 10B obtained from the terminal 10A are combined to generate the decoding source code CD3 of the terminal 10B. When the decoding original code CD3 of the terminal 10B is successfully decoded, the decoded data DC of the terminal 10B matches another seed value SD held in the memory 23. FIG. For example, when the node ND corresponding to the terminal 10B is the node NDC2 of the delivery flow information DF, the seed value SD corresponding to the node NDC2 corresponding to the terminal 10B is the seed value SDC2, and the seed value SD obtained by decoding is the seed value SDB corresponding to the node NDB one level above the node NDC2. This node NDB is the node ND corresponding to the terminal 10A. Also, when the node ND corresponding to the terminal 10B is the node NDC2 of the delivery flow information DF, the two-dimensional code CD2TB of the terminal 10B is the two-dimensional code CD2C2. These processes correspond to the processes of steps S32, S33, S36, S37, etc. in FIG. 14A.

In FIG. 17, the seed value SD (SDB) included in the decoded data DC of the terminal 10B and the two-dimensional code CD2TA of the terminal 10A obtained from the terminal 10A are combined to generate the decoding original code CD3 of the terminal 10A. It is The two-dimensional code CD2TA of this terminal 10A is the two-dimensional code CD2B when the terminal 10A corresponds to the node NDB as in FIG. Also, the hash value HS'(HSB') of the terminal 10A is calculated based on the decryption source code CD3 of the terminal 10A. This hash value HSB' is compared with the hash value HS (HSB) of the terminal 10A held in the memory 23 to verify the legitimacy of the terminal 10A.
These processes correspond to the processes such as steps S44 to S47 in FIG. 14B.

In FIG. 18, the seed value SDB corresponding to the node ND (NDB) corresponding to the terminal 10A is hashed to derive the hash value SDHS, and the hash value SDHS is transmitted to the terminal 10A. That is, the hash value SDHS is calculated from the seed value D paired with the two-dimensional code CD2TA transmitted by the terminal 10A, and transmitted to the terminal 10A. Accordingly, by acquiring the hash value SDHS, the terminal 10A can attach the hash value SDHS as a tag to data input via the operation device 14, for example. available for

In this way, according to an example of operation at the time of code decryption, the physical distribution management apparatus 20 holds the seed value SD and the hash value HS obtained at the time of encryption in the memory 23, By obtaining the two-dimensional code CD2 distributed at the time of encryption from 10, the decryption process can be performed. When the decryption process is completed, the physical distribution management device 20 may delete the seed value SD or hash value HS held in the memory 23 from the memory 23. In this case, the capacity of the memory 23 can be used efficiently. .

According to the physical distribution management (delivery management of the package 50) using such a physical distribution management system 5, the sender UA and the receiver UB of the package 50 can easily manage the package with high reliability simply by possessing the terminal 10. 50 deliveries can be performed. In addition, it is not necessary to hold all delivery-related data in the memory 23 as in physical distribution management using a block chain, and the storage load of the memory 23 can be reduced. Therefore, the physical distribution management device 20 can simplify the system configuration and determine that the delivery and receipt of the parcel 50 in the physical distribution process are valid.

Therefore, for example, even if it is a small and medium-sized carrier and it is difficult to incorporate the entire logistics management system 5, if there is an external organization that manages the logistics management device 20, the carrier can use the terminal 10 (for example, a smartphone) , you can enjoy highly reliable logistics management services as described above. In addition, the physical distribution management system 5 can improve the certainty of the delivery authentication of the package 50 compared to the case where the signature for the delivery of the package 50 is written by hand or the seal is pressed. The time required can be shortened. In addition, since the two-dimensional code of one terminal 10 can be read from the other terminal 10 when the package 50 is delivered, it is also useful from the viewpoint of preventing infectious diseases.

In addition, the physical distribution management system 5 confirms the validity of the delivery action by confirming the recipient UB by the sender UA, or confirming the sender UA by the recipient UB, or both, when the package 50 is delivered. It is possible to check when a problem occurs and determine the validity of the entire distribution process. Note that the parcel 50 may also include electronic data, and therefore physical distribution may also include electronic transactions.

In the present embodiment, the second divided data, which is the other of the two divided data obtained by dividing the encrypted data CR, is exemplified as the two-dimensional code CD2, but it is not limited to this. For example, the second divided data may be a one-dimensional bar code, a multi-dimensional code of three or more dimensions, that is, an n-dimensional code (where n is an integer of 1 or more), or a readable code that can be read by another reader or the like. There may be.

<Overview of Embodiment>
As described above, the physical distribution management device 20 of this embodiment manages physical distribution and includes the processor 21 , the memory 23 and the communication device 22 . The processor 21 acquires flow information (for example, delivery flow information DF). In the flow information, a plurality of nodes ND corresponding to a plurality of physical distribution bases are hierarchically arranged according to the order in which the package 50 circulates through the multiple physical distribution bases, and the node ND corresponding to the physical distribution starting base is the highest order. Arranged in layers, a node ND corresponding to a physical distribution completion base is arranged in the lowest layer, and two nodes ND in adjacent layers corresponding to two adjacent bases through which the cargo 50 is distributed are connected. including information to indicate The processor 21 acquires a first cryptographic original code CD (an example of a first original code), which is a code to be encrypted corresponding to the node ND of the first layer in the flow information. The processor 21 encrypts the first cryptographic code CD using the first function (for example, the RSA function) used in the decryptable encryption method to generate the first encrypted data CR. The processor 21 divides the first encrypted data CR to derive a first two-dimensional code CD2 (an example of a first n-dimensional code) and a first seed value SD. Based on the first seed value SD, the processor 21 generates a second cryptographic code CD (second An example of the original code) is derived. The processor 21 encrypts the second cryptographic code CD using the first function to generate second encrypted data CR. The processor 21 divides the second encrypted data CR to derive a second two-dimensional code CD2 (an example of a second n-dimensional code) and a second seed value SD. Processor 21 stores first seed value SD and second seed value SD in memory 23 . The communication device 22 transmits the first two-dimensional code CD2 to the first terminal associated with the first layer node, and transmits the second two-dimensional code CD2 to the second terminal associated with the second layer node. Send to terminal 2.

As a result, the physical distribution management apparatus 20 determines the node ND (child node) of the next lower layer (second layer) based on the seed value SD corresponding to the node ND (parent node) of the upper layer (first layer) in the adjacent layer. ) can be generated. Therefore, the physical distribution management device 20 stores the seed value SD of the parent node and the seed value SD derived based on the encryption code CD of the child node in the memory 23, so that the package 50 can be distributed. Information on distribution bases corresponding to the order can be associated and held. In addition, the physical distribution management device 20 transmits the first two-dimensional code CD2 and the second two-dimensional code CD2 to each terminal 10 associated with each node ND of each layer, thereby partially decoding the information. can be held in each terminal 10 . Therefore, even if the seed value SD held in the memory 23 were leaked, it would be difficult to obtain the encryption code CD through decryption, so the physical distribution management apparatus 20 can maintain high system reliability.

Also, the first layer may be the highest layer. The processor 21 may generate the first cryptographic code CD based on random numbers. After deriving the second cryptographic code CD, the second cryptographic data CR, the second two-dimensional code CD2, and the second seed value SD corresponding to the node ND of the second layer, the processor 21 derives The second seed value SD is set as the next first seed value SD, and the second cryptographic code CD, the second encrypted data CR, the second two-dimensional code CD2, and the second seed value SD , and each iteratively derived second seed value SD may be stored in the memory 23 . The communication device 22 may transmit each iteratively derived second two-dimensional code CD2 to each second terminal associated with each layer 2 node ND.

As a result, the physical distribution management device 20 sets the derived second seed value SD as the next first seed value SD to obtain the second cryptographic code CD corresponding to the node in the second layer and the second seed value SD. 2, the derivation of the encrypted data CR, the second two-dimensional code CD2, and the second seed value SD is repeated while moving one step lower. Therefore, the physical distribution management device 20 generates the cryptographic original code CD based on the seed value SD corresponding to the node ND of each layer from the highest layer to the lowest layer in a large number of consecutive layers. Each cryptographic code CD corresponding to the node ND can be associated in order. Therefore, the physical distribution management device 20 can hold information on a large number of physical distribution bases corresponding to the flow information in association with each other in order.

Also, the processor 21 may calculate the first one-way function value, which is the value of the calculation result using the one-way function, based on the first encrypted data CR. The processor 21 may calculate the second one-way function value, which is the value of the calculation result using the one-way function, based on the second encrypted data CR. The processor 21 pairs the first seed value SD and the first one-way function value, pairs the second seed value SD and the second one-way function value, and stores them in the memory 23. you can

The unidirectional function value is used to prove the legitimacy of the sender and recipient of the parcel 50 at each base corresponding to each node ND corresponding to the unidirectional function value. By storing the one-way function value based on the encrypted data in the memory 23, the physical distribution management device 20 can prove the correctness of the delivery at the site at the time of decryption.

The processor 21 also determines whether or not there are a plurality of second nodes (child nodes) in the second layer connected to the first node (parent node) in the first layer, based on the flow information. you can When there are a plurality of second nodes, the processor 21 stores node identification information (for example, branch number) may be added to generate the second cryptographic code CD.

When a plurality of second nodes (child nodes) in the second layer are connected to the same first node (parent node) in the first layer, the first node branches to a plurality of second nodes. , indicating that a parcel from a base corresponding to a first node is branched and delivered to a plurality of bases corresponding to a plurality of second nodes. In this case, the seed value SD corresponding to the first node is inherited by the second cryptographic code CD corresponding to the plurality of second nodes. In this case, although there is one first seed value corresponding to the first node, the physical distribution management device 20 generates a plurality of second cryptographic codes CD corresponding to this first seed value SD. can. Therefore, after the node ND branches, the physical distribution management device 20 can sequentially generate different encryption original codes CD in each branch route, and each different encryption original code corresponding to each node ND in each hierarchy. Can generate CDs. Therefore, since the decoding is performed based on different codes to be decoded, the physical distribution management device 20 can suppress a decrease in reliability of the system even when there is a branch.

The physical distribution management device 20 of this embodiment manages physical distribution and includes a processor 21 and a memory 23 . The memory 23 holds a plurality of seed values SD. The processor 21 stores a first two-dimensional code CD2 (eg, two-dimensional code CD2TA) held in a first terminal (eg, terminal 10A) and a second two-dimensional code held in a second terminal (eg, terminal 10B). A code CD2 (for example, a two-dimensional code CD2TB) is acquired. The processor 21 combines the second two-dimensional code CD2 and the second seed value SD, which is one seed value SD among the plurality of seed values SD held in the memory 23, to generate a decoding target A second decoded original code CD3 (an example of a second original code) is generated. Processor 21 derives decrypted data DC by decrypting second original decryption code CD3 based on the first function used in the decryptable encryption method. The processor 21 determines whether the decoded data DC matches any of the seed values SD held in the memory 23 and the first seed value SD other than the second seed value SD. If the decoded data DC matches the first seed value SD, the processor 21 transfers data from the user of the first terminal (the sender UA of the parcel 50) to the user of the second terminal (the recipient UB of the parcel 50, for example). It is determined that the delivery order of the parcels 50 is valid.

As a result, the first two-dimensional code CD2 and the second two-dimensional code previously held by the first terminal possessed by the sender UA of the parcel 50 and the second terminal possessed by the recipient UB of the parcel 50 are obtained. A code CD2 is sent to the physical distribution management device 20 . The decoding of the chain is performed from the lower layer code. In physical distribution, sending the package 50 is upstream of receiving the package 50 . Therefore, whether or not the second decoding original code CD3 is decoded based on the second two-dimensional code CD2 held by the terminal 10B, and the data related to the terminal 10A upstream of the terminal 10B is obtained. to confirm. Here, when the decoded data DC matches the first seed value SD in the memory 23, the second seed value SD of the second decoded original code CD3 and the first seed value SD in the memory 23 are chained together. can be determined to form Therefore, the physical distribution management device 20 determines that the node ND corresponding to the second seed value and the node ND corresponding to the first seed value are in adjacent layers in the delivery flow information DF, and the parent node and the child node are separated from each other. can be determined to be related. Therefore, the physical distribution management device 20 can recognize that the delivery (especially the delivery order) of the delivery and receipt of the package 50 is valid.

Further, the processor 21 combines the decoded data DC with the second two-dimensional code CD2 until the decoded data DC matches any first seed value SD other than the second seed value SD held in the memory . The seed value SD of is sequentially changed, the second original decoding code CD3 is generated sequentially, and the decoded data DC is sequentially derived.

As a result, the physical distribution management apparatus 20 can obtain the seed values stored in the memory 23 even if the information regarding the hierarchy such as the delivery flow information DF at the time of encryption is not stored for the plurality of seed values SD stored in the memory 23 . By sequentially searching SD, it is possible to successfully decode the second original decoding code CD3.

In addition, the memory 23 may hold a plurality of pairs of the seed value SD and the first one-way function value (for example, hash value HS) which is the value of the calculation result using the one-way function. . The processor 21 generates a first decoded original code CD3 (an example of a first original code) which is a code to be decoded by combining a first seed value SD matching the decoded data DC and a first two-dimensional code CD2. ), a second one-way function value (eg, hash value HS′ of terminal 10A) may be calculated using a one-way function. Processor 21 may determine whether memory 23 holds a first one-way function value that matches the second one-way function value. Processor 21 may determine that the first terminal is legitimate if the first one-way function value is retained that matches the second one-way function value.

As a result, the physical distribution management device 20 checks the first decryption original code CD3 using the one-way function, so that the first terminal corresponding to the first decryption original code CD3 is an authorized terminal. can determine whether there is In other words, the physical distribution management device 20 can recognize whether or not the sender UA of the package 50, who is the user of the first terminal, is a legitimate sender.

In addition, the memory 23 may hold a plurality of pairs of the seed value SD and the first one-way function value (for example, hash value HS) which is the value of the calculation result using the one-way function. . The processor 21 uses a one-way function to generate a third one-way function value (for example, A hash value HS') of the terminal 10B may be calculated. It may be determined whether memory 23 holds a first one-way function value that matches the third one-way function value. Processor 21 may determine that the second terminal is legitimate if the first one-way function value is retained that matches the third one-way function value.

As a result, the physical distribution management device 20 checks the second decryption original code CD3 using the one-way function, thereby confirming that the second terminal corresponding to the second decryption original code CD3 is an authorized terminal. can determine whether there is In other words, the physical distribution management device 20 can recognize whether or not the recipient UB of the package 50, who is the user of the second terminal, is a valid recipient.

In addition, a plurality of nodes ND corresponding to a plurality of physical distribution bases are hierarchically arranged according to the order in which the package 50 circulates through the plurality of physical distribution bases, and the node ND corresponding to the physical distribution starting base is at the highest layer. In the case where the node ND corresponding to the physical distribution completion point is arranged in the lowest layer, and the node ND in the adjacent layer corresponding to the two adjacent points through which the package 50 is distributed is connected, the processor 21 is a first node (parent node) in the second layer, one level above where the node ND corresponding to the second terminal is located, and a plurality of second nodes (child nodes) in the second layer. If it is connected and includes node identification information (for example, branch numbers) identifying a plurality of second nodes, the node identification information may be deleted from the decoded data DC. The processor 21 may determine whether the decoded data DC from which the node identification information has been deleted matches the first seed value SD.

As a result, the physical distribution management device 20 can suppress the influence of the node identification information on decoding even when a plurality of child nodes exist for the same parent node. In this case, the physical distribution management device 20 can derive information (here, first seed value) of the same parent node from information (here, decoded data DC) associated with a plurality of child nodes. Therefore, for example, even if the delivery flow information DF branches from a parent node to a plurality of child nodes and the code corresponding to each node ND is encrypted to form a chain, the code corresponding to each node ND is encrypted. The seed value SD can be decoded sequentially.

Various embodiments have been described above with reference to the drawings, but it goes without saying that the present invention is not limited to such examples. It is obvious that a person skilled in the art can conceive of various modifications or modifications within the scope described in the claims, and these also belong to the technical scope of the present invention. Understood. Moreover, each component in the above embodiments may be combined arbitrarily without departing from the gist of the invention.

The execution order of each process such as actions, procedures, steps, and stages in the devices, systems, programs, and methods shown in the claims, the specification, and the drawings is , etc., and unless the output of the previous process is used in the subsequent process, it can be implemented in any order. Regarding the operation flow in the claims, the specification, and the drawings, even if the description is made using "first," "next," etc. for convenience, it means that it is essential to carry out in this order. is not.

This application is based on a Japanese patent application (Japanese Patent Application No. 2021-061714) filed on March 31, 2021, the content of which is incorporated herein by reference.

The present disclosure is useful for a physical distribution management device, a physical distribution management method, etc. that can determine whether the sending and receiving of a package in a physical distribution process is valid.

5 Logistics management system 10 Terminal 11 Processor 12 Communication device 13 Memory 14 Operation device 15 Display device 20 Logistics management device 21 Processor 22 Communication device 23 Memory 24 Operation device 25 Display device CDA, CDB Encryption source code CD2, CD2TA, CD2TB Two-dimensional code CD3 Decryption source code DF Delivery flow information HS Hash value ND Node SD Seed value

Claims

A physical distribution management device for managing physical distribution,
comprising a processor, a memory, and a communication device;
The processor
flow information in which a plurality of nodes corresponding to the plurality of physical distribution bases are hierarchically arranged according to the order in which a package circulates through the plurality of physical distribution bases, wherein the node corresponding to the physical distribution start base is the largest; Acquiring flow information in which a node arranged in an upper layer and corresponding to the distribution completion base is arranged in the lowest layer;
obtaining a first original code, which is a code to be encrypted corresponding to a node of the first layer in the flow information;
Encrypting the first original code using a first function used in a decryptable encryption method to generate first encrypted data;
dividing the first encrypted data to derive a first n-dimensional code (n is an integer of 1 or more) and a first seed value;
Based on the first seed value, deriving a second original code that is a code to be encrypted corresponding to a node in a second layer that is one level lower than the first layer,
encrypting the second original code using the first function to generate second encrypted data;
dividing the second encrypted data to derive a second n-dimensional code and a second seed value;
storing the first seed value and the second seed value in the memory;
The communication device is
transmitting the first n-dimensional code to a first terminal associated with the first layer node;
transmitting the second n-dimensional code to a second terminal associated with the layer 2 node;
Logistics management device.
The first layer is the highest layer,
The processor
generating the first original code based on a random number;
After deriving the second original code, the second encrypted data, the second n-dimensional code, and the second seed value corresponding to the node of the second layer, the derived second setting the seed value as the next first seed value, and repeating the derivation of the second original code, the second encrypted data, the second n-dimensional code, and the second seed value;
storing each iteratively derived second seed value in the memory;
The communication device is
transmitting each of the iteratively derived second n-dimensional codes to each of the second terminals associated with each of the second layer nodes;
The physical distribution management device according to claim 1.
The processor
calculating a first one-way function value, which is a value of a calculation result using a one-way function, based on the first encrypted data;
calculating a second one-way function value, which is a value of a calculation result using the one-way function, based on the second encrypted data;
pairing the first seed value with the first one-way function value and pairing the second seed value with the second one-way function value and storing in the memory;
The physical distribution management device according to claim 1 or 2.
The flow information includes information in which nodes in adjacent layers are connected corresponding to two adjacent bases through which the goods are distributed,
The processor
determining whether there are a plurality of second nodes of the second layer connected to the first node of the first layer based on the flow information;
When there are a plurality of the second nodes, node identification information for identifying the plurality of second nodes is added to the first seed value corresponding to the first node for each of the second nodes. to generate the second original code;
The physical distribution management device according to any one of claims 1 to 3.
A physical distribution management device for managing physical distribution,
a processor, a memory, and
The memory holds a plurality of seed values,
The processor
obtaining a first n-dimensional code held in a first terminal and a second n-dimensional code held in a second terminal;
A second element that is a code to be decoded is obtained by combining the second n-dimensional code and a second seed value that is one of the plurality of seed values held in the memory. generate the code,
Deriving decrypted data by decrypting the second original code based on a first function used in a decryptable encryption method,
Determining whether the decoded data matches any of the seed values held in the memory and a first seed value other than the second seed value;
If the decrypted data matches the first seed value, determining that the order of delivery of the package from the user of the first terminal to the user of the second terminal is correct;
Logistics management device.
The processor
The second seed value combined with the second n-dimensional code is sequentially applied until the decoded data matches any one of the first seed values other than the second seed value held in the memory. changing, sequentially generating the second original code, and sequentially deriving the decoded data;
The physical distribution management device according to claim 5.
The memory holds a plurality of pairs of the seed value and a first unidirectional function value that is a value of a calculation result using the unidirectional function,
The processor
Based on the first original code, which is the code to be decoded by combining the first seed value and the first n-dimensional code that match the decoded data, the one-way function is used to generate the second Calculate the one-way function value of
determining whether the memory holds the first one-way function value that matches the second one-way function value;
If the first one-way function value that matches the second one-way function value is held, determining that the first terminal is valid;
The physical distribution management device according to claim 5 or 6.
The memory holds a plurality of pairs of the seed value and a first unidirectional function value that is a value of a calculation result using the unidirectional function,
The processor
calculating a third one-way function value using the one-way function based on the second original code obtained by combining the second seed value and the second n-dimensional code;
determining whether the memory holds the first one-way function value that matches the third one-way function value;
determining that the second terminal is valid if the first one-way function value that matches the third one-way function value is held;
The physical distribution management device according to any one of claims 5 to 7.
A plurality of nodes corresponding to the plurality of distribution bases are hierarchically arranged according to the order in which the package is distributed through the plurality of distribution bases, and a node corresponding to the distribution starting base is arranged in the highest layer. , when the node corresponding to the physical distribution completion base is arranged in the lowest layer, and the nodes in the adjacent layers corresponding to the two adjacent bases through which the goods are distributed are connected,
The processor
A plurality of second nodes in the second layer are connected to a first node in a layer one level above where a node corresponding to the second terminal is located, and the decoded data is transmitted to a plurality of the second nodes in the second layer. 2, deleting the node identification information from the decrypted data;
Determining whether the decrypted data from which the node identification information has been deleted matches the first seed value;
The physical distribution management device according to any one of claims 5 to 8.
A physical distribution management method for managing physical distribution,
flow information in which a plurality of nodes corresponding to the plurality of physical distribution bases are hierarchically arranged according to the order in which a package circulates through the plurality of physical distribution bases, wherein the node corresponding to the physical distribution start base is the largest; Acquiring flow information in which a node arranged in an upper layer and corresponding to the distribution completion base is arranged in the lowest layer;
obtaining a first original code, which is a code to be encrypted corresponding to a node of the first layer in the flow information;
Encrypting the first original code using a first function used in a decryptable encryption method to generate first encrypted data;
dividing the first encrypted data to derive a first n-dimensional code and a first seed value;
Based on the first seed value, deriving a second original code that is a code to be encrypted corresponding to a node in a second layer that is one level lower than the first layer,
encrypting the second original code using the first function to generate second encrypted data;
dividing the second encrypted data to derive a second n-dimensional code and a second seed value;
storing the first seed value and the second seed value in memory;
transmitting the first n-dimensional code to a first terminal associated with the first layer node;
transmitting the second n-dimensional code to a second terminal associated with the layer 2 node;
Logistics management method.
A physical distribution management method for managing physical distribution,
obtaining a first n-dimensional code held in a first terminal and a second n-dimensional code held in a second terminal;
A second original code that is a code to be decoded by combining the second n-dimensional code and a second seed value that is one of a plurality of seed values held in a memory to generate
Deriving decrypted data by decrypting the second original code based on a first function used in a decryptable encryption method,
Determining whether the decoded data matches any of the seed values held in the memory and a first seed value other than the second seed value;
If the decrypted data matches the first seed value, determining that the order of delivery of the package from the user of the first terminal to the user of the second terminal is correct;
Logistics management method.