A hierarchical authentication auditing electronic certificate generation method

Abstract

The present application relates to the technical field of electronic certificate generation, and discloses a hierarchical authentication auditing electronic certificate generation method, comprising: obtaining the multi-domain authentication level of an application subject and performing numerical mapping; performing Pedersen commitment operation on each authentication domain level value and generating zero-knowledge range proof data; constructing the Merkle tree structure of each authentication domain and calculating the root hash; generating cross-domain aggregated commitment value and aggregated range proof based on homomorphic operation; performing batch verification preprocessing and compressing multi-domain range proof; assembling cross-domain aggregated certificate load and performing signature operation; encapsulating cross-domain aggregated selectively-disclosed electronic certificate and supporting double-path verification.

Description

Technical Field

[0001] This invention relates to the field of electronic certificate generation technology, and specifically to a method for generating tiered authentication and verification electronic certificates. Background Technology

[0002] In multi-certification domain scenarios such as quality management, information security, and compliance qualifications, applicants need to pass the hierarchical review of each certification domain and hold the corresponding electronic certificate. The verifier determines whether the applicant meets the admission requirements based on the level information in the certificate.

[0003] Existing electronic certificate generation methods typically record the applicant's precise authentication level value directly in the certificate. The verifier completes the verification by reading the precise value and comparing it with the admission threshold. In multi-authentication domain scenarios, the verifier must perform signature verification and level comparison for each domain certificate one by one.

[0004] The above approach has two types of technical problems: First, the precise level values ​​in the certificate exceed the actual verification needs of the verifier, resulting in the exposure of information beyond the scope; Second, in the process of multi-domain joint verification, the verifier must perform verification operations domain by domain, and cannot prove that the cross-domain comprehensive qualification meets the composite access conditions while hiding the precise level values ​​of each domain. This causes the verification overhead of multi-domain joint verification to increase with the number of certified domains, and the privacy protection capability is insufficient. Summary of the Invention

[0005] This invention provides a method for generating electronic certificates for hierarchical authentication and verification, which solves the technical problem in related technologies that electronic certificates cannot simultaneously support cross-domain comprehensive qualification verification and disclosure of specified dimension compliance information while hiding precise level values.

[0006] This invention discloses a method for generating tiered authentication and verification electronic certificates, comprising the following steps: Obtain the set of final authentication levels determined by the applicant through multi-node consensus review in multiple authentication domains, map the final authentication level of each authentication domain to a numerical representation within a preset integer value range, and obtain the level value of each authentication domain. Perform a Pedersen commitment operation on the level value for each authentication domain to generate the corresponding level commitment value; Based on the level commitment value and the preset level range boundary, zero-knowledge range proof data is generated. The zero-knowledge range proof data indicates that the level value falls within the standard range without outputting an exact value. For each evaluation dimension, the commitment value is calculated independently for each dimension and an unlock key is generated. The commitment values ​​of each dimension and the level commitment values ​​are organized into a Merkle tree structure, and the Merkle tree root hash of each authentication domain is calculated. The composite admission condition expression is obtained, and the homomorphic property of the Pedersen commitment is used to perform a weighted linear combination of the level commitment values ​​of each authentication domain to generate the aggregate commitment value. Based on the aggregation commitment value and the aggregation threshold of the composite admission conditions, cross-domain aggregation range proof data is generated; Batch verification preprocessing is performed on zero-knowledge scope proof data from multiple authentication domains, and multiple independent zero-knowledge scope proof data are compressed into a single aggregate proof structure using a random linear combination technique. The aggregated proof structure, cross-domain aggregated scope proof data, Merkle tree root hash list of each authentication domain, applicant entity identifier and certificate validity period are assembled into a cross-domain aggregated certificate payload, and a signature operation is performed on the cross-domain aggregated certificate payload; The signed cross-domain aggregated certificate payload is encapsulated with the dimensional commitment value list of each authentication domain, the set of open keys, and the Merkle path proof to generate a cross-domain aggregated selectively disclosed electronic certificate. The cross-domain aggregated selectively disclosed electronic certificate supports the verification path of the aggregation scope proof and the verification path of the disclosure of the specified dimension compliance information.

[0007] Furthermore, the Pedersen commitment operation on the level value of each authentication domain includes: assuming the first... The level value of each authentication domain is Select random blinding factor Calculate the level commitment value ;in, and Let be two generators on the elliptic curve group. For the first The level commitment value for each authentication domain, For the first Blinding factor for each authentication domain.

[0008] Furthermore, the zero-knowledge range proof data is generated using the Bulletproofs protocol, which requires no trusted initialization parameters and whose proof length increases logarithmically with the number of bits in the level interval.

[0009] Further, the step of performing a weighted linear combination of the commitment values ​​for each authentication domain level to generate an aggregate commitment value includes: calculating... ;in, For the total number of authentication domains, For the first The weight coefficient of each authentication domain, This represents the scalar multiplication operation on the elliptic curve group. The aggregate commitment value; the weighting coefficient and aggregation threshold The verifier is dynamically specified in the verification request, and the certificate holder bases the verification on the level commitment value. For different combinations of weighting coefficients and aggregation thresholds, corresponding cross-domain aggregation range proof data are generated.

[0010] Furthermore, the commitment value for the compliance information of each evaluation dimension is calculated independently for each dimension, including: assuming the first dimension... The first authentication domain The compliance information for each assessment dimension is as follows: Select a random unlock key Calculate the dimensional commitment value ;in, For collision-resistant hash functions, For concatenation operators, For the first The first authentication domain The commitment values ​​for each evaluation dimension; the commitment values ​​for each dimension With the level commitment value As a leaf node, the hash of the parent node is calculated layer by layer to obtain the Merkle tree root hash. .

[0011] Furthermore, the method of compressing multiple independent zero-knowledge range proof data into a single aggregate proof structure using stochastic linear combination techniques includes: generating stochastic challenge coefficients. ,in For the first The random challenge coefficients corresponding to each authentication domain are used to perform a weighted linear combination of the inner product parameters of the zero-knowledge scope proof data for each domain. The individual zero-knowledge-scope proof data are merged and output as an aggregated proof structure. The random challenge coefficients are deterministically derived during the proof generation phase via a non-interactive Fiat-Shamir transformation.

[0012] Furthermore, the signature operation on the cross-domain aggregated certificate payload adopts the BLS aggregated signature scheme, in which the signer of each authentication domain performs the signature operation on the cross-domain aggregated certificate payload and then aggregates it into a single signature value.

[0013] Furthermore, the aggregated scope proof verification path includes: extracting cross-domain aggregated scope proof data and aggregated proof structure; the verifier confirms that the comprehensive qualification meets the composite access conditions by verifying the cross-domain aggregated scope proof data; and confirms that the zero-knowledge scope proof data of each domain is valid by verifying the aggregated proof structure. The entire verification process does not output any precise level value of the authentication domain. The specified dimension compliance information disclosure verification path includes: extracting the Merkle path proof and corresponding unlocking key for a specific dimension; the verifier uses the Merkle path proof to confirm that the dimension commitment value belongs to the data structure covered by the root hash; and uses the unlocking key to unlock the dimension commitment value to obtain the compliance information for the specified audit dimension.

[0014] This invention discloses a hierarchical authentication and verification electronic certificate generation system, comprising: The level mapping module is used to obtain the set of final authentication levels determined by the applicant in multiple authentication domains after multi-node consensus review, and to map the final authentication level of each authentication domain to a numerical representation within a preset integer value range; The commitment and proof generation module is used to perform Pedersen commitment operations on the level values ​​of each certification domain to generate level commitment values, and generate zero-knowledge scope proof data based on the level commitment values ​​and preset level interval boundaries. The Merkle tree building module is used to independently calculate the commitment value for each evaluation dimension's compliance information and generate the unlock key, organize the commitment values ​​of each dimension and the level commitment value into a Merkle tree structure and calculate the root hash; The cross-domain aggregation operation module is used to obtain the composite admission condition expression, perform homomorphic linear combination operation on the commitment values ​​of each authentication domain level to generate the aggregate commitment value, and generate cross-domain aggregation range proof data based on the aggregate commitment value; The batch compression module is used to perform batch verification preprocessing on multi-domain zero-knowledge scope proof data, and uses random linear combination technology to compress multiple independent zero-knowledge scope proof data into a single aggregate proof structure; the payload assembly and signature module is used to assemble the aggregate proof structure, cross-domain aggregate scope proof data, Merkle tree root hash list of each authentication domain, applicant identifier and certificate validity period into a cross-domain aggregate certificate payload, and perform signature operation on the cross-domain aggregate certificate payload. The certificate encapsulation module is used to encapsulate the signed cross-domain aggregated certificate payload with the list of dimensional commitment values ​​of each authentication domain, the set of open keys, and the Merkle path proof, to generate a cross-domain aggregated selectively disclosed electronic certificate, and supports the verification path of the aggregation scope proof and the verification path of the disclosure of specified dimension compliance information.

[0015] Furthermore, the cross-domain aggregation operation module is also used to receive the weight coefficient and aggregation threshold dynamically specified by the verifier in the verification request, and generate corresponding cross-domain aggregation range proof data for different combinations of weight coefficients and aggregation thresholds based on the same level commitment value, without re-executing the Pedersen commitment operation.

[0016] The beneficial effects of this invention are as follows: This invention transforms grade verification from precise numerical comparison to interval attribution determination by performing Pedersen commitment operations on grade values ​​and generating zero-knowledge range proof data. This solves the technical problem of disclosing precise grade values ​​beyond their range and achieves the technical effect of limiting the scope of disclosed information to the minimum set required for verification. This invention utilizes the homomorphic property of Pedersen commitments to perform linear combinations on multi-domain grade commitment values ​​and generate cross-domain aggregated range proof data. Simultaneously, it compresses multiple independent zero-knowledge range proof data into a single aggregated proof structure through random linear combination technology. This solves the technical problems of accumulated verification overhead and lack of privacy protection caused by domain-by-domain comparison operations in multi-domain joint verification. It achieves the technical effect that the computational and communication data volume of the verifier does not increase linearly with the number of authentication domains, and that the overall determination of composite admission conditions can be completed without outputting any single-domain precise grades. This invention, through the combination of a Merkle tree structure and dual-path verification, achieves the technical effect of switching on demand between the two types of needs: overall qualification verification and disclosure of information meeting specified dimensions. Attached Figure Description

[0017] Figure 1 This is a flowchart of the hierarchical authentication and auditing electronic certificate generation method provided in this embodiment of the invention. Detailed Implementation

[0018] The subject matter described herein will now be discussed with reference to exemplary embodiments. It should be understood that these embodiments are discussed only to enable those skilled in the art to better understand and implement the subject matter described herein, and changes may be made to the function and arrangement of the elements discussed without departing from the scope of this specification. Various processes or components may be omitted, substituted, or added as needed in the examples. Furthermore, some features described in the examples may be combined in other examples.

[0019] At least one embodiment of the present invention discloses a method for generating tiered authentication and verification electronic certificates, see [link to relevant documentation]. Figure 1 This includes the following steps: Step 1: Obtain the multi-domain authentication level of the applicant and perform numerical mapping.

[0020] Obtain the set of final authentication levels determined by the applicant across multiple authentication domains through multi-node consensus review or arbitration. Each authentication domain corresponds to an independent level review result. Map the final authentication level of each authentication domain to a numerical representation within a preset integer value range, which serves as the level numerical input for subsequent processing.

[0021] It should be noted that the aforementioned integer range refers to a pre-defined continuous integer interval. For example, discrete level labels such as "Basic," "Intermediate," and "Advanced" are sequentially mapped to increasing integers within this interval, thus preserving the orderliness of the levels in the numerical space. The mapping relationship is publicly agreed upon by the certification body before certificate issuance, and each certification domain may adopt the same or independent mapping rules.

[0022] Step 2: Perform commitment calculations on the numerical values ​​of each authentication domain level and generate a zero-knowledge scope proof.

[0023] Perform a Pedersen commitment operation on the level value of each authentication domain to generate the corresponding level commitment value. Let the first... The level value of each authentication domain is Select random blinding factor Then the level commitment value is: ; in, and Let be two generators on the elliptic curve group. For the first The level value of each authentication domain. For the first The blinding factor corresponding to each authentication domain For the first The level commitment value for each authentication domain.

[0024] Based on rating commitment value and preset level range boundaries Generate zero-knowledge scope proof data The zero-knowledge range proof data is used to characterize Established but not output The precise value, of which For the first The lower bound of the admission threshold for each authentication domain. For the first The upper bound of the level value field for each authentication domain. Output the level commitment value for each authentication domain. and corresponding zero-knowledge scope proof data .

[0025] In this embodiment of the application, in order to improve the generation efficiency of zero-knowledge range proofs, zero-knowledge range proof data... It can be generated using the Bulletproofs protocol. The Bulletproofs protocol does not require trusted initialization parameters, and the proof length increases logarithmically with the number of bits in the interval, making it suitable for hierarchical authentication scenarios with a small numerical range of levels.

[0026] Step 3: Construct the Merkle tree structure for each authentication domain and calculate the root hash.

[0027] For each evaluation dimension, the compliance information is calculated independently, and a corresponding unlocking key is generated. Let the first dimension be... Each authentication domain contains The evaluation dimension, the first The compliance information for each dimension is as follows Select a random unlock key Calculate the dimensional commitment value: ; in, For collision-resistant hash functions, For concatenation operators, For the first The first authentication domain Information on compliance with standards across each assessment dimension. For the first The first authentication domain A random key to enable each evaluation dimension. For the first The first authentication domain Commitment value in each dimension.

[0028] Commitment values ​​of each dimension ( ) and the level commitment value obtained in step 2 Organized hierarchically as a Merkle tree structure, with and each As a leaf node, the hash of the parent node is calculated layer by layer, and finally the Merkle root hash is calculated. As the first The integrity anchor point of an authentication domain certificate.

[0029] It should be noted that the leaf node order of the above Merkle tree is agreed upon by each certification domain before certificate issuance. This consistent order ensures the verifiability of subsequent Merkle path proofs. (Level Commitment Value) Leaf nodes, which are located in fixed positions, participate in the construction of the tree, ensuring that hierarchical data and dimensional data that meet the standards are protected under the same integrity structure.

[0030] Step 4: Generate cross-domain aggregation commitment value and aggregation range proof based on homomorphic operations.

[0031] Obtain the composite admission condition expression specified by the verifier. The composite admission condition expression is expressed in the form of a linear combination inequality of each authentication domain level, denoted as: ; in, For the total number of authentication domains, For the authentication domain index, For the first The weight coefficient of each authentication domain, For the first The level value of each authentication domain. This is the aggregation threshold for composite admission conditions.

[0032] Utilizing the homomorphic property of Pedersen commitments, the commitment values ​​for each authentication domain level are determined. Perform a linear combination operation with the corresponding weights to obtain the aggregate commitment value: ; in, The aggregate commitment value is calculated and the operation is performed on the elliptic curve group. This indicates scalar multiplication. and Let be two generators on the elliptic curve group. For the first The blinding factor corresponding to each authentication domain.

[0033] Based on aggregate commitment value and the aggregation threshold of composite admission conditions Generate cross-domain aggregation range proof data , used to characterize It is valid but does not output any single-domain exact level value.

[0034] In this embodiment of the application, to support the verifier in flexibly specifying composite admission conditions under different verification scenarios, the weighting coefficient is... and aggregation threshold The verifier can be dynamically specified in the verification request, and the certificate holder commits to the same level of commitment. For different The combination generates the corresponding aggregate range proofs without having to re-execute the commitment operation in step 2.

[0035] Step 5: Perform batch verification preprocessing and compress multi-domain range proofs.

[0036] Merkle root hash of each authentication domain Level commitment value and zero-knowledge scope proof data Aggregates into a cross-domain proof package. Zero-knowledge scope proof data for each domain within the cross-domain proof package. ( Batch verification preprocessing is performed, using a stochastic linear combination technique to compress multiple independent zero-knowledge scope proofs into a single aggregated proof structure. Specifically, stochastic challenge coefficients are generated. ,in For the first The random challenge coefficients corresponding to each authentication domain are used to perform a weighted linear combination of the inner product parameters of the zero-knowledge scope proof data for each domain. The individual zero-knowledge-scope proof data are merged and output as an aggregated proof structure. This makes the aggregate proof structure A single verification is equivalent to a verification of all Verification of each independent zero-knowledge-scope proof data point.

[0037] It should be noted that the above-mentioned random challenge coefficient The proof should be deterministically derived by the verifier or through a non-interactive Fiat-Shamir transformation during the proof generation phase to ensure the aggregated proof structure. Its unforgeability.

[0038] Step 6: Assemble the cross-domain aggregate certificate payload and perform the signature operation.

[0039] Aggregate proof structure Cross-domain aggregation range proof data Merkle tree root hash list for each authentication domain The applicant's identifier and certificate validity period are assembled into a cross-domain aggregated certificate payload. Multi-domain joint signature or aggregated signature operations are performed on the cross-domain aggregated certificate payload, and the signed cross-domain aggregated certificate payload is output.

[0040] In this embodiment of the application, the signature operation can adopt the BLS aggregated signature scheme, in which the signer of each authentication domain performs signature on the cross-domain aggregated certificate payload and then aggregates it into a single signature value, so that the verifier can confirm the endorsement of the cross-domain aggregated certificate payload by all authentication domains through a single signature verification operation, thereby reducing the computational load of multi-domain signature verification.

[0041] Step 7: Encapsulate cross-domain aggregation to selectively disclose electronic certificates and support dual-path verification.

[0042] The signed cross-domain aggregate certificate payload is compared with the list of dimensional commitment values ​​for each authentication domain. Corresponding unlock key set And Merkle path proof encapsulation, generating cross-domain aggregated optional disclosure electronic certificates.

[0043] The cross-domain aggregation selectively discloses electronic certificates, supporting two verification paths: First, only extract cross-domain aggregation range proof data. and aggregate proof structure The verifier proves the data by verifying the cross-domain aggregation range. Confirming that the comprehensive qualifications meet the composite admission requirements, and passing the verification aggregate proof structure. The zero-knowledge scope proof data for each domain is confirmed to be valid, and the entire verification process does not output any precise level values ​​for the authentication domain. Secondly, extract specific dimensions. Merkle path proof and corresponding unlock key The verifier uses the Merkle path to prove the commitment value of the confirmed dimension. Belongs to root hash The data structure covered, and the unlock key used Enable Dimensional Commitment Value To obtain compliance information for the specified audit dimensions. .

[0044] On the other hand, the present invention also proposes a hierarchical authentication and verification electronic certificate generation system, comprising: The level mapping module is used to obtain the set of final certification levels determined by the applicant in multiple certification domains after multi-node consensus review or arbitration, and to map the final certification level of each certification domain to a numerical representation within a preset integer value range. The commitment and proof generation module is used to perform Pedersen commitment operations on the level values ​​of each certification domain to generate level commitment values, and generate zero-knowledge scope proof data based on the level commitment values ​​and preset level interval boundaries. The Merkle tree building module is used to independently calculate the commitment value for each evaluation dimension's compliance information and generate the unlock key, organize the commitment values ​​of each dimension and the level commitment value into a Merkle tree structure and calculate the root hash; The cross-domain aggregation operation module is used to obtain the composite admission condition expression, perform homomorphic linear combination operation on the commitment values ​​of each authentication domain level to generate the aggregate commitment value, and generate cross-domain aggregation range proof data based on the aggregate commitment value; The batch compression module is used to perform batch verification preprocessing on multi-domain zero-knowledge scope proof data, and uses random linear combination technology to compress multiple independent zero-knowledge scope proof data into a single aggregate proof structure. The payload assembly and signature module is used to assemble the aggregated proof structure, cross-domain aggregated scope proof data, Merkle tree root hash list of each authentication domain, applicant entity identifier and certificate validity period into a cross-domain aggregated certificate payload, and perform signature operations on the cross-domain aggregated certificate payload. The certificate encapsulation module is used to encapsulate the signed cross-domain aggregated certificate payload with the list of dimensional commitment values ​​of each authentication domain, the set of open keys, and the Merkle path proof, generating a cross-domain aggregated selectively disclosed electronic certificate, and supporting two verification paths: aggregated scope proof verification and disclosure of specified dimension compliance information.

[0045] By way of example, the system proposed in this invention may also include various features and combinations thereof in the method embodiments, which will not be elaborated here.

[0046] To address the issue of disclosing precise grade values ​​beyond their range, step 2 performs Pedersen commitment operations on the grade values ​​and generates zero-knowledge range proof data. This transforms grade verification from precise value comparison to interval attribution determination. The verifier only receives the conclusion that the grade falls within the acceptable range without obtaining the precise value, thus limiting the scope of disclosed information to the minimum set required for verification. To address the issues of insufficient efficiency and lack of privacy protection in cross-domain aggregate verification of multi-authentication domain certificates, step 4 utilizes the homomorphic property of Pedersen commitments to perform linear combination on multi-domain grade commitment values. This generates cross-domain aggregate range proof data without unsealing any single-domain precise grade, enabling the verifier to complete the overall determination of composite admission conditions through a single proof verification, eliminating the operation path of domain-by-domain comparison. Step 5 compresses multiple independent zero-knowledge range proof data into a single aggregate proof structure through random linear combination. This prevents the verifier's computational and communication data volume from increasing linearly with the number of authentication domains, alleviating the problem of accumulated verification overhead in multi-domain joint verification scenarios. The Merkle tree structure in step 3, combined with the dual-path verification in step 7, enables cross-domain aggregation to selectively disclose electronic certificates, allowing for on-demand switching between overall qualification verification and detailed disclosure of specified dimensions. This avoids the situation where the entire domain's complete information is forcibly exposed to meet detailed verification requirements.

[0047] The embodiments of the present invention have been described above. However, the embodiments are not limited to the specific implementation methods described above. The specific implementation methods described above are merely illustrative and not restrictive. Those skilled in the art can make more equivalent embodiments under the guidance of the present embodiments, and all of them are within the protection scope of the present embodiments.

Claims

1. A method for generating tiered authentication and verification electronic certificates, characterized in that, Includes the following steps: Obtain the set of final authentication levels determined by the applicant through multi-node consensus review in multiple authentication domains, map the final authentication level of each authentication domain to a numerical representation within a preset integer value range, and obtain the level value of each authentication domain. Perform Pedersen commitment operation on the level value of each authentication domain to generate the corresponding level commitment value; based on the level commitment value and the preset level interval boundary, generate zero-knowledge range proof data, which indicates that the level value falls within the qualified range without outputting the precise value; For each assessment dimension, the commitment value is calculated independently for each dimension and an unlocking key is generated. The commitment values ​​for each dimension and the level commitment values ​​are organized into a Merkle tree structure, and the Merkle tree root hash for each authentication domain is calculated. Obtain the composite admission condition expression, and use the homomorphic property of Pedersen commitment to perform a weighted linear combination of the commitment values ​​of each authentication domain level to generate the aggregate commitment value; based on the aggregate commitment value and the aggregation threshold of the composite admission condition, generate cross-domain aggregate range proof data; Batch verification preprocessing is performed on zero-knowledge scope proof data from multiple authentication domains, and multiple independent zero-knowledge scope proof data are compressed into a single aggregate proof structure using a random linear combination technique. The aggregated proof structure, cross-domain aggregated scope proof data, Merkle tree root hash list of each authentication domain, applicant entity identifier and certificate validity period are assembled into a cross-domain aggregated certificate payload, and a signature operation is performed on the cross-domain aggregated certificate payload; The signed cross-domain aggregated certificate payload is encapsulated with the dimensional commitment value list of each authentication domain, the set of open keys, and the Merkle path proof to generate a cross-domain aggregated selectively disclosed electronic certificate. The cross-domain aggregated selectively disclosed electronic certificate supports the verification path of the aggregation scope proof and the verification path of the disclosure of the specified dimension compliance information.

2. The method for generating tiered authentication and verification electronic certificates according to claim 1, wherein, The process of performing a Pedersen commitment operation on the level value for each authentication domain includes: Let the first The level value of each authentication domain is Select random blinding factor Calculate the level commitment value ;in, and Let be two generators on the elliptic curve group. For the first The level commitment value for each authentication domain, For the first Blinding factor for each authentication domain.

3. The method for generating tiered authentication and verification electronic certificates according to claim 2, wherein, The zero-knowledge range proof data is generated using the Bulletproofs protocol, which requires no trusted initialization parameters and whose proof length increases logarithmically with the number of bits in the level interval.

4. The method for generating tiered authentication and verification electronic certificates according to claim 2, wherein, The weighted linear combination of the commitment values ​​for each authentication domain level is performed to generate an aggregate commitment value. include: calculate ;in, For the total number of authentication domains, For the first The weight coefficient of each authentication domain, This represents the scalar multiplication operation on the elliptic curve group. The aggregate commitment value; the weighting coefficient and aggregation threshold The verifier is dynamically specified in the verification request, and the certificate holder bases the verification on the level commitment value. For different combinations of weighting coefficients and aggregation thresholds, corresponding cross-domain aggregation range proof data are generated.

5. The method for generating tiered authentication and verification electronic certificates according to claim 1, wherein, The commitment value for each assessment dimension's compliance information is calculated independently for each dimension, including: Let the first The first authentication domain The compliance information for each assessment dimension is as follows: Select a random unlock key Calculate the dimensional commitment value ;in, For collision-resistant hash functions, For concatenation operators, For the first The first authentication domain The commitment values ​​for each evaluation dimension; the commitment values ​​for each dimension With the level commitment value As a leaf node, the hash of the parent node is calculated layer by layer to obtain the Merkle tree root hash. .

6. The method for generating tiered authentication and verification electronic certificates according to claim 1, wherein, The method of compressing multiple independent zero-knowledge range proof data into a single aggregate proof structure using stochastic linear combination techniques includes: Generate random challenge coefficients ,in For the first The random challenge coefficients corresponding to each authentication domain are used to perform a weighted linear combination of the inner product parameters of the zero-knowledge scope proof data for each domain. The individual zero-knowledge-scope proof data are merged and output as an aggregated proof structure. The random challenge coefficients are deterministically derived during the proof generation phase via a non-interactive Fiat-Shamir transformation.

7. The method for generating tiered authentication and verification electronic certificates according to claim 1, wherein, The signature operation on the cross-domain aggregated certificate payload adopts the BLS aggregated signature scheme, in which the signer of each authentication domain performs the signature operation on the cross-domain aggregated certificate payload and then aggregates it into a single signature value.

8. The method for generating tiered authentication and verification electronic certificates according to claim 1, wherein, The aggregated scope proof verification path includes: extracting cross-domain aggregated scope proof data and aggregated proof structure; the verifier confirms that the comprehensive qualification meets the composite access conditions by verifying the cross-domain aggregated scope proof data; and confirms that the zero-knowledge scope proof data of each domain is valid by verifying the aggregated proof structure. The entire verification process does not output any precise level value of the authentication domain. The specified dimension compliance information disclosure verification path includes: extracting the Merkle path proof and corresponding unlocking key for a specific dimension; the verifier uses the Merkle path proof to confirm that the dimension commitment value belongs to the data structure covered by the root hash; and uses the unlocking key to unlock the dimension commitment value to obtain the compliance information for the specified audit dimension.

9. A hierarchical authentication and verification electronic certificate generation system, characterized in that, include: The level mapping module is used to obtain the set of final authentication levels determined by the applicant in multiple authentication domains after multi-node consensus review, and to map the final authentication level of each authentication domain to a numerical representation within a preset integer value range; The commitment and proof generation module is used to perform Pedersen commitment operations on the level values ​​of each certification domain to generate level commitment values, and generate zero-knowledge scope proof data based on the level commitment values ​​and preset level interval boundaries. The Merkle tree building module is used to independently calculate the commitment value for each evaluation dimension's compliance information and generate the unlock key, organize the commitment values ​​of each dimension and the level commitment value into a Merkle tree structure and calculate the root hash; The cross-domain aggregation operation module is used to obtain the composite admission condition expression, perform homomorphic linear combination operation on the commitment values ​​of each authentication domain level to generate the aggregate commitment value, and generate cross-domain aggregation range proof data based on the aggregate commitment value; The batch compression module is used to perform batch verification preprocessing on multi-domain zero-knowledge scope proof data, and uses random linear combination technology to compress multiple independent zero-knowledge scope proof data into a single aggregate proof structure. The payload assembly and signature module is used to assemble the aggregated proof structure, cross-domain aggregated scope proof data, Merkle tree root hash list of each authentication domain, applicant entity identifier and certificate validity period into a cross-domain aggregated certificate payload, and perform signature operations on the cross-domain aggregated certificate payload. The certificate encapsulation module is used to encapsulate the signed cross-domain aggregated certificate payload with the list of dimensional commitment values ​​of each authentication domain, the set of open keys, and the Merkle path proof, to generate a cross-domain aggregated selectively disclosed electronic certificate, and supports the verification path of the aggregation scope proof and the verification path of the disclosure of specified dimension compliance information.

10. The hierarchical authentication and verification electronic certificate generation system according to claim 9, wherein, The cross-domain aggregation operation module is also used to receive the weight coefficient and aggregation threshold dynamically specified by the verifier in the verification request, and generate corresponding cross-domain aggregation range proof data for different combinations of weight coefficients and aggregation thresholds based on the same level commitment value, without re-executing the Pedersen commitment operation.

Images