Source: https://patents.google.com/patent/JP2018038077A/en
Timestamp: 2019-10-16 09:51:21
Document Index: 705941187

Matched Legal Cases: ['art 67', 'art 71', 'art 47', 'art 49', 'art 49', 'art 49']

JP2018038077A - Management device, program, system, and method - Google Patents
Management device, program, system, and method Download PDF
JP2018038077A
JP2018038077A JP2017213108A JP2017213108A JP2018038077A JP 2018038077 A JP2018038077 A JP 2018038077A JP 2017213108 A JP2017213108 A JP 2017213108A JP 2017213108 A JP2017213108 A JP 2017213108A JP 2018038077 A JP2018038077 A JP 2018038077A
JP2017213108A
嘉一 花谷
Kiichi Hanatani
直樹 小椋
2017-11-02 Application filed by 株式会社東芝, Toshiba Corp filed Critical 株式会社東芝
2017-11-02 Priority to JP2017213108A priority Critical patent/JP2018038077A/en
2018-03-08 Publication of JP2018038077A publication Critical patent/JP2018038077A/en
Information is efficiently transmitted to a plurality of devices. A management apparatus according to an embodiment is a management apparatus that can be connected to a plurality of devices via a network. The management device includes a tree storage unit, a similarity calculation unit, an allocation unit, and an allocation transmission unit. The tree storage unit stores management tree information in which node keys are assigned to nodes and devices are assigned to leaf nodes. The similarity calculation unit calculates the similarity between the attribute information indicating the attribute of the new device and the attribute information of the device already assigned to the management tree information. The assigning unit determines a leaf node to which a new device in the management tree information is assigned based on the similarity. The assignment transmitting unit transmits at least one node key assigned to the path from the root node to the corresponding leaf node in the management tree information to the new device. [Selection] Figure 5
Embodiments described herein relate generally to a management apparatus, a program, a system, and a method.
A key shared and held by some of the plurality of devices is called a group key. By encrypting data using such a group key, it is possible to transmit data to devices belonging to the group and to conceal the data from devices not belonging to the group. In addition, a key for distributing a group key to each device, and a key distributed to each device is referred to as a device key.
A method of managing device keys using management tree information, which is data representing a tree-structured graph, is known. In this method, a node key is assigned to each node in the management tree information, and a device is assigned to a leaf node. In this method, all node keys assigned to the path from the root node to the corresponding leaf node are distributed to each device. In this method, the device stores all distributed node key pairs as device keys. The group key is encrypted with any one or more node keys included in the device key at the time of distribution.
By the way, when a new device is connected in the system, a management device that manages management tree information must distribute a node key and a group key to the new device. In this case, the management apparatus must assign a new device to the management tree information so that information can be efficiently transmitted to a plurality of devices belonging to the same group.
JP2012-204897A International Publication No. 02/080448 JP 2005-198116 A
The problem to be solved by the present invention is to assign a device to management tree information so that information can be efficiently transmitted to a plurality of devices.
The management apparatus according to the embodiment can be connected to a plurality of devices via a network. The management device receives first attribute information that is attribute information of the first device. The management device has at least one node assigned to a path from a root node of a tree-structured graph configured by assigning to a second leaf node closest to the first leaf node to the second leaf node Send the key. The first leaf node is a node to which a second device is assigned. The second device is a device in which second attribute information, which is attribute information of the second device, matches the first attribute information.
The block diagram of the communication system which concerns on embodiment. The figure which shows an example of management tree information. The figure which shows an example of a group. The figure which shows the attribute information transmitted from an apparatus to a management apparatus. The figure which shows the example of transmission of the node key determined based on attribute information. The figure which shows the structure of a management apparatus. The figure which shows the structure of an apparatus. The figure which shows the element contained in attribute information. The sequence diagram of the communication system which concerns on embodiment. The flowchart of the allocation process of a management apparatus. The flowchart which shows an example of the process in FIG.10 S25. The figure which shows the 1st example of allocation. The figure which shows the 2nd example of allocation. The figure which shows the 1st example of the management tree information before expansion. The figure which shows the example which extended the upper layer. The figure which shows the 2nd example of the management tree information before expansion. The figure which shows the example which extended the lower layer. The figure which shows the example which extended the intermediate | middle layer. The figure which shows the example which expanded the lower layer of one leaf node. The figure which shows the example which expanded the layer between one leaf node and a root node. The figure which shows the management tree information before reconstruction. The figure which shows the management tree information after a reconstruction. The figure which shows the hardware constitutions of a management apparatus.
Hereinafter, a communication system according to an embodiment will be described in detail with reference to the drawings. The transmission system according to the present embodiment can assign a device to management tree information so that information such as a group key can be efficiently transmitted to a plurality of devices.
In the present embodiment, an encryption key for encrypting data is used. As an algorithm for encrypting and decrypting data with an encryption key, a symmetric key encryption method such as AES may be used, or an asymmetric key encryption method (public key encryption method) may be used.
FIG. 1 is a diagram illustrating a configuration of a communication system 10 according to the embodiment. The communication system 10 includes a management device 20 and a plurality of devices 30 (30-A to 30-F).
The management device 20 and the plurality of devices 30 can be connected to each other via a network. The network is, for example, a LAN formed in a home. The network may include a public line such as the Internet or VPN (Virtual Private Network). In addition, various forms such as a wireless LAN compliant with IEEE 802.11, Ethernet (registered trademark), IEEE 1394, and the like can be applied to the network as a physical layer and a link layer.
The management device 20 is an information processing device such as a computer. The management device 20 executes a predetermined program on the operating system, and is always activated, for example.
The device 30 is a device having a communication function and an information processing function. For example, the device 30 may be an appliance (an air conditioner, a television device, a refrigerator, or the like that can be connected to a network) used at home. The device 30 may be a portable information device such as a smartphone, a tablet, or a notebook computer.
In the communication system 10, data is transmitted between the management device 20 and the device 30 or between the device 30 and the device 30. The transmitted data includes, for example, a control command for controlling the operation of the device 30, a key value used for encryption or authentication by the management device 20 or the device 30, key identifier information, and the management device 20 or the device 30. Identification information (such as MAC address or IP address). The data to be transmitted may be moving image data, audio data, text data, program code, or the like.
Such data is encrypted with the group key. The group key is a key that is commonly held by the devices 30 belonging to the group.
The management apparatus 20 sets groups for a plurality of devices 30 connected to the network, for example, according to an instruction from a user or the like, a preset rule, or the like. The management device 20 may set a plurality of groups. In addition, the management apparatus 20 may cause one device 30 to belong to a plurality of groups. In addition, there may be a device 30 that does not belong to a group. The management device 20 assigns a unique group key for each group. The management device 20 can encrypt data with a group key and transmit it to the network, thereby allowing the device 30 belonging to the group to acquire the data and keeping the data secret from the device 30 not belonging to the group.
Further, the management device 20 encrypts the group key with the node key assigned to each device 30 and gives the same to the device 30. The node key is a key shared by the management apparatus 20 and the device 30. One device 30 holds at least one set of node keys as a device key. The management device 20 manages the node key held by each device 30 using management tree information representing a tree structure (undirected graph having no loop). Note that the management apparatus 20 may encrypt the data with the node key and transmit it to the device 30.
FIG. 2 is a diagram illustrating an example of management tree information. The management tree information includes a plurality of nodes (indicated by circles in FIG. 2) and a plurality of edges connecting the nodes. One node at the apex (top layer) of the tree structure is called a root node. Each node arranged at the end (lowest layer) of the tree structure is called a leaf node.
Each node is assigned a unique node number. In the example of FIG. 2, the numbers in the circles indicate the node numbers.
The management device 20 assigns a node key to each node. The node key is different for each node. In the example of FIG. 2, the management device 20 assigns node keys K1 to K15 to nodes having node numbers 1 to 15.
In addition, the management device 20 assigns each device 30 to any leaf node. The management apparatus 20 assigns one device 30 to one leaf node, and does not assign a plurality of devices 30 to one leaf node. The management tree information may include an empty leaf node to which no device 30 is assigned. In the example of FIG. 2, the management apparatus 20 assigns the devices 30 having the identification information A, B, C, D, E, and F to the nodes having the node numbers 8, 9, 10, 11, 13, and 15.
In addition, the management apparatus 20 has at least one node key (for example, a root node) assigned to each device 30 in a path from the root node in the management tree information to the corresponding leaf node to which the device 30 is assigned. All node keys assigned to the path from the corresponding leaf node to the corresponding leaf node). The device 30 stores at least one node key set transmitted from the management apparatus 20 as a device key. For example, the management apparatus 20 transmits the node keys K1, K2, K4, and K8 to the device 30 having the identification information A assigned to the node number 8. The management device 20 does not need to transmit all the node keys of the path from the root node to the corresponding leaf node as long as it transmits at least the node key assigned to the leaf node.
The management tree information is not limited to a binary tree, and may be a triple tree or more. Further, the management tree information may have an incomplete tree structure or various structures.
FIG. 3 is a diagram illustrating an example of a group. The management device 20 generates a unique group key for each group. The management device 20 transmits at least one ciphertext generated by encrypting one group key with at least one node key to each device 30 belonging to the group. Specifically, the management device 20 assigns at least one node key so that all the devices 30 belonging to the group can decrypt any ciphertext and the number of ciphertexts to be transmitted is minimized. select. And the management apparatus 20 produces | generates a ciphertext with each selected node key, and transmits.
In the example of FIG. 3, the devices 30 with the identification information A and B form a group α. The node key K4 is commonly held by the devices 30 having the identification information A and B, but is not held by the other devices 30. Accordingly, the management device 20 encrypts the group key GKα of the group α with the node key K4. As a result, the management device 20 can efficiently transmit the group key GKα to the two devices 30 forming the group α.
In the example of FIG. 3, the devices 30 having the identification information A, B, C, and D form a group β. The node key K2 is commonly held by the devices 30 having the identification information A, B, C, and D, but is not held by the other devices 30. Therefore, the management device 20 encrypts the group key GKβ of the group β with the node key K2. Thereby, the management apparatus 20 can transmit the group key GKβ efficiently to the four devices 30 forming the group β.
In the example of FIG. 3, the devices 30 having the identification information E and F form a group γ. The node key K3 is commonly held by the devices 30 having the identification information E and F, but is not held by the other devices 30. Therefore, the management apparatus 20 encrypts the group key GKγ of the group γ with the node key K3. Thereby, the management apparatus 20 can efficiently transmit the group key GKγ to the two devices 30 forming the group γ.
FIG. 4 is a diagram illustrating the attribute information transmitted from the device 30 to the management device 20 and the node key determined based on the attribute information transmitted from the management device 20 to the device 30. FIG. 5 is a diagram illustrating another example of transmission of attribute information and a node key determined based on the attribute information.
The device 30 transmits attribute information indicating the attribute of the device 30 to the management apparatus 20. The attribute information includes at least one element information. The attribute information includes, for example, identification information, vendor name, type, average power consumption, or most frequent command name as element information. Details of the attribute information will be described later with reference to FIG.
The management device 20 determines one or more node keys to be assigned to each device 30 based on such attribute information, and transmits the node key to the device 30. Further, as illustrated in FIG. 5, when the node key assignment of the other device 30-2 is changed due to the assignment of the node key to the device 30-1, the management device 20 changes the device 30-2. Send the changed node key to.
Here, the management device 20 receives the attribute information of the first device 30, and the route of the management tree information configured based on the attribute information of the first device 30 and the attribute information of one or more second devices 30 At least one node key assigned to the path from the node to the leaf node is transmitted.
More specifically, the management device 20 receives the first attribute information that is the attribute information of the first device 30, and assigns it to the second leaf node closest to the first leaf node. At least one node key assigned to the path from the root node of information to the second leaf node is transmitted. The first leaf node is a node to which the second device 30 is assigned. The second device 30 is a device 30 in which the second attribute information that is the attribute information of the second device 30 matches the first attribute information. In this case, the management apparatus 20 may further transmit at least one node key assigned to the path from the root node of the management tree information to the first leaf node.
The management device 20 receives attribute information of at least one device 30 of the plurality of devices 30, and transmits at least one node key assigned to the path from the root node of the management tree information to each leaf node. Also good. In this case, the management tree information is obtained by assigning the device 30 having the same attribute information received among the plurality of devices 30 to the first leaf node, and receiving the attribute among the plurality of devices 30. The device 30 whose information does not match is assigned to the second leaf node.
For example, when a new device 30 is allocated to the management tree information, the management device 20 determines an allocation position (leaf node position) based on the attribute information of the new device 30. More specifically, the management device 20 determines the allocation position of the new device 30 so that the devices 30 with similar attribute information are close to each other and the devices 30 with dissimilar attribute information are close to each other. As a result, the management apparatus 20 can efficiently transmit information such as a group key with a small amount of information (number of ciphertexts) to a plurality of devices 30 belonging to the same group.
FIG. 6 is a diagram illustrating the configuration of the management apparatus 20. The management device 20 includes a tree storage unit 41, a group storage unit 42, an attribute storage unit 43, a device discovery unit 44, a device authentication unit 45, an attribute acquisition unit 46, a similarity calculation unit 47, and an allocation unit. 48, an allocation transmission unit 49, a group key transmission unit 50, a generation unit 51, an expansion unit 52, a reconfiguration unit 53, an encryption unit 54, and a first communication unit 55.
The tree storage unit 41 stores management tree information in which a node key is assigned to a node and a device 30 is assigned to a leaf node. The group storage unit 42 stores group identification information, a group key, and a list of devices 30 belonging to each group. The attribute storage unit 43 stores attribute information for each device 30.
The device discovery unit 44 discovers the device 30 existing on the network. The device authentication unit 45 performs an authentication process with the device 30 and confirms whether the communication partner device 30 has a legitimate authority.
The attribute acquisition unit 46 acquires attribute information from the authenticated device 30. For example, when a new device 30 is connected to the network, the attribute acquisition unit 46 acquires attribute information from the new device 30. Further, the attribute acquisition unit 46 may periodically acquire element information that changes with time from the respective devices 30 among the attribute information. The attribute acquisition unit 46 stores the acquired attribute information in the attribute storage unit 43.
The similarity calculation unit 47 calculates the similarity between the attribute information of the two devices 30. For example, when a new device 30 is connected to the network and the new device 30 is assigned to the management tree information, the similarity calculation unit 47 has already been assigned to the attribute information of the new device 30 and the management tree information. The degree of similarity with the attribute information of each device 30 is calculated.
The allocation unit 48 allocates a new device 30 to the management tree information stored in the tree storage unit 41. In this case, the assigning unit 48 assigns a new device 30 (position of a leaf node) based on the similarity between the attribute information of the new device 30 and the attribute information of the existing device 30 already assigned to the management tree information. ). More specifically, the allocating unit 48 determines the position of the leaf node to which the new device 30 is allocated so that the devices 30 with high similarity are arranged in a close range. For example, the assigning unit 48 uses a predetermined number of edges from the leaf node to which the device 30 having a higher similarity with the attribute information of the new device 30 than the reference (for example, the device 30 with the highest similarity) is assigned. A new device 30 is assigned to the reachable empty leaf node.
When a new device 30 is assigned to the management tree information, the assignment transmission unit 49 encrypts at least one node key with the key shared by the authentication process, and transmits the encrypted key to the new device 30. More specifically, the assignment transmission unit 49 transmits at least one node key assigned to the path from the root node in the management tree information to the leaf node corresponding to the new device 30 to the new device 30. . The new device 30 stores the received set of at least one node key as a device key. Further, the assignment transmission unit 49 may encrypt and send the assignment position and node key identification information in the management tree information to the new device 30.
The group key transmission unit 50 generates a group key when a new group is formed. The group key transmission unit 50 transmits the group key to all the devices 30 belonging to the formed new group. In this case, in the group key transmission unit 50, all the devices 30 belonging to the group have at least one of them, the device 30 not belonging to the group does not have, and the number of ciphertexts is One or more node keys are selected so as to be the least. Then, the group key transmission unit 50 encrypts the group key with the selected one or more node keys and transmits one or more ciphertexts.
In addition, when a new device 30 is assigned to the management tree information and the new device 30 is added to any group, the group key transmission unit 50 transmits a corresponding group key to the new device 30. . In this case, the group key transmission unit 50 encrypts the corresponding group key with a node key that is owned by the new device 30 and not owned by the device 30 that does not belong to the group.
The generation unit 51 generates new management tree information and stores it in the tree storage unit 41. For example, when the new device 30 is first connected to the network and the management information to be allocated does not exist in the tree storage unit 41, the generation unit 51 generates new management tree information and stores it in the tree storage unit 41. .
The extension unit 52 extends the management tree information stored in the tree storage unit 41 when the number of empty leaf nodes in the management tree information is smaller than a predetermined number. For example, the extension unit 52 extends the management tree information when a new device 30 is connected to the network and there is no empty leaf node in the management tree information stored in the tree storage unit 41. Note that extending the management tree information means adding new nodes and edges so that the number of leaf nodes included in the management tree information increases.
The reconfiguration unit 53 reconfigures the management tree information stored in the tree storage unit 41. For example, the reconfiguration unit 53 changes the allocation position of the device 30 to the leaf node in the management tree information so that the devices 30 with high similarity are concentrated in a close range. More specifically, for example, the reconfiguration unit 53 determines the allocation positions of the devices 30 in the management tree information to the leaf nodes, and the devices 30 whose attribute information similarity is equal to or greater than a predetermined value are determined in advance. Change to be within the reachable range by the number of edges. For example, the reconfiguration unit 53 performs reconfiguration when a periodic or predetermined event occurs.
The encryption unit 54 encrypts target data using a group key or a node key when transmitting data from the management apparatus 20 to any device 30. The encryption unit 54 encrypts the target data with the group key when transmitting data collectively to the devices 30 belonging to the designated group. Also, the encryption unit 54, when transmitting data to any one or more designated devices 30, is a node that is owned by the designated device 30 and not owned by another device 30. Select the key and encrypt the target data.
The first communication unit 55 communicates with the device 30 via a network. For example, the first communication unit 55 executes layer processing such as a physical layer and a data link layer for communicating with the device 30.
FIG. 7 is a diagram illustrating a configuration of the device 30. The device 30 includes an information storage unit 61, a fixed attribute storage unit 62, an attribute measurement unit 63, a management device discovery unit 64, a request unit 65, a management device authentication unit 66, an attribute transmission unit 67, and an allocation reception. Unit 68, group key receiving unit 69, decrypting unit 70, and second communication unit 71.
The information storage unit 61 stores a device key that is a set of at least one node key assigned to the device 30. Furthermore, the information storage unit 61 may store the identification position of each node key and the allocation position in the management tree information. Further, the information storage unit 61 stores a group key of the group to which the device 30 belongs and group identification information.
The fixed attribute storage unit 62 stores element information that does not change with time from among the element information included in the attribute information. The attribute measuring unit 63 measures element information that changes with time from among the element information included in the attribute information. The attribute measuring unit 63 may measure periodically or when a predetermined event occurs.
The management device discovery unit 64 discovers the management device 20 existing on the network. The request unit 65 requests the management device 20 to assign to the management tree information and issue at least one node key set. For example, when the device 30 is newly connected to the network, the request unit 65 requests the issuance of at least one node key set. The management device authentication unit 66 performs authentication processing with the management device 20 and confirms whether or not the management device 20 of the communication partner has a valid authority.
The attribute transmission unit 67 transmits the attribute information to the management device 20. For example, the attribute transmitting unit 67 transmits the attribute information to the management apparatus 20 at the time of requesting assignment to the management tree information and issuing at least one node key set. Moreover, the attribute transmission part 67 may transmit the element information which changes in time among the element information contained in attribute information to the management apparatus 20 when a predetermined event generate | occur | produces regularly or beforehand.
The assignment receiving unit 68 receives at least one node key transmitted from the management device 20. The assignment receiving unit 68 causes the information storage unit 61 to store the received pair of at least one node key as a device key. Further, the assignment receiving unit 68 receives the assignment position in the management tree information of the device 30 and the identification information of each node key. The allocation receiving unit 68 stores the received information in the information storage unit 61. When the device 30 is newly connected to the network, the node key, the allocation position, and the node key identification information are encrypted with the key shared by the authentication process with the management apparatus 20. The allocation receiving unit 68 decrypts the node key, the allocation position, and the identification information of the node key using the shared key.
The group key receiving unit 69 receives the encrypted group key from the management apparatus 20. The group key is encrypted with any node key of at least one set of node keys included in the device key held by the device 30. Therefore, the group key receiving unit 69 selects any one of the node key pairs included in the device key stored in the information storage unit 61, and uses the selected node key, Decrypt the group key. The group key receiving unit 69 stores the decrypted group key in the information storage unit 61.
The decrypting unit 70 decrypts the data transmitted from the management device 20 using any node key included in the group key or the device key. The 2nd communication part 71 communicates with the management apparatus 20 and the other apparatus 30 via a network. For example, the second communication unit 71 executes layer processing such as a physical layer and a data link layer for communicating with the management device 20 or another device 30.
FIG. 8 is a diagram illustrating elements included in the attribute information. The attribute information includes element information that does not change with time (fixed element information) and element information that changes with time (element information that changes with time). The attribute information may include any one of fixed element information and time-dependent element information.
The fixed element information is, for example, identification information, vendor name, type, memory amount, maximum power consumption, and the like. The identification information is information for uniquely identifying the device 30 on the network, and is, for example, a MAC address, an IP address, or a manufacturing number of the device 30. The vendor name is the name of the manufacturer or sales company of the device 30. The type is a name representing the product function of the device 30. Specifically, the type describes, for example, an air conditioner, a television device, a refrigerator, and the like.
The memory amount is a capacity value of a memory included in the device 30. The amount of memory is not limited to the capacity value, and may be information such as whether the capacity value is larger than a predetermined threshold. The maximum power consumption is the maximum value of power consumed by the device 30.
The element information of change with time is, for example, average power consumption, mode command name, command frequency, and the like. The average power consumption is an average value of the power consumed by the device 30 in a certain period (for example, from the start of operation to the current time). The most frequent command name is the name of the most frequent control command executed by the device 30 during a certain period (for example, from the start of operation to the present time). The command frequency is the frequency at which the device 30 executes the control command in a certain period (for example, from the start of operation to the current time).
The element information included in the attribute information includes, for example, model name, device cache amount, CPU (Central Processing Unit) name, rated power consumption, communication method, network topology, management device 20 to device information. The number of hops to reach 30, the radio wave intensity, the date of manufacture of the device 30, the installation location of the device 30, whether the device 30 is movable or fixed, identification information of the connected peripheral device, etc. There may be. The combination of element information included in the attribute information may be any combination.
FIG. 9 is a sequence diagram of the communication system 10 according to the embodiment. In the communication system 10, when a new device 30 is connected to the network, processing is executed according to the sequence shown in FIG.
First, in step S11, the management device 20 and the device 30 discover each other's devices via the network. Subsequently, in step S12, the device 30 requests the management apparatus 20 to assign to the management tree information and issue at least one node key set (device key).
Subsequently, in step S13, the management device 20 and the device 30 perform authentication processing with each other to confirm whether the communication partner has a valid authority. The management apparatus 20 may execute an authentication process for determining whether to connect to the device 30 in step S13 in combination with the process in step S11 or step S12.
The management apparatus 20 and the device 30 authenticate using a method such as ISO / IEC 9798-1 or ISO / IEC 9798-3, for example. Further, the management device 20 and the device 30 may be authenticated by a method using a public key certificate. Further, the management device 20 and the device 30 may generate a key used for authentication based on a previously shared password, or use a secret key embedded in the device 30 at the time of factory shipment or the like as a key used for authentication. May be.
Subsequently, when it is confirmed that the other party is a valid management device 20, in step S14, the device 30 transmits attribute information. In this case, the device 30 transmits element information that does not change with time. In addition, when the element information that changes with time is measured, the device 30 may also transmit the element information that changes with time.
Note that the device 30 may transmit the attribute information any time before the next allocation process (S15). For example, when using UPnP SSDP for the discovery process (S11), the device 30 may transmit the attribute information included in one entry of the device description. In addition, in the case where HTTP is used for the request processing (S12) protocol, the device 30 may define a dedicated field as one entity of the HTTP request header and transmit the attribute information, or the HTTP GET request You may include the storage location of attribute information in URL.
Subsequently, in step S15, the management device 20 executes an allocation process for allocating the device 30 to any leaf node in the management tree information. The allocation process will be described later with reference to FIG.
Subsequently, in step S <b> 16, the management device 20 transmits the allocation information obtained by the allocation process in step S <b> 15 to the device 30. The assignment information includes at least one node key set (device key) assigned to the corresponding device 30. The allocation information may include an allocation position in the management tree information and identification information of each node key. In addition, the management apparatus 20 encrypts the allocation information with the key shared by the authentication process and transmits it to the device 30.
Subsequently, in step S17, the management apparatus 20 acquires a group key of the group to which the corresponding device 30 belongs, and any one or more nodes among the at least one node key transmitted to the device 30 in step S16. Encrypt with key. In this case, the management apparatus 20 encrypts the group key with a node key that is not owned by the device 30 other than the group.
Subsequently, in step S18, the encrypted group key is transmitted to the device 30. Subsequently, in step S <b> 19, the device 30 receives the encrypted group key from the management apparatus 20 and selects one of at least one node key pair (device key) that it holds. And decrypting with the selected node key. Through the above processing, the device 30 can obtain at least one node key set (device key) and group key from the management apparatus 20.
FIG. 10 is a flowchart of the allocation process of the management apparatus 20. The management device 20 executes the process shown in FIG. 10 in the allocation process (S15).
First, in step S <b> 21, the generation unit 51 of the management device 20 determines whether or not management tree information exists in the tree storage unit 41. When the management tree information does not exist (No in S21), in step S22, the generation unit 51 generates new management tree information and stores it in the tree storage unit 41. In this case, the generation unit 51 generates i-stage management tree information having a predetermined hierarchy (i is an integer of 2 or more). The hierarchy of management tree information represents the number of edges of the route from the root node to the leaf node. Subsequently, in step S23, the allocation unit 48 of the management apparatus 20 allocates a new device 30 to any leaf node in the new management tree information. When step S23 ends, the management device 20 ends the allocation process.
On the other hand, when the management tree information exists (Yes in S21), in step S24, the similarity calculation unit 47 of the management device 20 adds the attribute information of the new device 30 and each of the already assigned to the management tree information. The degree of similarity with the attribute information of the device 30 is calculated.
When calculating the similarity between the two pieces of attribute information, the similarity calculation unit 47 compares, for example, whether the corresponding element information is the same or the difference between the values is within a certain range. For example, the similarity calculation unit 47 determines whether the vendor name is the same, the type is the same, the difference in memory amount is within a certain range, the difference in maximum power consumption is within a certain range, an average It is compared whether the difference in power consumption is within a certain range, whether the most frequent command name is the same, whether the difference in command frequency is within a certain range, and the like.
And the similarity calculation part 47 synthesize | combines the comparison result for every some element information, and calculates a similarity. For example, the similarity calculation unit 47 has one point when the element information is the same or the value difference is within a certain range, and 0 when the element information is not the same or the value difference exceeds the certain range. A score is obtained, and a value obtained by summing the scores of a plurality of element information is defined as a similarity.
Further, the similarity calculation unit 47 may extract and compare specific one or more pieces of predetermined element information instead of comparing all the element information in the attribute information. For example, the similarity calculation unit 47 may compare the type and average power consumption, and may calculate the similarity by combining these comparison results.
The similarity calculation unit 47 may combine the comparison results with different weights depending on the element information. The similarity calculation unit 47 may be, for example, 5 points if the types match, 2 points if the vendor names match, and 4 points if the difference in average power consumption values is within a certain range. You may change the weight. Note that the similarity calculation unit 47 may calculate the similarity by another calculation method instead of the above calculation method.
Subsequently, in step S25, the assignment unit 48 assigns a new device 30 to any leaf node in the management tree information based on the calculated similarity. In this case, the assigning unit 48 assigns a new device 30 to any empty leaf node so that similar devices 30 are concentrated and arranged nearby. For example, the assigning unit 48 assigns the new device 30 to the empty leaf node that can be reached within a certain number of edges from the device 30 having the highest similarity to the attribute information of the new device 30. Further, when there is no empty leaf node that can be reached within a certain number of edges from the device 30 having the highest similarity, the allocating unit 48 expands the management tree information to the expansion unit 52 and then adds a new device. 30 may be assigned.
When step S25 ends, the management device 20 ends the allocation process.
FIG. 11 is a flowchart showing an example of the process in step S25 of FIG. The allocating unit 48 may execute, for example, the process shown in FIG. 11 in step S25 of FIG.
First, in step S31, the assigning unit 48 detects a leaf node to which the device 30 having the highest similarity with the attribute information of the new device 30 among the devices 30 already assigned to the management tree information is assigned. .
Subsequently, in step S32, the assigning unit 48 determines whether or not there is an empty leaf node within n parents or the like from the leaf node to which the device 30 having the highest similarity is assigned. Here, a leaf node within n parents or the like (n is an integer equal to or greater than 1) refers to another leaf node that can be reached by the number of edges n times or less from a leaf node to which a certain device 30 is assigned. . For example, in the example illustrated in FIG. 2, the closeness between the leaf node 8 and the leaf node 9 is two. The closeness between leaf node 8 and leaf node 12 is six.
If there is an empty leaf node within the n-degrees from the leaf node to which the device 30 having the highest similarity is assigned (Yes in S32), in step S33, the assignment unit 48 determines an empty leaf within the n-degrees of equality. A new device 30 is assigned to the node. That is, the assigning unit 48 assigns a new device 30 from a leaf node to which the device 30 having the highest similarity is assigned to an empty leaf node that can be reached with a predetermined number of edges. Thereby, the assigning unit 48 can assign a new device 30 to a position close to the existing device 30 having the most similar attribute information in the management tree information.
In step S31, the assigning unit 48 may detect a leaf node to which the device 30 having the highest similarity among the similarity degrees equal to or higher than the reference value is assigned. In this case, if there is no device 30 with a similarity equal to or higher than the reference value, the assignment unit 48 may assign a new device 30 to an empty leaf node that is farther away from the n-parent or the like. Thereby, the assigning unit 48 can assign a new device 30 to a position far from the existing device 30 in which the attribute information is not similar in the management tree information.
And the management apparatus 20 returns a process to the flow of FIG. 10, after complete | finishing step S33.
On the other hand, if there is no empty leaf node within n parents or the like from the leaf node to which the device 30 having the highest similarity is assigned (No in S32), the assigning unit 48 specifies that the management tree information is empty in step S34. It is determined whether or not a leaf node exists. If there is no empty leaf node in the management tree information (No in S34), the allocating unit 48 advances the process to Step S35. If there is an empty leaf node in the management tree information (Yes in S34), the allocating unit 48 performs the processing. Proceed to step S36.
In step S35, the extension unit 52 extends the tree structure of the management tree information. Thereby, the extension unit 52 can create an empty leaf node in the management tree information. Then, after extending the management tree information, the extension unit 52 returns the process to step S32 and repeats the process. Note that the extension unit 52 may advance the process to step S36 after extending the management tree information. The management tree information expansion process will be described later with reference to FIGS.
In step S36, the assigning unit 48 assigns a new device 30 to any empty leaf node. And the management apparatus 20 returns a process to the flow of FIG. 10, after complete | finishing step S36.
In step S34, the assigning unit 48 determines whether or not there are more than a predetermined number of empty leaf nodes in the management tree information, instead of whether or not there are empty leaf nodes in the management tree information. You may judge. In this case, the assignment unit 48 advances the process to step S35 if there are not more than a predetermined number of empty leaf nodes, and advances the process to step S36 if there are.
FIG. 12 is a diagram illustrating a first assignment example of the device 30 to the management tree information. For example, the management tree information has a two-level complete binary tree structure as shown in FIG. 12, and the first device 30-A is assigned to the leaf node with the node number 4, and the leaf node with the node number 6 Is assigned the second device 30 -B, and the third device 30 -C is assigned to the leaf node of node number 7. In the example of FIG. 12, the first device 30-A has a set (device key) of three node keys K1, K2, and K4. The second device 30-B has a set (device key) of three node keys K1, K3, and K6. The third device 30-C holds a set (device key) of three node keys K1, K3, and K7.
In the example of FIG. 12, when causing the first device 30-A and the second device 30-B to execute the control command CMD, the management device 20 generates and transmits two ciphertexts represented by the following expressions: To do. Accordingly, the first device 30-A and the second device 30-B can hold the group key GK. E (K, M) represents a ciphertext obtained by encrypting the data M using the key K.
C1 = E (K4, GK)
C2 = E (K6, GK)
Subsequently, the management device 20 encrypts the control command CMD using the group key GK as represented by the following equation, and multicasts the ciphertext.
C3 = E (GK, CMD)
The first device 30-A and the second device 30-B decrypt the received ciphertext using the group key GK. Accordingly, the first device 30-A and the second device 30-B can execute the control command CMD. Thus, when the management tree information is configured as shown in FIG. 12, the management device 20 transmits three ciphertexts to the first device 30-A and the second device 30-B. The control command CMD can be executed.
In the example of FIG. 12, the management device 20 can cause the first device 30-A and the second device 30-B to execute the control command CMD without transmitting the group key GK. In this case, the management device 20 generates and transmits a ciphertext represented by the following expression. When the group key GK is not transmitted, the management device 20 can cause the first device 30-A and the second device 30-B to execute the control command CMD by transmitting two ciphertexts. .
C1 '= E (K4, CMD)
C2 '= E (K6, CMD)
FIG. 13 is a diagram illustrating a second example of assigning the device 30 to management tree information. The management tree information shown in FIG. 13 is different from FIG. 12 in that the second device 30-B is assigned to the node with the node number 5. In the example of FIG. 13, the second device 30-B holds a set (device key) of three node keys K1, K2, and K5.
In the example of FIG. 13, in order to cause the first device 30-A and the second device 30-B to execute the control command CMD, the management device 20 first generates a ciphertext represented by the following equation: , Send multicast. Accordingly, the first device 30-A and the second device 30-B can hold the group key GK.
C1 ″ = E (K2, GK)
The first device 30-A and the second device 30-B decrypt the received ciphertext using the group key GK. Accordingly, the first device 30-A and the second device 30-B can execute the control command CMD. As described above, when the management tree information is configured as shown in FIG. 13, the management device 20 transmits the two ciphertexts, thereby the first device 30 -A and the second device 30 -B. Can execute the control command CMD.
In the example of FIG. 13, the management apparatus 20 can cause the first device 30-A and the second device 30-B to execute the control command CMD without transmitting the group key GK. In this case, the management apparatus 20 generates a ciphertext represented by the following formula and transmits it by multicast. When the group key GK is not transmitted in this way, the management apparatus 20 causes the first device 30-A and the second device 30-B to execute the control command CMD by transmitting one ciphertext. be able to.
C1 ″ ″ = E (K2, CMD)
As described above, when the same control command CMD is executed by the first device 30-A and the second device 30-B, the management tree information in FIG. 13 is more than the management tree information in FIG. The amount of data transmission can be reduced, and efficiency is high.
Here, the management tree information of FIG. 12 is compared with the management tree information of FIG. In the management tree information in FIG. 12, the distance between the leaf node to which the first device 30-A is assigned and the leaf node to which the second device 30-B is assigned is the distance of the fourth parent. On the other hand, the management tree information in FIG. 13 indicates that the distance between the leaf node to which the first device 30-A is assigned and the leaf node to which the second device 30-B is assigned is the distance between the second degree and the like. It has become. That is, in the management tree information of FIG. 13, the first device 30-A and the second device 30-B are allocated in a range closer to the management tree information of FIG. Therefore, the management tree information indicates that the amount of information to be transmitted (the number of ciphertexts) when the devices 30 belonging to one group are assigned to a close leaf node is more than that assigned to a distant leaf node. ) Can be reduced.
In addition, the management device 20 is highly likely to simultaneously transmit the same data to a plurality of devices 30 with high similarity of attribute information. For example, when the power consumption of the entire communication system 10 is suppressed, the management device 20 is highly likely to simultaneously transmit a control command or the like for reducing the power consumption to a plurality of air conditioners. Accordingly, the management device 20 can reduce the amount of information to be transmitted (the number of ciphertexts) by assigning a plurality of devices 30 having high similarity in attribute information to leaf nodes within a predetermined range in the management tree information. .
The management apparatus 20 according to the present embodiment assigns devices 30 having high similarity in attribute information to close positions in the management tree information. Therefore, according to the management apparatus 20, data can be efficiently transmitted to a plurality of devices 30 with a small amount of information.
(Extended management tree information)
For example, the extension unit 52 allocates a new device 30 to management tree information, and the number of empty leaf nodes in the management tree information is smaller than a predetermined number (for example, there is no empty leaf node). ), Extend the management tree information.
The extension unit 52 extends the management tree information when there is no empty leaf node within n parents or the like from the leaf node of the device 30 having the attribute information having the highest similarity to the new device 30 in the management tree information. May be. Further, the extension unit 52 may extend the management tree information when a regular or predetermined event occurs and the number of empty leaf nodes in the management tree information is smaller than a predetermined number. . For example, the expansion unit 52 may expand the management tree information every time the number of devices 30 connected to the network exceeds a predetermined number.
Hereinafter, an extended example of management tree information and a method of transmitting the extended node key will be described.
FIG. 14 is a diagram illustrating a first example of management tree information before expansion. For example, as shown in FIG. 14, the management tree information has a one-level complete binary tree structure, and the first device 30-A is assigned to the leaf node with the node number 4, and the leaf node with the node number 5 It is assumed that the second device 30-B is assigned to. In the example of FIG. 14, the first device 30-A has a set (device key) of two node keys K2, K4. The second device 30-B has a set (device key) of two node keys K2 and K5.
In such a case, the allocation unit 48 cannot allocate the new device 30 to the management tree information. Therefore, the extension unit 52 adds a node to an upper layer of the existing root node of the management tree information, for example.
FIG. 15 is a diagram showing an example in which a new node is added to the upper layer of the root node in the management tree information of FIG. In the example of FIG. 15, for example, the extension unit 52 adds a new root node with the node number 1 to the upper layer of the node number 2 that is the original root node. Further, the extension unit 52 adds a partial tree of a complete binary tree of one layer to the lower layer of the root node having the node number 1. As a result, the extension unit 52 can newly form two empty leaf nodes in the management tree information so that a new device 30 can be allocated.
Subsequently, the assignment transmitting unit 49 transmits the new node key assigned to the expanded node in the management tree information to the device 30 that has been assigned to the management tree information. In this case, the assignment transmitting unit 49 encrypts the new node key assigned to the expanded node with the node key assigned to the existing node and held only by the device 30 to be transmitted. And send it.
In the example of FIG. 15, the assignment transmitting unit 49 uses the node key K1 assigned to the node with the expanded node number 1 as the node key K2 assigned to the existing node with the node number 2, as shown in the following equation. And multicast transmission to the first device 30-A and the second device 30-B.
C4 = E (K2, K1)
As a result, the existing first device 30-A and second device 30-B allocated to the management tree information before the extension are transferred from the root node to the corresponding leaf node in the management tree information after the extension. Can hold all assigned node keys. In the example of FIG. 15, the first device 30-A has a set (device key) of three node keys K1, K2, and K4, and the second device 30-B has three node keys K1, A set (device key) of K2 and K5 can be held.
In this way, the assignment transmission unit 49 already holds the new node key assigned to the expanded node in the management tree information in the existing device 30 by extending the management tree information to the upper layer of the root node. The encrypted node key can be used for transmission. In particular, in this case, the assignment transmission unit 49 only needs to encrypt a new node key with one node key assigned to the original root node, so that the amount of information to be transmitted can be reduced.
FIG. 16 is a diagram illustrating a second example of management tree information before expansion. For example, as shown in FIG. 16, the management tree information has a one-layer complete binary tree structure, and the first device 30-A is assigned to the leaf node with node number 2, and the leaf node with node number 3 It is assumed that the second device 30-B is assigned to. In the example of FIG. 16, the first device 30-A has a set (device key) of two node keys K1 and K2. The second device 30-B has a set (device key) of two node keys K1 and K3.
In such a case, the allocation unit 48 cannot allocate the new device 30 to the management tree information. Therefore, for example, the extension unit 52 may add a node to a lower layer of the existing leaf node of the management tree information. In this case, the extension unit 52 reassigns the device 30 assigned to the existing leaf node in which the node is added to the lower layer, to the new leaf node. For example, the extension unit 52 may add a node to an intermediate layer between the existing leaf node and the root node of the management tree information.
FIG. 17 is a diagram illustrating an example in which a new node is added to a lower layer of a leaf node in the management tree information of FIG. In the example of FIG. 17, for example, the extension unit 52 adds two new leaf nodes with the node number 4 and the node number 5 to the lower layer of the node number 2 that is the original leaf node. Further, the extension unit 52 adds two new leaf nodes with the node number 6 and the node number 7 to the lower layer of the node number 3.
In the example of FIG. 17, the extension unit 52 reassigns the first device 30 -A assigned to the original leaf node node number 2 to the new leaf node of node number 4. Further, the extension unit 52 reassigns the second device 30 -B assigned to the node number 3 that is the original leaf node, to the new leaf node of the node number 5. As a result, the extension unit 52 can newly form two empty leaf nodes in the management tree information so that a new device 30 can be allocated.
In the example of FIG. 17, the extension unit 52 reassigns the new node keys K2 ′ and K3 ′ to the nodes having the node numbers 2 and 3 that are the original leaf nodes.
Subsequently, the assignment transmission unit 49 encrypts the node key to be newly held with the node key that has been assigned to the existing node and that is held only by the device 30 to be transmitted, and manages it. The information is transmitted to the device 30 assigned to the tree information. In the example of FIG. 17, the assignment transmitting unit 49 encrypts the new node keys K2 ′ and K4 with the node key K2 assigned to the node with the existing node number 2, as shown in the following equation, 1 to the first device 30-A. The node key K2 is held only by the first device 30-A that is the transmission target, and is not held by the second device 30-B. Accordingly, the first device 30-A can hold a set (device key) of three node keys K1, K2 ′, and K4.
C5 = E (K2, K2 ')
C6 = E (K2, K4)
In the example of FIG. 17, the assignment transmission unit 49 encrypts the new node keys K2 ′ and K5 with the node key K3 assigned to the node with the existing node number 3 as shown in the following equation. , To the second device 30-B. The node key K3 is held only by the second device 30-B that is the transmission target, and is not held by the first device 30-A. Accordingly, the second device 30-B can hold a set (device key) of three node keys K1, K2 ′, and K5.
C7 = E (K3, K2 ')
C8 = E (K3, K5)
In this way, the assignment transmission unit 49 already holds the new node key assigned to the expanded node in the management tree information in the existing device 30 by extending the management tree information to the lower layer of the leaf node. The encrypted node key can be used for transmission. The extension unit 52 may set K2 ′ = K2. Thereby, since the allocation transmission part 49 does not need to transmit the node key K2 to the 1st apparatus 30-A, it can further reduce the information content to transmit.
FIG. 18 is a diagram illustrating an example in which a new node is added to the layer between the root node and the leaf node in the management tree information of FIG. For example, the extension unit 52 may add a new node to the layer between the root node and the leaf node of the management tree information.
In the example of FIG. 18, for example, the extension unit 52 newly adds a node with node number 4 to a lower layer of the root node with node number 1. The extension unit 52 connects the leaf node with the node number 2 and the leaf node with the node number 3 to the lower layer of the node with the node number 4. Further, the extension unit 52 adds a partial tree of a complete binary tree of one layer to the lower layer of the root node having the node number 1. As a result, the extension unit 52 can newly form two empty leaf nodes in the management tree information so that a new device 30 can be allocated.
Subsequently, the assignment transmitting unit 49 transmits the node key assigned to the node with the added node number 4 to the first device 30-A and the second device 30-B that have been assigned to the management tree information. . In the example of FIG. 18, the assignment transmission unit 49 assigns a new node key K4 to the node key K2 assigned to the node with the existing node number 2 and the node with the existing node number 3, as shown in the following equation. Are encrypted with the node key K3 assigned to the first device 30-A and the second device 30-B by multicast transmission. Accordingly, the first device 30-A can hold a set (device key) of three node keys K1, K2, and K4. The second device 30-B can hold a set of three node keys K1, K3, and K4.
C9 = E (K2, K4)
C10 = E (K3, K4)
In this way, by adding a new node to the layer between the root node and the leaf node of the management tree information, the assignment transmitting unit 49 uses the existing node key assigned to the added new node. Can be encrypted and transmitted using the node key assigned to the other node. Thereby, according to the allocation transmission part 49, the amount of information to transmit can be decreased.
In addition, as shown in the following equation, the assignment transmission unit 49 encrypts the new node key K4 with the node key K1 assigned to the node with the existing node number 1, and the first device 30-A and the first device You may comprise so that multicast transmission may be carried out to 2 apparatus 30-B. Even in this configuration, the first device 30-A can hold a set (device key) of three node keys K1, K2, and K4. The second device 30-B can hold a set (device key) of three node keys K1, K3, and K4. Furthermore, this allows the allocation transmission unit 49 to transmit only one ciphertext, so that the amount of information to be transmitted can be further reduced.
C11 = E (K1, K4)
FIG. 19 is a diagram illustrating an example in which a new node is added to a lower layer of one leaf node in the management tree information of FIG. For example, the extension unit 52 may add a node to a lower layer of any one existing leaf node in the management tree information. In this case, the extension unit 52 reassigns the device 30 assigned to the existing leaf node in which the node is added to the lower layer, to the new leaf node.
In the example of FIG. 19, for example, the extension unit 52 adds two new leaf nodes with the node number 4 and the node number 5 to the lower layer of the node number 3 that is the original leaf node. In the example of FIG. 19, the extension unit 52 reassigns the second device 30 -B assigned to the original leaf node node number 3 to the new leaf node of node number 4. As a result, the extension unit 52 can newly form one empty leaf node in the management tree information and make it possible to assign a new device 30. In the example of FIG. 19, the extension unit 52 reassigns a new node key K3 ′ to the node with node number 3 that is the original leaf node.
Subsequently, the allocation transmission unit 49 transmits a node key to be newly held to the second device 30-B whose allocation position has been changed. In the example of FIG. 19, the assignment transmitting unit 49 encrypts the new node keys K3 ′ and K4 with the node key K3 assigned to the node with the existing node number 3, as shown in the following equation, To the second device 30-B. Thereby, the second device 30-B can hold a set (device key) of three node keys K1, K3 ′, and K4.
C12 = E (K3, K3 ')
C13 = E (K3, K4)
In this way, the assignment transmitting unit 49 extends the management tree information to a lower layer of one leaf node, thereby transferring the new node key assigned to the expanded node in the management tree information to the existing device 30. It is possible to transmit the data by encrypting it using the node key already possessed. The extension unit 52 may set K3 ′ = K3. Thereby, since the allocation transmission part 49 does not need to transmit the node key K3 to the 2nd apparatus 30-B, it can reduce the information content to transmit.
FIG. 20 is a diagram showing an example in which a new node is added to the layer between the root node and one leaf node in the management tree information of FIG. For example, the extension unit 52 may add a new node to a layer between the root node of the management tree information and one leaf node.
In the example of FIG. 20, the extension unit 52 newly adds a node with a node number 4 between, for example, a root node with a node number 1 and a leaf node with a node number 3. Then, the extension unit 52 adds a new leaf node with the node number 5 to the lower layer of the node with the node number 4. As a result, the extension unit 52 can newly form one empty leaf node in the management tree information and make it possible to assign a new device 30.
Subsequently, the assignment transmitting unit 49 transmits the node key assigned to the node with the added node number 4 to the second device 30-B that has been assigned to the management tree information. In the example of FIG. 20, the assignment transmitting unit 49 encrypts the new node key K4 with the node key K3 assigned to the node with the existing node number 3, as shown in the following equation, and the second device Send to 30-B. Accordingly, the second device 30-B can hold a set (device key) of three node keys K1, K3, and K4 of the device.
C14 = E (K3, K4)
(Reconstruction of management tree information)
Next, a method for reconfiguring management tree information and a method for transmitting a node key after reconfiguration will be described. The reconfiguration unit 53 changes the allocation position of the device 30 to the leaf node in the management tree information so that the devices 30 having high similarity are concentrated in a range of nodes close to each other.
For example, the reconfiguration unit 53 performs reconfiguration when a periodic or predetermined event occurs. For example, the reconstruction unit 53 may reconstruct the management tree information after the expansion unit 52 expands the management tree information. Further, for example, the reconfiguration unit 53, when there is no empty leaf node within n parents or the like from the leaf node of the device 30 having the attribute information having the highest similarity to the new device 30 in the management tree information, Information may be reconstructed. Further, for example, the reconfiguration unit 53 may be a case where an empty leaf node exists within n parents or the like from the leaf node of the device 30 having the attribute information having the highest similarity to the new device 30 in the management tree information. The management tree information may be reconstructed.
Hereinafter, an example in which the management tree information is reconfigured using element information that changes with the passage of time included in the attribute information as a similarity index will be described.
FIG. 21 is a diagram showing management tree information before reconfiguration. In the example of FIG. 21, the management tree information before reconfiguration has a two-level complete binary tree structure, the first device 30 -A is assigned to the leaf node with the node number 4, and the leaf with the node number 5 It is assumed that the second device 30-B is assigned to the node and the third device 30-C is assigned to the leaf node having the node number 6. In the example of FIG. 21, the first device 30-A has a set (device key) of three node keys K1, K2, and K4. The second device 30-B has a set (device key) of three node keys K1, K2, and K5. The third device 30-C holds a set (device key) of three node keys K1, K3, and K6.
The attribute acquisition unit 46 acquires attribute information from each device 30. The average power consumption of the first device 30-A is 1000 [W], the average power consumption of the second device 30-B is 100 [W], and the average power consumption of the third device 30-C is 1200 [W]. Suppose that In this case, the first device 30-A and the third device 30-C have a small difference in average power consumption and a high degree of similarity. Therefore, for example, there is a possibility that a control command instructing suppression of power consumption may be received simultaneously. high.
When causing the first device 30-A and the third device 30-C to execute a control command, the management device 20 first generates and transmits a ciphertext represented by the following equation. Accordingly, the first device 30-A and the third device 30-C can hold the group key GK. Note that the second device 30-B does not have the node keys K4 and K6, and therefore cannot acquire the group key GK.
C15 = E (K4, GK)
C16 = E (K6, GK)
Subsequently, as shown in the following equation, the management device 20 encrypts the control command CMD with the group key GK, and multicasts the control command CMD to the first device 30-A and the third device 30-C.
C17 = E (GK, CMD)
The first device 30-A and the third device 30-C decrypt the received ciphertext with the group key GK and execute the control command CMD. In this way, when the management tree information is configured as shown in FIG. 21, the management device 20 is required to transmit a control command to the first device 30-A and the third device 30-C. Three ciphertexts must be generated.
FIG. 22 is a diagram showing management tree information after reconfiguration. For example, the reconfiguration unit 53 reconfigures the management tree information so that the devices 30 whose average power consumption in the attribute information is a predetermined value or more are arranged in the vicinity. For example, the reconfiguration unit 53 reconfigures the management tree information so that the devices 30 having an average power consumption of 1000 [W] or more are arranged within the second degree. Accordingly, as illustrated in FIG. 22, for example, the reconfiguration unit 53 assigns the first device 30 -A to the leaf node with the node number 4 and assigns the third device 30 -C to the leaf node with the node number 5. The second device 30-B is assigned to the leaf node of node number 6.
Furthermore, the reconfiguration unit 53 changes the node key assigned to each node in accordance with the change in the assignment of the device 30. In this case, the reconfiguration unit 53 may change the node key held by the device 30 whose assignment has been changed, and may not change the node key which is not held by the device 30 whose assignment has been changed. Further, the reconfiguration unit 53 may not change the node key that is commonly held by all the devices 30 whose assignment has been changed. In the example of FIG. 22, the reconfiguration unit 53 changes the node keys of the node with the node number 2, the node with the node number 3, the node with the node number 5, and the node with the node number 6.
Then, the assignment transmission unit 49 transmits the changed node key to the device 30. In the example of FIG. 22, the assignment transmitting unit 49 encrypts the node key K2 ′ with the node key K4 and transmits it to the first device 30-A as shown in the following equation. Accordingly, the first device 30-A can hold a set (device key) of three node keys K1, K2 ′, and K4.
C18 = E (K4, K2 ')
Further, as shown in the following equation, the assignment transmission unit 49 encrypts the node keys K2 ′ and K5 ′ with the node key K6 and transmits the encrypted data to the third device 30-C. Accordingly, the third device 30-C can hold a set (device key) of three node keys K1, K2 ′, and K5 ′.
C19 = E (K6, K2 ')
C20 = E (K6, K5 ')
Further, as shown in the following equation, the assignment transmission unit 49 encrypts the node keys K3 ′ and K6 ′ with the node key K5 and transmits the encrypted data to the second device 30-B. Accordingly, the second device 30-B can hold a set (device key) of three node keys K1, K3 ′, and K6 ′.
C21 = E (K5, K3 ')
C22 = E (K5, K6 ')
Subsequently, when causing the first device 30-A and the third device 30-C to execute a control command, first, the management device 20 generates a ciphertext represented by the following expression, and the first device 30 -Multicast to A and third device 30-C. Accordingly, the first device 30-A and the third device 30-C can hold the group key GK.
C21 = E (K2 ', GK)
C22 = E (GK, CMD)
That is, when the management tree information is reconstructed as shown in FIG. 22, the management apparatus 20 uses two ciphertexts to cause the first device 30-A and the third device 30-C to execute the control command. Just send it. Therefore, the management device 20 can reduce the number of ciphertexts that must be transmitted in order to cause the first device 30-A and the third device 30-C to execute the control command.
Note that the management apparatus 20 does not share the group key GK between the first device 30-A and the third device 30-C, but encrypts the control command CMD with the node key K2 ′ and transmits the multicast command. May be. In this case, the management apparatus 20 can transmit a control command to the first device 30-A and the third device 30-C with one ciphertext.
As described above, the management apparatus 20 reconfigures the management tree information so that the devices 30 that are likely to be multicast transmission of control commands are contained in a small number of subtrees, so that the management device 20 determines the number of ciphertexts to be transmitted. The amount of information during transmission can be reduced.
The reconfiguration unit 53 uses average power consumption as an index of similarity when reconfiguring management tree information. However, the present invention is not limited to this, and element information of attribute information that does not change with time is used as an index of similarity. It is good. The reconstruction unit 53 may use a value obtained by combining a plurality of types of element information as an index of similarity. Furthermore, the reconfiguration unit 53 may use the similarity obtained by combining the weights according to the element information as an index.
As described above, the management device 20 according to the present embodiment reconfigures the management tree information so that the device 30 that is likely to receive the control command by multicast transmission fits in the subtree including a small number of nodes. Thereby, according to the management apparatus 20, the communication amount for sharing the group key or node key used for encryption or authentication can be reduced. Further, the management device 20 can expand the management tree information as the number of devices 30 increases. Therefore, when the number of devices 30 is small, the management device 20 can reduce the management tree information to reduce the memory amount and the like.
FIG. 23 is a diagram illustrating an example of a hardware configuration of the management apparatus 20 according to the embodiment. The management apparatus 20 according to the present embodiment is realized by an information processing apparatus having a hardware configuration as illustrated in FIG. 23, for example. The device 30 is also realized by an information processing device having the same hardware configuration as that of the management device 20.
The information processing apparatus includes a CPU (Central Processing Unit) 201, a RAM (Random Access Memory) 202, a ROM (Read Only Memory) 203, an operation input device 204, a display device 205, a storage device 206, and a communication device. Device 207. These parts are connected by a bus.
The CPU 201 is a processor that executes arithmetic processing and control processing according to a program. The CPU 201 uses the predetermined area of the RAM 202 as a work area and executes various processes in cooperation with programs stored in the ROM 203 and the storage device 206.
The RAM 202 is a memory such as an SDRAM (Synchronous Dynamic Random Access Memory). The RAM 202 functions as a work area for the CPU 201. The ROM 203 is a memory that stores programs and various information in a non-rewritable manner.
The display device 205 is a display device such as an LCD (Liquid Crystal Display). The display device 205 displays various information based on a display signal from the CPU 201.
The storage device 206 is a device that writes data to and reads data from a semiconductor storage medium such as a flash memory or a magnetically or optically recordable storage medium. The storage device 206 writes and reads data to and from the storage medium in accordance with control from the CPU 201. The communication device 207 communicates with an external device via a network according to control from the CPU 201.
The program executed by the management apparatus 20 of the present embodiment includes a device discovery module, a device authentication module, an attribute acquisition module, a similarity calculation module, an allocation module, an allocation transmission module, a group key transmission module, a generation module, an expansion module, The module configuration includes a configuration module, an encryption module, and a first communication module. This program is expanded and executed on the RAM 202 by the CPU 201 (processor), so that the information processing apparatus is a device discovery unit 44, a device authentication unit 45, an attribute acquisition unit 46, a similarity calculation unit 47, and an allocation unit 48. , The allocation transmission unit 49, the group key transmission unit 50, the generation unit 51, the expansion unit 52, the reconstruction unit 53, the encryption unit 54, and the first communication unit 55.
Note that the management device 20 is not limited to such a configuration, but includes a device discovery unit 44, a device authentication unit 45, an attribute acquisition unit 46, a similarity calculation unit 47, an allocation unit 48, an allocation transmission unit 49, and a group key transmission unit 50. The configuration may be such that at least a part of the generation unit 51, the expansion unit 52, the reconfiguration unit 53, the encryption unit 54, and the first communication unit 55 is realized by a hardware circuit (for example, a semiconductor integrated circuit).
The program executed by the device 30 of the present embodiment includes an attribute measurement module, a management device discovery module, a request module, a management device authentication module, an attribute transmission module, an allocation reception module, a group key reception module, a decryption module, and a second The module configuration includes a communication module. This program is expanded and executed on the RAM 202 by the CPU 201 (processor), so that the information processing apparatus is changed to an attribute measurement unit 63, a management device discovery unit 64, a request unit 65, a management device authentication unit 66, and an attribute transmission unit. 67, the allocation receiving unit 68, the group key receiving unit 69, the decrypting unit 70, and the second communication unit 71.
The device 30 is not limited to such a configuration, and the attribute measurement unit 63, the management device discovery unit 64, the request unit 65, the management device authentication unit 66, the attribute transmission unit 67, the assignment reception unit 68, and the group key reception unit 69. Also, a configuration in which at least a part of the decoding unit 70 and the second communication unit 71 is realized by a hardware circuit (for example, a semiconductor integrated circuit) may be employed.
The program executed by the management device 20 of the present embodiment is a file that can be installed in a computer or an executable file, such as a CD-ROM, a flexible disk, a CD-R, a DVD (Digital Versatile Disk), and the like. The program is provided by being recorded on a computer-readable recording medium.
Further, the program executed by the management apparatus 20 of the present embodiment may be stored on a computer connected to a network such as the Internet and provided by being downloaded via the network. Further, the program executed by the management device 20 of the present embodiment may be configured to be provided or distributed via a network such as the Internet. The program executed by the management device 20 may be provided by being incorporated in advance in a ROM or the like.
A management device that can be connected to a plurality of devices via a network,
Receiving first attribute information which is attribute information of the first device;
Transmitting at least one node key assigned to a path from a root node of a tree-structured graph configured by assigning to a second leaf node closest to the first leaf node to the second leaf node;
The first leaf node is a node to which a second device is assigned;
The second device is a device in which second attribute information that is attribute information of the second device matches the first attribute information.
The management apparatus according to claim 1, further transmitting at least one node key assigned to a path from a root node of the tree-structured graph to the first leaf node.
Receiving attribute information of at least one of the plurality of devices;
Send at least one node key assigned to the path from the root node of the tree graph to each leaf node;
The tree-structured graph is obtained by assigning, to the first leaf node, a device that matches the received attribute information among the plurality of devices, and the received attribute among the plurality of devices. A management device in which a device whose information does not match is assigned to the second leaf node.
Receiving identification information of the first device, and assigning to a path from a root node to a leaf node of a tree-structured graph configured based on the identification information of the first device and the identification information of one or more second devices A management device that transmits at least one node key that is received.
Receives attribute information of the first device and assigns it to a path from a root node to a leaf node of a tree-structured graph configured based on the attribute information of the first device and the attribute information of one or more second devices A management device that transmits at least one node key that is received.
A program for causing an information processing apparatus to function as the management apparatus according to any one of claims 1 to 5.
A system comprising the management device according to claim 1 and a plurality of devices connectable via a network.
A method executed in a management apparatus connectable to a plurality of devices via a network,
The management device receives first attribute information that is attribute information of a first device;
At least one node assigned to the path from the root node of the tree-structured graph configured by the management device to the second leaf node closest to the first leaf node to the second leaf node Send the key,
JP2017213108A 2017-11-02 2017-11-02 Management device, program, system, and method Pending JP2018038077A (en)
JP2017213108A JP2018038077A (en) 2017-11-02 2017-11-02 Management device, program, system, and method
JP2017505911 Division 2015-03-16
JP2018038077A true JP2018038077A (en) 2018-03-08
ID=61567827
JP2017213108A Pending JP2018038077A (en) 2017-11-02 2017-11-02 Management device, program, system, and method
JP (1) JP2018038077A (en)
JP2003204321A (en) * 2001-10-26 2003-07-18 Matsushita Electric Ind Co Ltd Literary work protective system and key management system
JP2005198116A (en) * 2004-01-09 2005-07-21 Nippon Telegr & Teleph Corp <Ntt> Method and device for content distribution/reproduction, management device and reproducing device therefor
2017-11-02 JP JP2017213108A patent/JP2018038077A/en active Pending
US20100042834A1 (en) 2010-02-18 Systems and methods for provisioning network devices
KR20110054737A (en) 2011-05-25 Secure channel establishment method and apparatus in short range communication
CN100350775C (en) 2007-11-21 Information distribution system, terminal device, information distribution server, information distribution method, terminal device connection method
CN1574738A (en) 2005-02-02 Method of distributing encryption keys in mobile ad hoc network and network device using the same
JPWO2005015419A1 (en) 2006-10-05 Communication processing apparatus, and a communication control method, and computer program
JP2004048769A (en) 2004-02-12 Cryptographic key distributing method, roaming method, cryptographic key assigning apparatus and computer reproducible recording medium
JP2011130012A (en) 2011-06-30 Actor node, sensor node, method for changing coverage block, parameter change method, program, and information processing system
US8855306B2 (en) 2014-10-07 Node distributed with group key and group key updating
JP2011523513A (en) 2011-08-11 Wireless communication system and method for automatic node and key revocation
CN101022383B (en) 2010-08-18 Method and apparatus for executing an application automatically according to the approach of wireless device
Chuang et al. 2014 A fast blind rendezvous method by alternate hop-and-wait channel hopping in cognitive radio networks
KR20100075480A (en) 2010-07-02 Node for a network and method for establishing a distributed security architecture for a network
JP5986356B2 (en) 2016-09-06 User-centric virtual personalization group (VPC) generation method, operation method of communication device communicating in VPC, computer-recordable recording medium, VPC network, communication device communicating in VPC, and virtual personalization network Equipment