An access control system, method, device, and medium
By introducing a multi-level permission management system and utilizing public-private key pairs and path rules, dynamic permission management between nodes is achieved, solving the problem that multi-level nodes cannot dynamically derive or authorize in existing technologies, and expanding the scope of permission management.
Patent Information
- Application Number
- CN202210101913.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-01-27
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2042-01-27
AI Technical Summary
In existing technologies, permission management between nodes cannot achieve multi-level dynamic derivation or authorization, resulting in limited management permissions for each node, which cannot meet the user's permission management needs.
By introducing a permission management system consisting of a first node, a second node, and a third node, and utilizing public-private key pairs and path rules, multi-level permission management is achieved. The first node receives the identity information from the second node, generates verification information, and performs multi-level verification using the verification information from the second and third nodes.
It expands the scope of permission management, realizes multi-level user permission management, allows each node to derive infinitely downwards, and can be dynamically managed and controlled through path rules.
Smart Images

Figure CN116561721B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of Internet technology, and in particular to a permission management system, method, device, computer-readable storage medium, and computer program product. Background Technology
[0002] Typically, access control refers to the ability of a higher-level node to manage lower-level nodes, including the creation, control, and deregistration of lower-level nodes.
[0003] However, typically, authorization or delegation is based on the first node, and the child nodes of the first node are at the same level, making it impossible to dynamically derive or authorize multi-level nodes. Therefore, the management of each node requires processing by the first node, and the child nodes of the first node have limited permissions, which does not meet users' needs for permission management. Summary of the Invention
[0004] This application provides a permission management system and permission management method. The system can manage permissions at multiple levels separately, thereby ensuring the credibility of the data.
[0005] Firstly, this application provides a permission management system, which includes:
[0006] The first node is used to receive the first identity information sent by the second node, generate the first verification information based on the identity information, and return the first verification information to the second node;
[0007] The second node is configured to send the first identity information to the first node and receive the first verification information; receive the second identity information sent by the third node, generate second verification information based on the second identity information and the first verification information, and return the second verification information to the third node;
[0008] The third node is used to send the second identity information to the second node and receive the second verification information;
[0009] The second node is also used to verify the third node based on the second verification information;
[0010] The first node is also configured to verify the second node based on the first verification information, and to verify the third node based on the second verification information.
[0011] In some possible implementations, the first node can be used for:
[0012] A first path and a second public-private key pair are generated based on the public-private key pair of the first node and the first identity information.
[0013] In some possible implementations, the second node can be used for:
[0014] A second path and a third public-private key pair are generated based on the second public-private key pair, the second identity information, and the first path.
[0015] In some possible implementations, the first node can be used for:
[0016] Obtain the first signature sent by the second node, wherein the first signature is generated by the second node based on the information to be signed and the second private key, and the second public-private key pair includes the second private key and the second public key;
[0017] The second public key is recovered based on the first signature and the information to be signed;
[0018] The first prediction information is determined based on the second private key and the first path.
[0019] The first verification result is obtained by comparing the second public key with the first prediction information.
[0020] In some possible implementations, the first node can be used for:
[0021] Obtain the second signature sent by the third node, wherein the second signature is generated by the third node based on the information to be signed and the third private key, and the third public-private key pair includes the third private key and the third public key;
[0022] The third public key is recovered based on the second signature and the information to be signed;
[0023] The second prediction information is determined based on the first public key, the first path, and the second path, wherein the first public-private key pair includes the first private key and the first public key;
[0024] The second verification result is obtained by comparing the third public key with the second prediction information.
[0025] In some possible implementations, the first node can be used for:
[0026] The second public key is recovered using a deterministic signature algorithm based on the first signature and the information to be signed.
[0027] In some possible implementations, the first node includes a first rule, and the first path satisfies the first rule.
[0028] In some possible implementations, the second node includes a second rule, and the second path satisfies both the first rule and the second rule.
[0029] Secondly, this application provides a permission management method, which includes:
[0030] The first node receives the first identity information sent by the second node;
[0031] The first node generates first verification information based on the first identity information and returns the first verification information to the second node;
[0032] The first node verifies the second node based on the first verification information;
[0033] The second node receives the second identity information sent by the third node;
[0034] The second node generates second verification information based on the second identity information and the first verification information, and returns the second verification information to the third node;
[0035] The second node verifies the third node based on the second verification information, and the first node verifies the third node based on the second verification information.
[0036] In some possible implementations, the first node generates first verification information based on the first identity information, including:
[0037] The first node generates a first path and a second public-private key pair based on the public-private key pair of the first node and the first identity information.
[0038] In some possible implementations, the second node generates second verification information based on the second identity information and the first verification information, including:
[0039] The second node generates a second path and a third public-private key pair based on the second public-private key pair, the second identity information, and the first path.
[0040] In some possible implementations, the first node verifies the second node based on the first verification information, including:
[0041] The first node obtains the first signature sent by the second node. The first signature is generated by the second node based on the information to be signed and the second private key. The second public-private key pair includes the second private key and the second public key.
[0042] The first node recovers the second public key based on the first signature and the information to be signed;
[0043] The first node determines the first prediction information based on the second private key and the first path.
[0044] The first node compares the second public key with the first prediction information to obtain the first verification result.
[0045] In some possible implementations, the first node verifies the third node based on the second verification information, including:
[0046] The first node obtains the second signature sent by the third node. The second signature is generated by the third node based on the information to be signed and the third private key. The third public-private key pair includes the third private key and the third public key.
[0047] The first node recovers the third public key based on the second signature and the information to be signed;
[0048] The first node determines the second prediction information based on the first public key, the first path, and the second path, wherein the first public-private key pair includes the first private key and the first public key;
[0049] The first node compares the third public key with the second prediction information to obtain the second verification result.
[0050] In some possible implementations, the first node recovers the second public key based on the first signature and the information to be signed, including:
[0051] The first node uses a deterministic signature algorithm to recover the second public key based on the first signature and the information to be signed.
[0052] In some possible implementations, the first node includes a first rule, and the first path satisfies the first rule.
[0053] In some possible implementations, the second node includes a second rule, and the second path satisfies both the first rule and the second rule.
[0054] Thirdly, this application provides an apparatus comprising a processor and a memory. The processor and the memory communicate with each other. The processor is configured to execute instructions stored in the memory to cause the apparatus to perform the access control method as described in the second aspect or any implementation thereof.
[0055] Fourthly, this application provides a computer-readable storage medium storing instructions that instruct a device to perform the access control method described in the second aspect or any implementation thereof.
[0056] Fifthly, this application provides a computer program product containing instructions that, when run on a device, causes the device to execute the permission management method described in the second aspect or any implementation thereof.
[0057] Based on the implementation methods provided in the above aspects, this application can be further combined to provide more implementation methods.
[0058] As can be seen from the above technical solutions, the embodiments of this application have the following advantages:
[0059] This application provides an access control system, which includes a first node, a second node, and a third node. The first node receives first identity information sent by the second node, generates first verification information based on the first identity information, and returns the first verification information to the second node, thereby verifying the second node based on the first verification information. The second node receives second identity information sent by the third node, generates second verification information based on the second identity information and the first verification information, and returns the second verification information to the third node, thereby verifying the third node based on the second verification information. Furthermore, the first node can verify the third node based on the second verification information.
[0060] Since the verification information of the third node can be generated by the second node and verified by the first and second nodes respectively, the scope of permission management is expanded, realizing multi-level user permission management. Attached Figure Description
[0061] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0062] Figure 1 This is a schematic diagram of a permission management system;
[0063] Figure 2 A schematic diagram of a permission management system provided in an embodiment of this application;
[0064] Figure 3 A flowchart illustrating a permission management method provided in an embodiment of this application;
[0065] Figure 4 A flowchart illustrating a key derivation method provided in an embodiment of this application;
[0066] Figure 5 A flowchart illustrating a node verification method provided in an embodiment of this application;
[0067] Figure 6 This is a schematic diagram of a node in a permission management system provided in an embodiment of this application;
[0068] Figure 7 This is a schematic diagram of path management provided in an embodiment of this application. Detailed Implementation
[0069] The solutions in the embodiments provided in this application will now be described with reference to the accompanying drawings.
[0070] The terms "first," "second," etc., used in the specification, claims, and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate; this is merely a way of distinguishing objects with the same attributes in the embodiments of this application.
[0071] To facilitate understanding of the technical solution of this application, some technical terms involved in this application will be introduced below.
[0072] Access control refers to a node's management of the creation, control, and deregistration of its child nodes. A node can authorize and verify permissions for its child nodes. Typically, the permissions of multiple child nodes of a node are at the same level, such as... Figure 1 As shown. Furthermore, a node's lower-level child nodes cannot derive their corresponding child nodes, and nodes at the same level typically have the same permissions, such as... Figure 1 As shown.
[0073] As users increasingly demand access control, they need a method for managing access control where nodes at different levels can further derive their corresponding child nodes, and different nodes at the same level can correspond to different permissions.
[0074] In view of this, this application provides a permission management system, which includes a first node, a second node, and a third node. The nodes can be hardware devices, such as hardware devices with a Universal Serial Bus interface (USB), i.e., USB keys.
[0075] Specifically, the first node receives first identity information sent by the second node, generates first verification information based on the first identity information, returns the first verification information to the second node, and then verifies the second node based on the first verification information. The second node receives second identity information sent by the third node, generates second verification information based on the second identity information and the first verification information, and returns the second verification information to the third node. The second node can verify the third node based on the second verification information, and the first node can also verify the third node based on the second verification information.
[0076] like Figure 2As shown, the first node can be node A, the second node can be node B-1, and the third node can be node C-1 or node C-2. Furthermore, the second node can also be node B-2, and the third node can be node C-3. As illustrated, nodes B-1 and B-2 are derived from node A (i.e., nodes B-1 and B-2 are child nodes of node A), nodes C-1 and C-2 are derived from node B-1 (nodes C-1 and C-2 are child nodes of node B-1), and node C-3 is derived from node B-2 (node C-3 is a child node of node B-2). Node B-1 can validate nodes C-1 and C-2, but cannot validate node C-3. Node B-2 can validate node C-3, but cannot validate nodes C-1 and C-2. Node A can verify nodes B-1 and B-2, as well as nodes C-1, C-2, and C-3.
[0077] The following section uses nodes A, B-1, and C-1 as examples to introduce the permission management method of this application. This method can be implemented using blockchain technology. Figure 3 As shown, the method includes the following steps:
[0078] S302: The first node receives the first identity information sent by the second node.
[0079] The first identity information refers to a unique identifier that can represent the identity of the second node, such as the device identifier (ID) of the second node.
[0080] S304: The first node generates the first verification information based on the first identity information and returns the first verification information to the second node.
[0081] Specifically, the first node generates first verification information based on the first identity information representing the second node's identity and the first public-private key pair. The first public-private key pair is the public-private key pair corresponding to the first node. The first verification information is the verification information derived from the first node to the second node.
[0082] For example, such as Figure 4 As shown, the first node (node A) generates its public-private key pair (p, P), i.e., the first public-private key pair, where p is the (first) private key and P is the (first) public key (case sensitive). Node A obtains the device ID provided by node B-1, and then generates the first path A1 and the second public-private key pair (p1, P1) based on the identity information of node B-1 and the public-private key pair (p, P1) of node A. Then, the first path A1 and the second public-private key pair (p1, P1) are sent to the second node.
[0083] S306: The first node verifies the second node based on the first verification information.
[0084] Through steps S302 and S304 above, the first node and the second node complete the key derivation from the parent node to the child node. The first node and the second node can then verify the second node based on the aforementioned first verification information.
[0085] Specifically, such as Figure 5 As shown, node B-1 obtains the information m to be signed, and then signs the information m using its private key p1, generating a signature s1. Node B-1 sends the signature s1 and the first path A1 to node A. Node A, based on the information m to be signed and the signature s1, recovers node B's public key P1 using a deterministic signature algorithm. Then, node A uses the first public-private key pair (p, P) and the first path A1 to calculate the first predicted information (i.e., the predicted public key P1'). Finally, it determines whether the verification was successful based on the recovered public key P1 and the predicted public key P1'. When P1 and P1' are the same, the verification is considered successful.
[0086] A signature algorithm refers to the algorithm used for digital signatures. A digital signature is an alphanumeric string obtained by processing the information to be transmitted using a one-way function, used to authenticate the source of the information and verify whether the information has changed during transmission. Digital signatures typically employ public-key cryptography techniques, such as hash signatures, DSA signatures, and RSA signatures. In this embodiment, the deterministic signature algorithm can recover the node's public key based on the information and signature.
[0087] In this way, the parent node can verify the child node through the derived key and path.
[0088] Furthermore, the second node can also derive keys from its child nodes and authenticate the child nodes of the second node.
[0089] S308: The second node receives the second identity information sent by the third node.
[0090] The second identity information refers to a unique identifier that can represent the identity of the third node, such as the device identifier (ID) of the third node.
[0091] S310: The second node generates second verification information based on the second identity information and the first verification information, and returns the second verification information to the third node.
[0092] Specifically, the second node generates second verification information based on the second identity information representing the third node's identity and the second public-private key pair. The second public-private key pair is the public-private key pair corresponding to the second node. The second verification information is the verification information derived by the second node from the third node.
[0093] For example, the second node (node B-1) obtains the device ID provided by node C-1, and then generates a second path A2 and a third public-private key pair (p11, P11) based on the identity information of node C-1 and the public-private key pair (p11, P11) of node B. Then, it sends the first path A1, the second path A2, and the third public-private key pair (p11, P11) to the third node.
[0094] S312: The second node verifies the third node based on the second verification information.
[0095] Through steps S308 and S310 above, the second node and the third node complete the key derivation from the parent node to the child node. The second node can then verify the third node based on the aforementioned second verification information.
[0096] Specifically, node C-1 obtains the information m to be signed, and then signs the information m using its private key p11, generating a signature s11. Node C-1 sends the signature s11 and the second path A2 to node B. Node B-1, based on the information m to be signed and the signature s11, recovers node C-1's public key P11 using a deterministic signature algorithm. Then, node B-1 uses the second public-private key pair (p1, P1) and the second path A2 to calculate the second predicted information (i.e., the predicted public key P11'). Finally, it determines whether the verification was successful based on the recovered public key P11 and the predicted public key P11'. When P11 and P11' are the same, the verification is considered successful.
[0097] S314: The first node verifies the third node based on the second verification information.
[0098] Since the first node is the parent node of the second node, and the second node is the parent node of the third node, the first node can also verify the third node based on the second verification information mentioned above.
[0099] Specifically, node C-1 obtains the information m to be signed, and then signs the information m using its private key p11, generating a signature s11. Node C-1 sends the signature s11, the first path A1, and the second path A2 to node A. Node A, based on the information m to be signed and the signature s11, recovers node C's public key P11 using a deterministic signature algorithm. Then, node A uses the first public-private key pair (p, P), the first path A1, and the second path A2 to calculate the second predicted information (i.e., the predicted public key P11"). Finally, node A determines whether the verification was successful based on the recovered public key P11 and the predicted public key P11" . When P11 and P11" are the same, the verification is considered successful.
[0100] Based on the above description, such as Figure 6 As shown, each node can derive from itself as its parent node through the steps described above. Derived nodes can be authenticated by any parent node on the same path, although the path parameters differ during authentication. Furthermore, since a parent node requires its private key when deriving a child node, authentication is not possible between different paths (e.g., ...).
[0101] like Figure 6 As shown, node A's first public-private key pair is (p, P). Node A derives node B-1 through path A1, node B-2 through path B1, and node B-3 through path C1. The public-private key pair for node B-1 is (p1, P1), for node B-2 it is (p2, P2), and for node B-3 it is (p3, P3). Node B-1 derives node C-1 through path A1-A1, and for node C-2 through path A1-A2. Node B-2 derives node C-3 through path B1-B1, and for node C-4 through path B1-B2. The public-private key pair for node C-1 is (p11, P11), and for node C-2 it is (p12, P12). The public-private key pair for node C-3 is (p21, P21), and the public-private key pair for node C-4 is (p22, P22).
[0102] If node A is defined as a first-level node, nodes B-1, B-2, B-3... to Bn are defined as second-level nodes, and nodes C-1, C-2, C-3, C-4... to Cn are defined as third-level nodes. The second-level nodes are derived from the first-level nodes, and the third-level nodes are derived from the second-level nodes. Third-level nodes can further derive fourth-level nodes, and fourth-level nodes can further derive, which is not limited in this application. Then, the path of a third-level node includes the path information of the second-level nodes that derived it, as well as the public / private key pair information. Therefore, a third-level node can be verified by its parent node on the same path. For example, nodes A, B-1, and C-1 are on the same path, and nodes A, B-2, and C-3 are on the same path. Node C-1 can be verified by node B-1, but cannot be verified by node B-2. Node C-3 can be verified by node B-2, but cannot be verified by node B-1.
[0103] Based on the permission management method of this application, each node can derive an unlimited number of sub-nodes, and the sub-nodes can restrict or revoke the derived nodes through path rules. For example, ... Figure 7As shown, node A can be assigned a path parameter rule (rule, R) R1, and all paths derived from node A must satisfy this rule. Similarly, node A's child node B-1 can be assigned a smaller path parameter rule R2, and the second path must satisfy both R2 and R1. Furthermore, the rule corresponding to the (N-1)th child node can be RN-1, and the path corresponding to the (N-1)th child node must simultaneously satisfy R1, R2, ..., RN-1. For example, if R1 stipulates that the node can only be derived once, then nodes C-1 and C-2 derived from node B-1 will both fail authentication. In this way, the first-level nodes can achieve dynamic management and hierarchical permission management of child and grandchild nodes.
[0104] In summary, this application provides a permission management method that enables a first node to verify a second node derived from that node, the second node to verify a third node derived from that node, and the first node to verify its grandchild nodes, i.e., the third nodes. Since the verification information for the third node can be generated by the second node and verified by both the first and second nodes, the scope of permission management is expanded, enabling multi-level user permission management.
[0105] In this application method, every node can become a parent node and derive child nodes. Furthermore, each parent node has dynamic and flexible permission management capabilities and can control child nodes and other descendant nodes through path rules.
[0106] The above combination Figures 1 to 7 The permission management method provided in the embodiments of this application is described in detail.
[0107] This application also provides an apparatus for implementing a permission management method. The apparatus includes a processor and a memory. The processor and the memory communicate with each other. The processor executes instructions stored in the memory to cause the apparatus to perform the permission management method.
[0108] This application provides a computer-readable storage medium storing instructions that, when executed on a device, cause the device to perform the aforementioned permission management method.
[0109] This application provides a computer program product containing instructions that, when run on a device, causes the device to execute the aforementioned permission management method.
[0110] It should also be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. In addition, in the device embodiment drawings provided in this application, the connection relationship between modules indicates that they have a communication connection, which can be implemented as one or more communication buses or signal lines.
[0111] Through the above description of the embodiments, those skilled in the art can clearly understand that this application can be implemented by means of software plus necessary general-purpose hardware, or it can be implemented by special-purpose hardware including application-specific integrated circuits, special-purpose CPUs, special-purpose memory, special-purpose components, etc. Generally, any function performed by a computer program can be easily implemented by corresponding hardware, and the specific hardware structure used to implement the same function can also be diverse, such as analog circuits, digital circuits, or special-purpose circuits. However, for this application, software program implementation is more often the preferred implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium, such as a computer floppy disk, USB flash drive, mobile hard disk, ROM, RAM, magnetic disk, or optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, training equipment, or network device, etc.) to execute the methods described in the various embodiments of this application.
[0112] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented in software, it can be implemented, in whole or in part, as a computer program product.
[0113] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, training device, or data center to another website, computer, training device, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can store or a data storage device such as a training device or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media (e.g., solid-state drives (SSDs)).
Claims
1. A permission management system, characterized in that, The system includes: The first node is used to receive the first identity information sent by the second node, generate the first verification information based on the first identity information, and return the first verification information to the second node; The second node is configured to send the first identity information to the first node and receive the first verification information; receive the second identity information sent by the third node, generate second verification information based on the second identity information and the first verification information, and return the second verification information to the third node; The third node is used to send the second identity information to the second node and receive the second verification information; The second node is also used to verify the third node based on the second verification information; The first node is further configured to verify the second node based on the first verification information, and to verify the third node based on the second verification information; The first node is specifically used to generate a first path and a second public-private key pair based on the public-private key pair of the first node and the first identity information; The second node is specifically used to generate a second path and a third public-private key pair based on the second public-private key pair, the second identity information, and the first path; The second node is also used to send the first path, the second path, and the third public-private key pair to the third node; The first node includes a first rule, and the first path satisfies the first rule; the second node includes a second rule, and the second path satisfies both the first rule and the second rule.
2. A method for managing access permissions, characterized in that, The method includes: The first node receives the first identity information sent by the second node; The first node generates first verification information based on the first identity information and returns the first verification information to the second node; The first node verifies the second node based on the first verification information; The second node receives the second identity information sent by the third node; The second node generates second verification information based on the second identity information and the first verification information, and returns the second verification information to the third node; The second node verifies the third node based on the second verification information, and the first node verifies the third node based on the second verification information; The first node generates first verification information based on the first identity information, including: The first node generates a first path and a second public-private key pair based on the public-private key pair of the first node and the first identity information; The second node generates second verification information based on the second identity information and the first verification information, including: The second node generates a second path and a third public-private key pair based on the second public-private key pair, the second identity information, and the first path; The second node sends the first path, the second path, and the third public-private key pair to the third node; The first node includes a first rule, and the first path satisfies the first rule. The second node includes a second rule, and the second path satisfies both the first rule and the second rule.
3. The method according to claim 2, characterized in that, The first node verifies the second node based on the first verification information, including: The first node obtains the first signature sent by the second node. The first signature is generated by the second node based on the information to be signed and the second private key. The second public-private key pair includes the second private key and the second public key. The first node recovers the second public key based on the first signature and the information to be signed; The first node determines the first prediction information based on the second private key and the first path; The first node compares the second public key with the first prediction information to obtain the first verification result.
4. The method according to claim 2, characterized in that, The first node verifies the third node based on the second verification information, including: The first node obtains the second signature sent by the third node. The second signature is generated by the third node based on the information to be signed and the third private key. The third public-private key pair includes the third private key and the third public key. The first node recovers the third public key based on the second signature and the information to be signed; The first node determines the second prediction information based on the first public key, the first path, and the second path. The public-private key pair of the first node includes the first private key and the first public key. The first node compares the third public key with the second prediction information to obtain the second verification result.
5. The method according to claim 3, characterized in that, The first node recovers the second public key based on the first signature and the information to be signed, including: The first node uses a deterministic signature algorithm to recover the second public key based on the first signature and the information to be signed.
6. An electronic device, characterized in that, The electronic device includes one or more processors and a memory; wherein... The memory is used to store one or more programs; The one or more processors are used to run the one or more programs so that the electronic device performs the permission management method according to any one of claims 2-5.
Citation Information
Patent Citations
Identity label based hierarchical public key trust model building method
CN107733649A
