Node identity verification method and apparatus, electronic device, and storage medium

Abstract

The present disclosure provides a node identity authentication method and device, electronic equipment and storage medium, comprising: receiving a verification request of a first node; wherein the verification request comprises node information and link attributes of the first node; sending the verification request to a second node, so that a plurality of child nodes in the second node perform verification processing on the node information and the link attributes, and obtain a verification result; receiving the verification result sent by the second node; and in response to determining that the verification result is a true result, determining that the first node is verified successfully. The present disclosure first receives a verification request of a first node, and sends the verification request to a second node, then performs verification processing on the verification request through child nodes of the second node, and finally obtains a verification result.

Description

Technical Field

[0001] This invention relates to the field of optical transmission network technology, and in particular to a node authentication method, apparatus, electronic device, and storage medium. Background Technology

[0002] An Optical Service Unit (OSU) is a bearer container in an Optical Transport Network (OTN) used to support services at speeds of Mbit / s and above. Its frame length is 192 bytes, and its frame structure includes an overhead area and a payload area. The OSU provides layer network functionality. The OSU layer network is compatible with existing OTN architectures, and the OSU can also be directly mapped and multiplexed to an Optical Path Data Unit k (ODUk).

[0003] In existing technologies, when establishing a physical link (NNAL) between control nodes connected by a link, node authentication methods are typically used. NNAL uses OSU-based technology to enhance the reliability of node authentication by leveraging the physical link attributes of NNAL, such as latency, overhead, clock signal, jitter and drift, and channel coding.

[0004] However, traditional node authentication schemes primarily rely on encryption algorithms, such as hash functions and digital verification centers, which can only improve security by increasing password length. With the rapid development of computer processing power, the security of traditional encryption algorithms is difficult to guarantee. Furthermore, traditional node authentication mostly employs centralized schemes, depending on the security of the verification center. Summary of the Invention

[0005] In view of this, the purpose of this disclosure is to provide a node authentication method, apparatus, electronic device and storage medium.

[0006] As one aspect of this disclosure, a node authentication method is provided, applied to a transmission module in a node authentication system, characterized in that it includes:

[0007] Receive a verification request from the first node; wherein the verification request includes the node information and link attributes of the first node;

[0008] The verification request is sent to the second node, so that multiple child nodes in the second node can verify the node information and the link attributes and obtain the verification result.

[0009] Receive the verification result sent by the second node;

[0010] In response to determining that the verification result is a true result, the first node is determined to have been successfully verified.

[0011] Optionally, before receiving the verification request from the first node, the method further includes:

[0012] Configure a security key for the first node;

[0013] Sending the verification request to the second node includes:

[0014] The security key and the verification request are sent to the second node.

[0015] Optionally, multiple child nodes in the second node perform verification processing on the node information and the link attributes, and obtain verification results, including:

[0016] The second node reads the verification request based on the security key;

[0017] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the second node performs verification processing on the node information and link attributes and obtains the verification result;

[0018] The second node, in response to determining that the read status has failed, determines that the first node's verification has failed.

[0019] Optionally, in response to determining that the read status is successful and that the first node is the guarantor of the second node, verifying the node information and link attributes and obtaining a verification result includes:

[0020] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial node information of the first node and the consistency of the node information are verified.

[0021] In response to determining that the initial node information is consistent with the node information, a verification result is generated that the node information is true;

[0022] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial link attributes of the first node and the consistency of the link attributes are verified.

[0023] In response to determining that the initial link attribute is consistent with the link attribute, a verification result is generated that the link attribute is true.

[0024] Optionally, the response to determining that the verification result is a true result and determining that the first node verification was successful includes:

[0025] In response to determining that the node information is a genuine verification result and the link attribute is a genuine verification result, the first node is determined to have been successfully verified.

[0026] Optionally, configuring a security key for the first node includes:

[0027] Construct secure keys based on public-key cryptography or homomorphic encryption algorithms;

[0028] The first node is securely encrypted using the security key;

[0029] The security key for construction is represented as follows:

[0030] E (X+Y) =E (x) +E (Y)

[0031] Among them, E (X+Y) E represents the security key, E represents the security encryption algorithm, and X and Y represent the original node information and original link attributes of the first node.

[0032] Optionally, after configuring the security key for the first node, the method further includes:

[0033] Generate the message authentication code for the first node based on the security key;

[0034] Send the node information of the first node and the message authentication code to the second node;

[0035] The node information of the first node is encrypted and calculated based on the security key, and the calculation result is obtained;

[0036] In response to determining that the calculation result matches the message authentication code, the first node is set as the guarantor of the second node.

[0037] As a second aspect of this disclosure, this disclosure also provides a node authentication device, applied to a transmission module in a node authentication system, comprising:

[0038] The request information receiving module is configured to receive a verification request from a first node; wherein the verification request includes node information and link attributes of the first node;

[0039] The verification request processing module is configured to send the verification request to the second node, so that multiple child nodes in the second node can perform verification processing on the node information and the link attributes, and obtain the verification result;

[0040] The verification result receiving module is configured to receive the verification result sent by the second node;

[0041] The verification result determination module is configured to: determine that the first node has been successfully verified in response to determining that the verification result is a true result.

[0042] As a third aspect of this disclosure, this disclosure also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the node authentication method provided by this disclosure when executing the program.

[0043] As a fourth aspect of this disclosure, a non-transitory computer-readable storage medium is also provided, the non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the methods described in any of the above-mentioned methods.

[0044] As described above, this disclosure provides a node authentication method, apparatus, electronic device, and storage medium. In this disclosure, an authentication request from a first node is first received and sent to a second node. Then, the authentication request is processed by the child nodes of the second node, and finally, the authentication result is obtained. Attached Figure Description

[0045] To more clearly illustrate the technical solutions in this disclosure or related technologies, the accompanying drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the accompanying drawings described below are only embodiments of this disclosure. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0046] Figure 1A This is a schematic diagram of a node authentication method provided in an embodiment of the present disclosure.

[0047] Figure 1B This is a schematic diagram of a verification process provided in an embodiment of the present disclosure.

[0048] Figure 1C This is a schematic diagram of another verification process provided in an embodiment of this disclosure.

[0049] Figure 2 This is a schematic diagram of a node authentication device provided in an embodiment of the present disclosure.

[0050] Figure 3 This is a schematic diagram of an electronic device structure for a node authentication method provided in an embodiment of this disclosure. Detailed Implementation

[0051] To make the objectives, technical solutions, and advantages of this disclosure clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0052] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this disclosure should have the ordinary meaning understood by one of ordinary skill in the art to which this disclosure pertains. The terms "first," "second," and similar terms used in the embodiments of this disclosure do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed following the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are used only to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0053] In existing technologies, traditional node authentication schemes mainly rely on encryption algorithms, such as hash functions and digital verification centers, which can only improve security by increasing password length. However, with the rapid development of computer processing power, the security of traditional encryption algorithms is difficult to guarantee. Furthermore, traditional node authentication mostly adopts centralized schemes, depending on the security of the verification center. When the verification center experiences high computational and communication loads, it may become a performance bottleneck or a target for attacks due to excessive load, while also being complex to implement and incurring high communication overhead.

[0054] To address the aforementioned problems, this disclosure provides a node authentication method, apparatus, electronic device, and storage medium. In this method, a first node's authentication request is first received and sent to a second node. The second node's child nodes then process the authentication request, ultimately obtaining the authentication result.

[0055] After introducing the basic principles of this disclosure, various non-limiting embodiments of this disclosure will be described in detail below.

[0056] Figure 1A This is a schematic diagram of a node authentication method provided in an embodiment of the present disclosure.

[0057] Figure 1A The node authentication method shown further includes the following steps:

[0058] Step S10: Receive a verification request from the first node; wherein the verification request includes the node information and link attributes of the first node.

[0059] In some optional embodiments, the process of verifying the identity of nodes on the physical link in this disclosure can be implemented by a transmission module in a node verification system. Specifically, the physical link may also contain several link nodes, and the method described in this disclosure can occur during the verification process among these nodes on the physical link.

[0060] In some optional embodiments, when the first node (i.e., the verification node) needs to perform verification, the first node can first send a verification request to the second node (the verification node, generally a neighboring node of the first node). Then, after receiving the verification request from the first node, the second node can perform verification processing. The aforementioned verification request information may include the node information of the first node and the link attributes of the link in which the first node is located.

[0061] In some optional embodiments, step S10 further includes:

[0062] S101: Configure a security key for the first node.

[0063] In some optional embodiments, the process further includes the following after performing step S10:

[0064] S1011: Generate the message authentication code for the first node based on the security key.

[0065] S1012: Send the node information of the first node and the message authentication code to the second node.

[0066] S1013: Based on the security key, perform encrypted calculations on the node information of the first node and obtain the calculation result.

[0067] S1014: In response to determining that the calculation result matches the message authentication code, the first node is set as the guarantor.

[0068] In some optional embodiments, after configuring a security key for the first node, a message authentication code can be generated based on the configured security key. Then, the first node's node information and the message authentication code can be sent together to the second node. After receiving the first node's node information and message authentication code, the transmission module can perform encrypted calculations on the first node's node information using the aforementioned security key and obtain the calculation result. Then, the calculation result is authenticated using the received message authentication code. If the calculation result matches the message authentication code, it indicates that the first node's node information has not been tampered with, and the second node can then designate the first node as the guarantor.

[0069] S102: Send the security key and the verification request to the second node.

[0070] In some optional embodiments, before the first node (i.e., the node to be verified) sends the verification request to the second node, it may first construct a security key, and then send the security key and the verification request to the second node. Specifically, the initial verification request sent may be the initial node information of the first node and its initial link attributes.

[0071] In some optional embodiments, when configuring a security key for the first node, a security key can first be constructed using a public-key cryptography algorithm or a homomorphic encryption algorithm, and then the constructed security key can be configured on the first node. It is understood that the security key can also be implemented using other key algorithms; this embodiment only uses the two methods described above as examples.

[0072] In some alternative embodiments, the construction of the security key can be represented as:

[0073] E (X+Y) =E (x) +E (Y)

[0074] Among them, E (X+Y) E represents the security key, E represents the security encryption algorithm, and X and Y represent the original node information and original link attributes of the first node.

[0075] Step S20: Send the verification request to the second node so that multiple child nodes in the second node can verify the node information and the link attributes and obtain the verification result.

[0076] Figure 1B This is a schematic diagram of a verification process provided in an embodiment of the present disclosure.

[0077] In some alternative embodiments, please combine Figure 1A and Figure 1B For reference, when the second node receives the request information sent by the first node, it can perform verification processing on the first node and obtain the verification result.

[0078] In some optional embodiments, step S20 further includes:

[0079] S201: The second node reads the node information and link attributes based on the security key.

[0080] S202: In response to determining that the read status is successful and that the first node is the guarantor of the second node, the second node performs verification processing on the node information and link attributes and obtains the verification result.

[0081] In some optional embodiments, step S202 further includes:

[0082] S2021: In response to determining that the read status is successful and that the first node is the guarantor of the second node, the consistency of the initial node information and the node information is verified.

[0083] S2022: In response to determining that the initial node information of the first node is consistent with the node information, a verification result is generated that the node information is true.

[0084] S2033: In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial link attributes of the first node and the consistency of the link attributes are verified.

[0085] S2024: In response to determining that the initial link attribute is consistent with the link attribute, a verification result is generated that the link attribute is true.

[0086] In some optional embodiments, when the second node receives the verification request sent by the first node, the first node will first read the verification information of the first node based on the security key information obtained in advance from the second node. Because the second node has already broadcast its security key information to its neighboring nodes (including the first node) in the initial stage, the first node can determine the status of the second node through the pre-received key information.

[0087] In some optional embodiments, if the second node successfully verifies the security key information of the first node, it indicates that the first node's verification request was successfully sent, and it also indicates that the first node's information has not been tampered with. Subsequently, the second node can also determine whether the first node is a guarantor for itself; if the first node is a guarantor for the second node, then the second node can undergo verification processing.

[0088] In some optional embodiments, the second node used to verify the first node can have multiple child nodes, and these child nodes can be nodes adjacent to the first node. This design allows for faster sending of verification requests from the first node to the second node, and consequently, faster verification of the first node by the second node. Furthermore, since the second node includes multiple child nodes, its verification of the first node can be more accurate by having each of its child nodes complete the verification process for the first node.

[0089] In some optional embodiments, after the second node verifies the security key information, the second node can also perform consistency verification on the node information sent by the first node during verification based on the initial node information pre-sent by the first node.

[0090] In some optional embodiments, if the content of the initial node information is found to be the same as (consistent with) the content of the node information sent by the first node, it can be determined that the consistency verification of the first node is successful, and the node information of the first node can be generated as the true verification result.

[0091] In some optional embodiments, after the second node verifies the node information of the first node and obtains a true verification result for the node information, it can also perform consistency verification on the link attributes sent by the first node when requesting verification, based on the initial link attributes pre-sent by the first node, and generate a verification result.

[0092] In some optional embodiments, if the content of the initial link attribute is found to be the same as (consistent with) the content of the link attribute sent by the first node, it can be determined that the consistency verification of the first node is successful, and the link attribute of the first node can be generated as the true verification result.

[0093] S203: The second node, in response to determining that the read status is a failure, determines that the first node's verification has failed.

[0094] In some optional embodiments, if in step S201, the second node fails to read the node information of the first node based on the security key information pre-sent by the first node, it indicates that the node information of the first node may have been tampered with, which also suggests that the first node may be an insecure node. Therefore, the second node can directly determine that the first node's verification has failed without needing to verify other information sent by the first node.

[0095] Step S30: Receive the verification result sent by the second node.

[0096] Step S40: In response to determining that the verification result is a true result, determine that the first node verification is successful.

[0097] In some optional embodiments, step S40 further includes:

[0098] S401: In response to determining that the node information is a genuine verification result and the link attribute is a genuine verification result, determine that the first node verification is successful.

[0099] In some optional embodiments, if the second node generates a verification result that the node information is real and the link attribute is real, it can indicate that the information content of the first node has been successfully verified, and at this time, feedback information that the first node has been successfully verified can be generated.

[0100] It is understood that in the embodiments of this disclosure, it is assumed that the first node and the second node (including its multiple child nodes) are adjacent nodes, which can make both information transmission and verification processes faster. However, this does not mean that the node verification method provided in this disclosure is limited to only two adjacent nodes. In fact, the node verification method provided in this disclosure can implement the above verification process in any link composed of multiple nodes.

[0101] Figure 1C This is a schematic diagram of another verification process provided in an embodiment of this disclosure.

[0102] In some alternative embodiments, this disclosure also provides another process for verifying the first node. Please refer to... Figure 1A and 1C For reference, node S serves as the verification node (second node), node A as the node to be authenticated (first node), and nodes B and C as auxiliary verification nodes (other nodes adjacent to the first node). When node S needs to verify node A, the verification process can also be completed in the following way.

[0103] In some alternative embodiments, the entire network of links can be initialized first. Specifically, the NMS can first distribute an ID and a corresponding key to each node. This key is shared by the node and the NMS and is used to generate message authentication codes. Then, each node can broadcast its key to its neighboring nodes. It is important to understand that this process needs to be completed in a very short time to ensure key security.

[0104] In some optional embodiments, after each node obtains the keys of all its neighbors, the first node can send node information and a message authentication code to all its neighbors. For example, node A sends node information and the key-encrypted node information, i.e., the message authentication code, to its neighbor node B.

[0105] In some optional embodiments, neighboring node B can perform encrypted calculations on the node information sent by node A based on the stored key of node A, and compare the calculated result with the received message authentication code.

[0106] In some optional embodiments, if neighboring node B's assessment of node A is successful, node B can send its own node message to node A and add node A to the "guarantee" list. At this time, after receiving node B's node information, node A adds node B to the "guarantor" list. If neighboring node B's assessment of node A is unsuccessful, node B may not return any message information.

[0107] In some alternative embodiments, please continue to refer to Figure 1C As shown, it can also be specifically described as: NMS issuing IDs to node i. i and the corresponding key K i After obtaining the key, each node broadcasts its key information to its neighboring nodes within a very short time. Physical link attribute information is shared between the two connected nodes. Here, we take the authentication between node A and node B as an example. Node A maintains node information M. A = <ID A ,PL A >, where PL A This refers to the physical link attributes maintained by node A that are connected to it. Assuming the message authentication algorithm used is H, node A will send the identity verification request information... Send to node B, where, This represents a physical link attribute k of the link connecting node A and node B. The "|" symbol indicates the messages before and after the connection. Upon receiving the request, neighboring node B verifies the request information using its stored key. If verification is successful, it returns node B's node information ID. B It adds node A to the "guarantee" list of its own nodes; if the verification fails, it does not return any message.

[0108] In some optional embodiments, after all link network initialization processes are completed, the initialized link network can be used to implement the node information verification process. Specifically, an authentication node can first send an authentication request to the node to be authenticated. For example, when node S needs to authenticate node A, node S can send an authentication request to node A. Node A replies with node information and node information of all guarantors. Node S can then send authentication requests and the physical link parameters required for authentication to node A's guarantor nodes respectively.

[0109] In some optional embodiments, after receiving the authentication request and required physical link parameters from node A, the guarantor node checks if node A exists in its list of guarantors. If so, it sends the required physical link attribute parameters to node A. Node A can then return the physical link attributes required for its authentication. The guarantor node then checks whether the returned physical link attributes match its stored / calculated attributes and verifies whether a response was received within the expected timeframe. If successful, it returns a successful authentication message to node S. If authentication fails, it returns an authentication failure message to node S.

[0110] In some optional embodiments, node S checks whether the number of returned messages has reached the threshold required for successful authentication. If it has, it indicates that node A's authentication has succeeded. If it has not reached the required threshold, it indicates that node A's authentication has failed.

[0111] In some alternative embodiments, please continue to refer to Figure 1C As shown, it can also be specifically described as follows: When node S needs to authenticate node A, node S sends an authentication request to node A, and node A replies with its own information and neighbor node information M. A _send_auth = ID A ID B ID C Node S sends authentication requests to both Node B and Node C. Taking Node B as an example, Node S sends an authentication request to Node B. Here we assume This represents the jitter attribute of the link connecting node A and node B. Both node A and node B can identify the jitter characteristics of a signal and can perform certain transformations on the signal. After receiving the signal, node B first checks if node A is in its "guarantor" list. If not, it returns a "failed" message to node S; if so, it sends a signal with specific jitter characteristics. The signal is sent to node A. After receiving it, node A converts the signal into... Return the authentication request for node B. Node B performs calculations based on its stored key and the pre-converted signal. If the calculation result matches the received result, and Node B receives a response from Node A within the expected waiting time, Node B returns a "success" message to Node S; otherwise, it returns a "failed" message to Node S. Node S selects different physical link attributes for authentication for different neighboring nodes of Node A. By using different physical link attributes for authentication in different directions of Node A, the reliability of authentication is enhanced.

[0112] After node S receives messages from all nodes, node S counts the number of successes received. If the number of successes received / the total number of nodes verified is greater than 1 / 2, then node A's verification is successful; otherwise, the verification fails.

[0113] In summary, this disclosure first receives a verification request from the first node and sends it to the second node. Then, the child nodes of the second node process the verification request and finally obtain the verification result.

[0114] Based on the same technical concept, corresponding to the methods of any of the above embodiments, this disclosure also provides a node authentication device applied to the transmission module of a node authentication system. The node authentication device provided by this disclosure can implement the node authentication method described in any of the above embodiments.

[0115] Figure 2 This is a schematic diagram of a node authentication device provided in an embodiment of the present disclosure.

[0116] Figure 2The node authentication device shown further includes the following modules:

[0117] The module includes a request information receiving module 10, a verification request processing module 20, a verification result receiving module 30, and a verification result determination module 40.

[0118] The request information receiving module 10 is configured to receive a verification request from a first node; wherein the verification request includes node information and link attributes of the first node. The specific steps are as follows:

[0119] Configure a security key for the first node; this then includes:

[0120] Generate the message authentication code for the first node based on the security key;

[0121] The node information of the first node and the message authentication code are sent to the second node; the node information of the first node is encrypted and calculated based on the security key, and the calculation result is obtained;

[0122] In response to determining that the calculation result matches the message authentication code, the first node is set as the guarantor;

[0123] Construct secure keys based on public-key cryptography or homomorphic encryption algorithms;

[0124] The first node is securely encrypted using the security key;

[0125] The security key for construction is represented as follows:

[0126] E (X+Y) =E (x) +E (Y)

[0127] Among them, E (X+Y) E represents the security key, E represents the security encryption algorithm, and X and Y represent the original node information and original link attributes of the first node.

[0128] The security key and the verification request are sent to the second node.

[0129] The verification request processing module 20 is configured to send the verification request to a second node, so that multiple child nodes in the second node can verify the node information and the link attributes, and obtain the verification result. Specifically, the following steps are performed:

[0130] The second node reads the verification request based on the security key;

[0131] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the second node performs verification processing on the node information and link attributes and obtains the verification result;

[0132] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the consistency of the initial node information and the node information is verified, including:

[0133] In response to determining that the initial node information is consistent with the node information, a verification result is generated that the node information is true;

[0134] In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial link attributes and the consistency of the link attributes are verified.

[0135] In response to determining that the initial link attribute is consistent with the link attribute, a verification result is generated that the link attribute is true;

[0136] In response to determining that the read status has failed, the first node verification has failed.

[0137] The verification result receiving module 30 is configured to receive the verification result sent by the second node.

[0138] The verification result determination module 40 is configured to: in response to determining that the verification result is a true result, determine that the first node has been successfully verified.

[0139] In response to determining that the node information is a genuine verification result and the link attribute is a genuine verification result, the first node is determined to have been successfully verified.

[0140] Based on the same technical concept, corresponding to the methods of any of the above embodiments, this disclosure also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the node authentication method described in any of the above embodiments.

[0141] Figure 3 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0142] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0143] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0144] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0145] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0146] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0147] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0148] The electronic devices described above are used to implement the corresponding node authentication methods in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0149] Based on the same technical concept, corresponding to the methods of any of the above embodiments, this disclosure also provides a non-transitory computer-readable storage medium that stores computer instructions for causing the computer to execute the node authentication method as described in any of the above embodiments.

[0150] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0151] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the node authentication method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0152] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this disclosure (including the claims) is limited to these examples; within the framework of this disclosure, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this disclosure as described above, which are not provided in detail for the sake of brevity.

[0153] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this disclosure, the well-known power / ground connections to the integrated circuit (IC) chip and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this disclosure, and this also takes into account the fact that the details of implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this disclosure will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this disclosure, it will be apparent to those skilled in the art that the embodiments of this disclosure may be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0154] Although this disclosure has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0155] This disclosure is intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A node authentication method, applied to the transmission module of a node authentication system, characterized in that, include: Receive a verification request from the first node; wherein the verification request includes the node information and link attributes of the first node; The verification request is sent to the second node, so that multiple child nodes in the second node can verify the node information and the link attributes and obtain the verification result. Receive the verification result sent by the second node; In response to determining that the verification result is a true result, the first node is determined to have been successfully verified; In this process, a physical link is established between the first node and the second node, and the plurality of child nodes are the neighbor nodes of the first node. Different neighbor nodes select different link attributes for verification. Before receiving the verification request from the first node, the process further includes: Configure a security key for the first node; Sending the verification request to the second node includes: Send the security key and the verification request to the second node; In this process, multiple child nodes in the second node verify the node information and the link attributes, and obtain verification results, including: The second node reads the verification request based on the security key; In response to determining that the read status is successful and that the first node is the guarantor of the second node, the second node performs verification processing on the node information and link attributes and obtains the verification result; The second node, in response to determining that the read status has failed, determines that the first node's verification has failed; The step of responding to determining that the read status is successful and that the first node is the guarantor of the second node, performing verification processing on the node information and link attributes and obtaining a verification result includes: In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial node information of the first node and the consistency of the node information are verified. In response to determining that the initial node information of the first node is consistent with the node information, a verification result is generated that the node information is true; In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial link attributes of the first node and the consistency of the link attributes are verified. In response to determining that the initial link attribute is consistent with the link attribute, a verification result is generated that the link attribute is true.

2. The authentication method according to claim 1, characterized in that, The response to determining that the verification result is a true result and determining that the first node verification was successful includes: In response to determining that the node information is a genuine verification result and the link attribute is a genuine verification result, the first node is determined to have been successfully verified.

3. The authentication method according to claim 1, characterized in that, Configuring a security key for the first node includes: Construct secure keys based on public-key cryptography or homomorphic encryption algorithms; The first node is securely encrypted using the security key; The security key for construction is represented as follows: , in, Represented as a security key, Indicated as a secure encryption algorithm, and This represents the original node information and original link attributes of the first node.

4. The node authentication method according to claim 1, characterized in that, After configuring the security key for the first node, the process also includes: Generate the message authentication code for the first node based on the security key; The node information of the first node and the message authentication code are sent to the second node; the node information of the first node is encrypted and calculated based on the security key, and the calculation result is obtained; In response to determining that the calculation result matches the message authentication code, the first node is set as the guarantor of the second node.

5. A node authentication device, applied to a transmission module in a node authentication system, characterized in that, include: The request information receiving module is configured to: receive a verification request from a first node; wherein the verification request includes node information and link attributes of the first node; wherein, before receiving the verification request from the first node, the module further includes: Configure a security key for the first node; Sending the verification request to the second node includes: Send the security key and the verification request to the second node; A physical link is established between the first node and the second node; The verification request processing module is configured to send the verification request to a second node, so that multiple child nodes in the second node can perform verification processing on the node information and the link attribute, and obtain a verification result; wherein, the multiple child nodes are neighbor nodes of the first node, and different neighbor nodes select different link attributes for verification. In this process, multiple child nodes in the second node verify the node information and the link attributes, and obtain verification results, including: The second node reads the verification request based on the security key; In response to determining that the read status is successful and that the first node is the guarantor of the second node, the second node performs verification processing on the node information and link attributes and obtains the verification result; The second node, in response to determining that the read status has failed, determines that the first node's verification has failed; The step of responding to determining that the read status is successful and that the first node is the guarantor of the second node, performing verification processing on the node information and link attributes and obtaining a verification result includes: In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial node information of the first node and the consistency of the node information are verified. In response to determining that the initial node information of the first node is consistent with the node information, a verification result is generated that the node information is true; In response to determining that the read status is successful and that the first node is the guarantor of the second node, the initial link attributes of the first node and the consistency of the link attributes are verified. In response to determining that the initial link attribute is consistent with the link attribute, a verification result is generated that the link attribute is true; The verification result receiving module is configured to receive the verification result sent by the second node; The verification result determination module is configured to: determine that the first node has been successfully verified in response to determining that the verification result is a true result.

6. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 4.

7. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 4.

Images