Computing resource characteristics verification method, system, device, medium and program

Abstract

The present disclosure relates to a method, system, device, medium and program for verifying computing resource characteristics. The method comprises: performing node characteristic clustering on a node resource information set to obtain a resource characteristic class set, and initializing a tree structure of the node resource information set according to the resource characteristic class set to obtain a node resource tree; performing resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree; performing commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree; obtaining node resource information to be verified, and filtering out a target standard commitment proof corresponding to the node resource information from the complete commitment proof tree according to the node resource tree; performing commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result, thereby improving the efficiency of resource proof.

Description

Technical Field

[0001] The present disclosure relates to the technical field of computing resource verification, and in particular to a computing resource feature verification method, system, device, medium and program. Background Art

[0002] With the popularization of technologies such as artificial intelligence, the market demand for computing resources is growing exponentially. Under this circumstance, computing resource allocation technology is gaining increasing attention. In order to protect the privacy of computing resources, the computing resources of a computing node cluster are often hidden when allocating computing resources. Therefore, it is necessary to verify the computing resources of each computing node in the computing node cluster.

[0003] Traditional computing resource verification technology is a verification method based on overall data verification, that is, obtaining the overall resource data of the computing node cluster that needs to be verified and verifying the overall resource data. In practical applications, the verification method based on overall data verification is difficult to organize and manage computing resource data, the data granularity is uncontrollable, and the integrity and consistency of the overall data structure cannot be guaranteed, which may lead to low efficiency in computing resource verification. Summary of the invention

[0004] The present invention discloses a method, system, device, medium and program for verifying computing resource characteristics, which determines the hierarchical structure in the node resource information set by feature clustering, ensures the integrity of the node resource information set during verification in the form of a node resource tree, and improves the security of verification and the efficiency of resource verification by zero-knowledge verification and hash commitment nesting.

[0005] In a first aspect, the present disclosure provides a method for verifying computing resource characteristics, comprising: performing node characteristic clustering on a pre-acquired node resource information set to obtain a resource characteristic class set, and initializing a tree structure of the node resource information set according to the resource characteristic class set to obtain a node resource tree; performing resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree; performing commitment nesting operations on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree; obtaining the node resource information to be verified, and filtering out a target standard commitment proof corresponding to the node resource information from the complete commitment proof tree according to the node resource tree; performing commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result.

[0006] In some embodiments, the tree structure of the node resource information set is initialized according to the resource feature class set to obtain a node resource tree, including: performing resource fusion on the node resource information set to obtain overall resource information, and generating a resource root node based on the overall resource information; selecting resource feature classes in the resource feature class set one by one as target resource feature classes, and aggregating node resource information corresponding to the target resource feature classes in the node resource information set into a target resource information group; performing resource fusion on the target resource information group to obtain target cluster resource information, and generating resource internal nodes based on the target cluster resource information; selecting node resource information in the target resource information group one by one as target resource information, and generating resource leaf nodes based on the target resource information; hierarchically connecting all resource leaf nodes, all resource internal nodes and the resource root node to obtain a node resource tree.

[0007] In some embodiments, performing resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree includes: selecting nodes in the node resource tree one by one as target resource nodes, and extracting target resource information from the target resource nodes; initializing a commitment random number, and generating a primary resource commitment based on the commitment random number and the target resource information; performing range proof on the target resource information based on the primary resource commitment to obtain a resource proof; generating a primary commitment proof based on the primary resource commitment and the resource proof; extracting a tree structure from the node resource tree, and hierarchically connecting all primary commitment proofs based on the tree structure to obtain an initial commitment proof tree.

[0008] In some embodiments, the node feature clustering of the pre-acquired node resource information set to obtain the resource feature class set includes: performing node information matching on the pre-acquired node resource information set to obtain a computing node information set; extracting a resource location feature set, a resource organization feature set, and a resource type feature set from the computing node information set; fusing the resource location feature set, the resource organization feature set, and the resource type feature set into a resource feature set; and performing node feature clustering on the resource feature set to obtain a resource feature class set.

[0009] In some embodiments, the initial commitment proof tree is subjected to a commitment nesting operation in a bottom-up hierarchical order to obtain a complete commitment proof tree, including: selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as target primary commitment proofs, and determining whether the target primary commitment proof has child nodes; if not, returning to the step of selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as target primary commitment proofs; if so, taking the child nodes of the target primary commitment node as target child nodes, and taking the primary resource commitment of the target child node as target primary child node commitment; performing binary conversion and hash operation on the target primary child node commitment to obtain a target hash child node commitment; performing commitment update on the primary resource commitment of the target primary commitment proof according to the target hash child node commitment to obtain a standard commitment proof, until the target primary commitment proof is the root node of the initial commitment proof tree, and the initial commitment proof tree is taken as a complete commitment proof tree.

[0010] In some embodiments, the commitment to update the primary resource commitment of the target primary commitment proof according to the target hash subnode commitment to obtain a standard commitment proof includes: performing a point addition operation on the target hash subnode commitment and the primary resource commitment of the target primary commitment proof to obtain a standard resource commitment, and using the standard resource commitment to update the primary resource commitment of the target primary commitment proof to obtain a standard commitment proof.

[0011] In some embodiments, the method of filtering out the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree based on the node resource tree includes: extracting the node name from the node resource information; using the tree node corresponding to the node name in the node resource tree as the target tree node, and extracting the target node position from the target tree node; using the standard commitment certificate corresponding to the target node position in the complete commitment certificate tree as the target standard commitment certificate.

[0012] In some embodiments, the target standard commitment certificate is subjected to commitment restoration and commitment certificate verification to obtain a verification result, including: determining whether the target standard commitment certificate has a child node; if not, performing commitment verification and scope verification on the target standard commitment certificate to obtain a verification result; if so, taking the standard resource commitment of the child node as the target child node commitment, performing binary conversion and hash operation on the target child node commitment to obtain a hash child node commitment; performing a commitment restoration operation on the target standard commitment certificate according to the hash child node commitment to obtain a target restored commitment certificate; performing commitment verification and scope verification on the target restored commitment certificate to obtain a verification result.

[0013] In some embodiments, the performing commitment verification and scope verification on the target standard commitment certificate to obtain a verification result includes:

[0014] Extracting standard resource commitment and resource proof from the target standard commitment proof;

[0015] Performing commitment verification on the standard resource commitment to obtain a commitment verification result, and performing scope verification on the resource proof to obtain a scope verification result;

[0016] A verification result is generated according to the commitment verification result and the scope verification result.

[0017] In a second aspect, the present disclosure provides a computing resource feature verification system, comprising: a tree initialization module, used to perform node feature clustering on a pre-acquired node resource information set to obtain a resource feature class set, and initialize the tree structure of the node resource information set according to the resource feature class set to obtain a node resource tree; a commitment proof module, used to perform resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree; a commitment nesting module, used to perform commitment nesting operations on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree; a node screening module, used to obtain the node resource information to be verified, and filter out the target standard commitment proof corresponding to the node resource information from the complete commitment proof tree according to the node resource tree; a commitment verification module, used to perform commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result.

[0018] In a third aspect, the present disclosure provides a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of a method for verifying computing resource characteristics described in the above aspect.

[0019] In a fourth aspect, the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of a method for verifying computing resource characteristics described in the above aspects.

[0020] In a fifth aspect, the present disclosure provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of a method for verifying computing resource characteristics described in the above aspects.

[0021] The present invention provides a computing resource feature verification method, system, device, medium and program. By clustering node features, a clearer structure between computing node clusters can be obtained, thereby facilitating the organization and unified management of computing resource data. By initializing the tree structure, an overall view of resource data can be provided to ensure the integrity and consistency of the overall data structure.

[0022] By performing resource commitment and range proof, an initial commitment proof tree is obtained, which can provide the resource range corresponding to each node resource without revealing the detailed data of each node resource, thereby improving the privacy of resource allocation. By performing commitment nesting operations on the initial commitment proof tree in a bottom-up hierarchical order, it can ensure that the commitment of each node in the complete commitment proof tree is associated with the commitment of the child node, thereby ensuring the integrity and consistency of the overall data structure.

[0023] By screening out the target standard commitment proof corresponding to the node resource information, resource verification for specific sub-nodes can be achieved, improving the accuracy and efficiency of resource verification. By performing commitment restoration and commitment proof verification, structural resource information verification can be achieved, so that the commitments and proofs between layers are closely linked, ensuring the integrity and consistency of the overall structure and improving verification efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The present disclosure will be described in more detail below based on embodiments and with reference to the accompanying drawings:

[0025] Figure 1 A flowchart of a method for verifying computing resource characteristics according to a first embodiment of the present disclosure is shown.

[0026] Figure 2 A schematic diagram of the process of generating a node resource tree in the first embodiment of the present disclosure is shown.

[0027] Figure 3 A schematic diagram of the process of generating an initial commitment proof tree in the first embodiment of the present disclosure is shown.

[0028] Figure 4 A flowchart of a method for verifying computing resource characteristics according to a second embodiment of the present disclosure is shown.

[0029] Figure 5 A functional module diagram of a computing resource feature verification system according to a third embodiment of the present disclosure is shown.

[0030] In the drawings, the same reference numerals are used for the same components and the drawings are not drawn to scale. DETAILED DESCRIPTION

[0031] In order to enable those skilled in the art to better understand the technical solution of the present disclosure, and to fully understand and implement how the present disclosure applies technical means to solve technical problems and achieve the corresponding technical effects, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only embodiments of a part of the present disclosure, not all of the embodiments. The embodiments of the present disclosure and the various features in the embodiments can be combined with each other without conflict, and the technical solutions formed are all within the scope of protection of the present disclosure. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative work should fall within the scope of protection of the present disclosure.

[0032] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

[0033] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0034] Embodiment 1

[0035] Figure 1 The following is a flow chart of a method for verifying the characteristics of computing resources provided by an embodiment of the present disclosure. Figure 1 As shown, a method for verifying characteristics of computing resources includes:

[0036] S1. Clustering node features of a pre-acquired node resource information set to obtain a resource feature set, and initializing a tree structure of the node resource information set according to the resource feature set to obtain a node resource tree.

[0037] In detail, each node resource information in the node resource information set refers to the resource information of each computing node, and the node resource information includes information such as the number of CPUs, storage capacity, memory, and bandwidth.

[0038] In an embodiment of the present invention, the node feature clustering of the pre-acquired node resource information set to obtain the resource feature class set includes: performing node information matching on the pre-acquired node resource information set to obtain a computing node information set; extracting a resource location feature set, a resource organization feature set and a resource type feature set from the computing node information set; fusing the resource location feature set, the resource organization feature set and the resource type feature set into a resource feature set; and performing node feature clustering on the resource feature set to obtain a resource feature class set.

[0039] In detail, the node information matching refers to matching the computing node information corresponding to each node resource information in the node resource information set, and the computing node information includes the hardware resource information, load information, physical location information, operating system information, usage scenario and other information of the computer node.

[0040] Specifically, the resource location feature set refers to the physical location, geographical distribution or rack distribution and other features of each computing node information in the computing node information set; the resource organization feature set refers to the organization or cluster and other features of each computing node information in the computing node information set; the resource type feature set refers to the operating system type, software stack, dependency environment, usage scenario or task type and other features of each computing node information in the computing node information set.

[0041] In detail, the resource location feature set, resource organization feature set and resource type feature set can be extracted using keyword matching methods and word vectorization methods. The resource location feature set, resource organization feature set and resource type feature set can be fused into a resource feature set using methods such as a fully connected layer or principal component analysis. Node feature clustering can be performed using a KNN clustering algorithm or a density clustering algorithm.

[0042] Specifically, refer to Figure 2 As shown, the tree structure of the node resource information set is initialized according to the resource feature set to obtain a node resource tree, including:

[0043] S21, performing resource fusion on the node resource information set to obtain overall resource information, and generating a resource root node according to the overall resource information;

[0044] S22, selecting resource feature classes in the resource feature class set one by one as target resource feature classes, and collecting node resource information corresponding to the target resource feature classes in the node resource information set into a target resource information group;

[0045] S23, performing resource fusion on the target resource information group to obtain target cluster resource information, and generating a resource internal node according to the target cluster resource information;

[0046] S24, selecting node resource information in the target resource information group one by one as target resource information, and generating a resource leaf node according to the target resource information;

[0047] S25. Hierarchically connect all resource leaf nodes, all resource internal nodes and the resource root node to obtain a node resource tree.

[0048] In detail, the content of each node in the node resource tree is the node resource information. The resource fusion refers to merging corresponding types of resource data in multiple node resource information. For example, if node resource information A (CPU number 500, storage capacity 2000, memory 1200) and node resource information B (CPU number 600, storage capacity 1000, memory 2000) are fused, the fused overall resource information or target cluster resource information C is (CPU number 1100, storage capacity 3000, memory 3200).

[0049] Specifically, the hierarchical connection refers to connecting the resource leaf nodes and the corresponding resource internal nodes, and connecting the resource internal nodes and the corresponding resource root nodes in a bottom-up order.

[0050] In an embodiment of the present invention, by clustering node features, a clearer structure between computing node clusters can be obtained, thereby facilitating the organization and unified management of computing resource data. By initializing the tree structure, an overall view of the resource data can be provided to ensure the integrity and consistency of the overall data structure.

[0051] S2. Perform resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree.

[0052] In detail, each node in the initial commitment proof tree corresponds to the primary resource commitment and resource range proof of each node in the node resource tree.

[0053] In the embodiment of the present invention, referring to Figure 3 As shown, the resource commitment and range proof are performed on each node in the node resource tree to obtain an initial commitment proof tree, including:

[0054] S31, selecting nodes in the node resource tree one by one as target resource nodes, and extracting target resource information from the target resource nodes;

[0055] S32, initializing a commitment random number, and generating a primary resource commitment according to the commitment random number and the target resource information;

[0056] S33, performing scope certification on the target resource information according to the primary resource commitment to obtain resource certification;

[0057] S34, generating a primary commitment certificate according to the primary resource commitment and the resource certificate;

[0058] S35. Extract a tree structure from the node resource tree, hierarchically connect all primary commitment certificates according to the tree structure, and obtain an initial commitment certificate tree.

[0059] Specifically, the commitment random number can be generated using a random number algorithm, the primary resource commitment can be generated using an elliptic curve algorithm and a Pedersen commitment algorithm, the range proof can be performed using a Bulletproofs range proof algorithm, and the tree structure refers to the connection relationship and hierarchical structure of each node in the node resource number.

[0060] In detail, generating a primary resource commitment based on the commitment random number and the target resource information refers to extracting two curve elements from a preset elliptic curve, multiplying one of the curve elements by the commitment random number and the target resource information respectively, and taking the sum of the products as the primary resource commitment.

[0061] In an embodiment of the present invention, by performing resource commitment and range proof, an initial commitment proof tree is obtained, which can provide the resource range corresponding to each node resource without revealing the detailed data of each node resource, thereby improving the privacy of resource allocation.

[0062] S3. Perform commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree.

[0063] In an embodiment of the present invention, the initial commitment proof tree is subjected to a commitment nesting operation in a bottom-up hierarchical order to obtain a complete commitment proof tree, including: selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as target primary commitment proofs, and determining whether the target primary commitment proof has child nodes; if not, returning to the step of selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as target primary commitment proofs; if so, taking the child nodes of the target primary commitment node as target child nodes, and taking the primary resource commitment of the target child node as target primary child node commitment; performing binary conversion and hash operation on the target primary child node commitment to obtain a target hash child node commitment; performing commitment update on the primary resource commitment of the target primary commitment proof according to the target hash child node commitment to obtain a standard commitment proof, until the target primary commitment proof is the root node of the initial commitment proof tree, and the initial commitment proof tree is taken as a complete commitment proof tree.

[0064] In detail, the sha256 algorithm may be used for hash operation, and the bottom-up hierarchical order refers to starting from the leaf nodes of the tree structure and selecting intermediate nodes layer by layer until the root node.

[0065] Specifically, the primary resource commitment of the target primary commitment proof is updated according to the target hash subnode commitment to obtain a standard commitment proof, including: performing point addition operation on the target hash subnode commitment and the primary resource commitment of the target primary commitment proof to obtain a standard resource commitment, and updating the primary resource commitment of the target primary commitment proof using the standard resource commitment to obtain a standard commitment proof, wherein the point addition operation refers to a point addition operation on an elliptic curve.

[0066] In an embodiment of the present invention, by performing a commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order, it is possible to ensure that the commitment of each node in the complete commitment proof tree is associated with the commitment of the child node, thereby ensuring the integrity and consistency of the overall data structure.

[0067] S4. Obtain the node resource information to be verified, and filter out the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree according to the node resource tree.

[0068] In detail, the node resource information to be verified refers to one of the node resource information in the node resource information set that needs to be verified.

[0069] Specifically, the method of filtering out the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree according to the node resource tree includes: extracting the node name from the node resource information; taking the tree node corresponding to the node name in the node resource tree as the target tree node, and extracting the target node position from the target tree node; taking the standard commitment certificate corresponding to the target node position in the complete commitment certificate tree as the target standard commitment certificate.

[0070] In the embodiment of the present invention, by screening out the target standard commitment certificate corresponding to the node resource information, resource verification for a specific sub-node can be achieved, thereby improving the accuracy and efficiency of resource verification.

[0071] S5. Perform commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result.

[0072] In detail, the verification results include verification success and verification failure, wherein the verification success means that the target standard commitment certificate can meet the corresponding standard resource commitment and resource proof, and the verification failure means that the target standard commitment certificate cannot meet the corresponding standard resource commitment and resource proof.

[0073] In an embodiment of the present invention, the target standard commitment proof is subjected to commitment restoration and commitment proof verification to obtain a verification result, including: determining whether the target standard commitment proof has a child node; if not, performing commitment verification and range verification on the target standard commitment proof to obtain a verification result; if so, taking the standard resource commitment of the child node as the target child node commitment, performing binary conversion and hash operation on the target child node commitment to obtain a hash child node commitment; performing a commitment restoration operation on the target standard commitment proof according to the hash child node commitment to obtain a target restored commitment proof; performing commitment verification and range verification on the target restored commitment proof to obtain a verification result.

[0074] In detail, the target standard commitment certificate is subjected to commitment verification and scope verification to obtain a verification result, including: extracting a standard resource commitment and a resource certificate from the target standard commitment certificate; performing commitment verification on the standard resource commitment to obtain a commitment verification result, and performing scope verification on the resource certificate to obtain a scope verification result; and generating a verification result based on the commitment verification result and the scope verification result.

[0075] Specifically, the Bulletproofs algorithm with zero proof of knowledge can be used to perform commitment verification and range verification. The commitment verification refers to verifying whether the standard resource commitment value is true. If so, the commitment verification result is a successful verification; if not, the commitment verification result is a failed verification. The range verification refers to verifying whether the resource information corresponding to the resource proof is within the corresponding resource range. If so, the range verification result is a successful verification; if not, the range verification result is a failed verification.

[0076] In detail, generating the verification result according to the commitment verification result and the range verification result refers to performing a logical AND operation on the commitment verification result and the range verification result, and taking the result as the verification result, that is, the verification result is a successful verification only when both the range verification result and the commitment verification result are successfully verified.

[0077] Specifically, performing a commitment restoration operation on the target standard commitment certificate based on the hash sub-node commitment refers to removing the hash sub-node commitment from the standard resource commitment of the target standard commitment certificate to obtain a target restored commitment certificate, and the method of performing commitment verification and scope verification on the target restored commitment certificate is consistent with the method of performing commitment verification and scope verification on the target standard commitment certificate to obtain verification results described in the above steps, which will not be repeated here.

[0078] In the embodiment of the present invention, by performing commitment restoration and commitment proof verification, structural resource information verification can be achieved, so that the commitments and proofs between layers are closely linked, ensuring the integrity and consistency of the overall structure and improving verification efficiency.

[0079] Embodiment 2

[0080] On the basis of the above embodiments, in order to more clearly understand the present disclosure, refer to Figure 4 As shown, the following further explains the situation in which the first embodiment of the present disclosure needs to perform global verification on the node resource information set through a second embodiment.

[0081] S41, clustering node features of a pre-acquired node resource information set to obtain a resource feature class set, and initializing a tree structure of the node resource information set according to the resource feature class set to obtain a node resource tree.

[0082] S42, performing resource commitment and range certification on each node in the node resource tree to obtain an initial commitment certification tree.

[0083] S43. Perform commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree.

[0084] S44. Filter out the root node standard commitment certificate from the complete commitment certificate tree.

[0085] In detail, the root node standard commitment certificate refers to the standard commitment certificate corresponding to the root node of the standard commitment certificate. By verifying the root node standard commitment certificate, the verification of the entire resource can be achieved.

[0086] Specifically, the filtering out the root node standard commitment proof from the complete commitment proof tree includes: filtering out the root node from the complete commitment proof tree, and using the root node's standard commitment proof as the root node standard commitment proof.

[0087] In the embodiment of the present invention, by verifying the root node standard commitment certificate, the verification of the entire resource can be achieved, thereby improving the accuracy and efficiency of resource verification.

[0088] S45. Perform commitment restoration and commitment proof verification on the root node standard commitment proof according to the complete commitment proof tree to obtain a verification result.

[0089] In detail, the verification results include verification success and verification failure, wherein the verification success means that each node resource information in the node resource information set can meet the corresponding standard resource commitment and resource proof, and the verification failure means that at least one node resource information in the node resource information set cannot meet the corresponding standard resource commitment and resource proof.

[0090] In an embodiment of the present invention, the commitment restoration and commitment proof verification are performed on the root node standard commitment proof according to the complete commitment proof tree to obtain a verification result, including: filtering out the child nodes of the root node from the complete commitment proof tree; taking the standard resource commitment of the child node as the target child node commitment, performing binary conversion and hash operation on the target child node commitment to obtain a hash child node commitment; performing a commitment restoration operation on the root node standard commitment proof according to the hash child node commitment to obtain a target restored commitment proof; performing commitment verification and range verification on the target restored commitment proof to obtain a verification result.

[0091] In detail, the performing commitment verification and scope verification on the standard commitment certificate of the root node to obtain a verification result includes: extracting a standard resource commitment and a resource certificate from the standard commitment certificate of the root node; performing commitment verification on the standard resource commitment to obtain a commitment verification result, and performing scope verification on the resource certificate to obtain a scope verification result;

[0092] A verification result is generated according to the commitment verification result and the scope verification result.

[0093] Specifically, the Bulletproofs algorithm with zero proof of knowledge can be used to perform commitment verification and range verification. The commitment verification refers to verifying whether the standard resource commitment value is true. If so, the commitment verification result is a successful verification; if not, the commitment verification result is a failed verification. The range verification refers to verifying whether the resource information corresponding to the resource proof is within the corresponding resource range. If so, the range verification result is a successful verification; if not, the range verification result is a failed verification.

[0094] In detail, generating the verification result according to the commitment verification result and the range verification result refers to performing a logical AND operation on the commitment verification result and the range verification result, and taking the result as the verification result, that is, the verification result is a successful verification only when both the range verification result and the commitment verification result are successfully verified.

[0095] Specifically, the commitment restoration operation on the root node standard commitment certificate based on the hash child node commitment refers to subtracting the hash child node commitment from the standard resource commitment of the root node standard commitment certificate to obtain a target restoration commitment certificate. The method of performing commitment verification and scope verification on the target restoration commitment certificate is consistent with the method of performing commitment verification and scope verification on the root node standard commitment certificate described in the above steps to obtain verification results, which will not be repeated here.

[0096] In the embodiment of the present invention, by performing commitment restoration and commitment proof verification, structural verification of overall resource information can be achieved, so that the commitments and proofs between layers are closely linked, ensuring the integrity and consistency of the overall structure and improving verification efficiency.

[0097] Embodiment 3

[0098] Based on the above embodiments, Figure 5 This is a functional module diagram of a computing resource feature verification system provided by an embodiment of the present disclosure. Figure 5 As shown, a computing resource feature verification system includes:

[0099] The computing resource feature verification system 500 described in this embodiment can be installed in an electronic device. According to the functions implemented, the computing resource feature verification system 500 may include a tree initialization module 501, a commitment certification module 502, a commitment nesting module 503, a node screening module 504 and a commitment verification module 505. The module described in the present disclosure may also be referred to as a unit, which refers to a series of computer program segments that can be executed by an electronic device processor and can complete fixed functions, which are stored in the memory of the electronic device.

[0100] In this embodiment, the functions of each module / unit are as follows:

[0101] The tree initialization module 501 is used to perform node feature clustering on the pre-acquired node resource information set to obtain a resource feature class set, and initialize the tree structure of the node resource information set according to the resource feature class set to obtain a node resource tree;

[0102] The commitment proof module 502 is used to perform resource commitment and scope proof on each node in the node resource tree to obtain an initial commitment proof tree;

[0103] The commitment nesting module 503 is used to perform a commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree;

[0104] The node screening module 504 is used to obtain the node resource information to be verified, and screen the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree according to the node resource tree;

[0105] The commitment verification module 505 is used to perform commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result.

[0106] In detail, each module described in the computing resource feature verification system 500 described in the embodiment of the present disclosure adopts the same technical means as the computing resource feature verification method described in Example 1 when used, and can produce the same technical effects, which will not be repeated here.

[0107] Embodiment 4

[0108] On the basis of the above embodiments, this embodiment provides a computer device, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of the method described in the above embodiments.

[0109] In some implementations of this embodiment, a computer-readable storage medium is provided, on which a computer program is stored, characterized in that when the computer program is executed by a processor, the steps of the method described in the above embodiment are implemented.

[0110] In some implementations of this embodiment, a computer program product is provided, including a computer program, characterized in that when the computer program is executed by a processor, the steps of the method described in the above embodiment are implemented.

[0111] The processor may include, but is not limited to, one or more processors or microprocessors, etc. Each processor may be an application specific integrated circuit (ASIC), a digital signal processor (DSP), a digital signal processing device (DSPD), a programmable logic device (PLD), a field programmable gate array (FPGA), a controller, a microcontroller, a microprocessor or other electronic components to execute the methods in the above embodiments.

[0112] The computer-readable storage medium may be implemented by any type of volatile or non-volatile storage device or a combination thereof, and the computer-readable storage medium may include but is not limited to, for example, random access memory (RAM), read-only memory (ROM), flash memory, EPROM memory, EEPROM memory, registers, computer storage media (e.g., hard disk, floppy disk, solid-state drive, removable disk, CD ROM, DVD ROM, Blu-ray disc, etc.).

[0113] The computer-readable storage medium may also store at least one computer executable program, such as a computer-readable instruction. The computer-readable storage medium includes, but is not limited to, for example, a volatile memory and / or a non-volatile memory. The volatile memory may include, for example, a random access memory (RAM) and / or a cache memory (cache), etc. The computer-readable storage medium may include, for example, a read-only memory (ROM), a hard disk, a flash memory, etc. For example, a non-transitory computer-readable storage medium may be connected to a computing device such as a computer, and then, when the computing device runs the computer-readable instructions stored on the computer-readable storage medium, the various methods described above may be performed.

[0114] In addition, the computer device may also include (but not limited to) a data bus, an input / output (I / O) bus, a display, and input / output devices (eg, keyboard, mouse, speaker, etc.), etc.

[0115] The processor may communicate with external devices via an I / O bus via a wired or wireless network.

[0116] In one embodiment, the at least one computer executable instruction may also be compiled into or constitute a software product / computer program product, wherein one or more computer executable instructions are executed by a processor to perform the various functions and / or method steps in the embodiments described in the present technology.

[0117] In the embodiments provided in the present disclosure, it should be understood that the disclosed systems and methods can also be implemented in other ways. The system embodiments described above are merely schematic. For example, the flowcharts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the systems, methods and computer program products according to the multiple embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of the code, and the above-mentioned module, program segment or a part of the code contains one or more executable instructions for implementing the specified logical functions. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0118] It should be noted that in the present disclosure, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element limited by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0119] Although the embodiments disclosed in the present disclosure are as above, the above contents are only embodiments adopted for facilitating the understanding of the present disclosure and are not intended to limit the present disclosure. Any technician in the technical field to which the present disclosure belongs can make any modifications and changes in the form and details of the implementation without departing from the spirit and scope disclosed in the present disclosure, but the scope of patent protection of the present disclosure shall still be subject to the scope defined in the attached claims.

Claims

1. A method for verifying computing resource characteristics, characterized in that: include: Performing node feature clustering on the pre-acquired node resource information set to obtain a resource feature class set, and initializing a tree structure of the node resource information set according to the resource feature class set to obtain a node resource tree; Perform resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree; Performing a commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree; Obtaining the node resource information to be verified, and filtering out the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree according to the node resource tree; Performing commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result; The initial commitment proof tree is subjected to a commitment nesting operation in a bottom-up hierarchical order to obtain a complete commitment proof tree, including: Selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as target primary commitment proofs, and determining whether the target primary commitment proof has child nodes; If not, return to the step of selecting tree nodes in the initial commitment proof tree one by one in a bottom-up hierarchical order as the target primary commitment proof; If yes, then taking the child node of the target primary commitment node as the target child node, and taking the primary resource commitment of the target child node as the target primary child node commitment; Performing binary conversion and hash operation on the target primary child node commitment to obtain a target hash child node commitment; The primary resource commitment of the target primary commitment certificate is updated according to the target hash subnode commitment to obtain a standard commitment certificate, until the target primary commitment certificate is the root node of the initial commitment certificate tree, and the initial commitment certificate tree is used as a complete commitment certificate tree.

2. The method for verifying computing resource characteristics according to claim 1, characterized in that: The step of initializing the tree structure of the node resource information set according to the resource feature set to obtain a node resource tree includes: Perform resource fusion on the node resource information set to obtain overall resource information, and generate a resource root node according to the overall resource information; Selecting resource feature classes in the resource feature class set one by one as target resource feature classes, and collecting node resource information corresponding to the target resource feature classes in the node resource information set into a target resource information group; Perform resource fusion on the target resource information group to obtain target cluster resource information, and generate resource internal nodes according to the target cluster resource information; Selecting node resource information in the target resource information group one by one as target resource information, and generating resource leaf nodes according to the target resource information; All resource leaf nodes, all resource internal nodes and the resource root node are hierarchically connected to obtain a node resource tree.

3. The method for verifying computing resource characteristics according to claim 1, characterized in that: The step of performing resource commitment and range certification on each node in the node resource tree to obtain an initial commitment certification tree includes: Selecting nodes in the node resource tree one by one as target resource nodes, and extracting target resource information from the target resource nodes; Initialize a commitment random number, and generate a primary resource commitment according to the commitment random number and the target resource information; Proof the scope of the target resource information according to the primary resource commitment to obtain a resource certificate; generating a primary commitment certificate based on the primary resource commitment and the resource certificate; A tree structure is extracted from the node resource tree, and all primary commitment certificates are hierarchically connected according to the tree structure to obtain an initial commitment certificate tree.

4. The method for verifying computing resource characteristics according to claim 1, characterized in that: The target standard commitment certificate is restored and the commitment certificate is verified to obtain a verification result, including: Determine whether the target standard commitment certificate has a child node; If not, then the target standard commitment certificate is subject to commitment verification and scope verification to obtain a verification result; If yes, the standard resource commitment of the child node is used as the target child node commitment, and the target child node commitment is converted into a binary format and hashed to obtain a hashed child node commitment; Perform a commitment restoration operation on the target standard commitment certificate according to the hash child node commitment to obtain a target restored commitment certificate; The target reduction commitment certificate is subjected to commitment verification and scope verification to obtain a verification result.

5. The method for verifying computing resource characteristics according to claim 1, characterized in that: The node feature clustering of the pre-acquired node resource information set to obtain a resource feature set includes: Perform node information matching on the pre-acquired node resource information set to obtain a computing node information set; Extracting a resource location feature set, a resource organization feature set, and a resource type feature set from the computing node information set; Merging the resource location feature set, the resource organization feature set, and the resource type feature set into a resource feature set; The resource feature set is clustered by node features to obtain a resource feature class set.

6. A computing resource feature verification system for implementing the computing resource feature verification method according to any one of claims 1 to 5, characterized in that: include: A tree initialization module is used to perform node feature clustering on a pre-acquired node resource information set to obtain a resource feature class set, and to perform tree structure initialization on the node resource information set according to the resource feature class set to obtain a node resource tree; A commitment proof module, used to perform resource commitment and range proof on each node in the node resource tree to obtain an initial commitment proof tree; A commitment nesting module, used to perform a commitment nesting operation on the initial commitment proof tree in a bottom-up hierarchical order to obtain a complete commitment proof tree; A node screening module, used to obtain the node resource information to be verified, and screen out the target standard commitment certificate corresponding to the node resource information from the complete commitment certificate tree according to the node resource tree; The commitment verification module is used to perform commitment restoration and commitment proof verification on the target standard commitment proof to obtain a verification result.

7. A computer device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the steps of the method for verifying the characteristics of computing resources as claimed in any one of claims 1 to 5.

8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for verifying the characteristics of computing resources described in any one of claims 1 to 5 are implemented.

9. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method for verifying the characteristics of computing resources described in any one of claims 1 to 5 are implemented.

Images