Data security cooperative processing method and system for inventory house transfer registration

Abstract

The application discloses a kind of data security collaborative processing method and system of inventory house transfer registration, it is related to data security collaborative processing technical field, solve the problem that data security control and auditing process credible verification cannot be adapted to support in the online collaborative handling of existing inventory house transfer registration.The application divides application materials into multiple logical data groups according to the audit responsibility range of each participating subject and encrypts them respectively, each participating subject performs parallel audit on the logical data group within its own authority range in a trusted execution environment, generates an audit result and a zero-knowledge proof for proving the compliance of the audit process.The application realizes layered security control of keys through threshold secret sharing and attribute-based encryption with time attributes, and strengthens the integrity of zero-knowledge proof through time-anchored branch execution hash chain, realizes minimum-privilege access of business data and full-link credible verification of auditing process, effectively improves the operational stability of online handling of inventory house transfer registration.

Description

Technical Field

[0001] This invention relates to the field of data security collaborative processing technology, and in particular to a data security collaborative processing method and system for the transfer registration of existing housing. Background Technology

[0002] The transfer registration of existing housing relies on the online government service platform to achieve fully automated and collaborative processing. After the application materials are submitted online, the platform automatically pushes business data to participating entities such as real estate registration, taxation, and civil affairs. Each participating entity automatically completes operations such as ownership verification, tax audit, and identity verification based on the system's preset process. The platform automatically summarizes the audit data of each entity and completes the result verification, automatically triggering ownership registration and related processing procedures, thus realizing fully online automated operation of business processing.

[0003] During the online automated collaborative operation of existing housing transfer registration, business data is still transmitted and accessed among multiple participating entities in a holistic form after being pushed according to the review responsibilities of each entity. The security control of data flow and access relies solely on the basic system permission configuration. There is no unified process compliance verification mechanism for the independent review process of multiple entities, which makes it difficult to form an adaptation support for business data security control and credible verification of the review process, thereby reducing the overall operational stability of online processing of existing housing transfer registration. Summary of the Invention

[0004] This invention provides a data security collaborative processing method and system for the transfer registration of existing housing stock, in order to solve the problems mentioned in the background art.

[0005] To achieve the above objectives, the present invention provides a data security collaborative processing method for the transfer registration of existing housing stock, comprising:

[0006] The application materials are divided into multiple logical data groups according to the review responsibilities of each participating entity, and each group is encrypted.

[0007] Each participating entity conducts parallel audits of logical data groups within its own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process;

[0008] The validity of zero-knowledge proofs is verified. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing is automatically carried out.

[0009] Preferably, the step of dividing the application materials into multiple logical data groups according to the review responsibilities of each participating entity includes:

[0010] Extract all data items from the application materials to obtain a set of independent data items;

[0011] For each data item in the set of independent data items, perform audit responsibility matching to obtain the complete set of audit responsibilities corresponding to each data item;

[0012] For each audit responsibility, the corresponding data items in the independent data item set are aggregated to obtain a logical data group.

[0013] Preferably, the step of encrypting the logical data groups separately includes:

[0014] Random key generation is performed on each logical data group to obtain an independent symmetric encryption key;

[0015] The logical data group is encrypted by performing symmetric encryption operation on an independent symmetric encryption key.

[0016] Based on the audit responsibilities corresponding to the logical data group, an access control policy is generated, resulting in an attribute-based encryption policy.

[0017] An independent symmetric encryption key is encrypted using an attribute-based encryption strategy to obtain an encrypted access key.

[0018] The encrypted data group and the encrypted access key are associated and mapped to obtain the associated storage record.

[0019] Preferably, the encryption of the independent symmetric encryption key based on the attribute-based encryption strategy to obtain the encrypted access key includes:

[0020] The independent symmetric encryption key is subjected to threshold secret sharing fragmentation to obtain key fragment groups;

[0021] Attribute-based encryption strategies are constructed based on audit responsibilities and preset effective time intervals.

[0022] The attribute-based encryption strategy is used to perform encryption operations on each fragment in the key fragment group to obtain the encrypted fragment packet;

[0023] All encrypted fragment packets are encapsulated into a single encrypted access key in a preset order.

[0024] Preferably, each participating entity performs parallel audits of logical data groups within its own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process, including:

[0025] Extract the conditional branch points from the preset review rules to obtain a set of branch points;

[0026] Decrypt the logical data group within the scope of permissions to obtain plaintext review data;

[0027] Based on plaintext review data, preset review rules are executed, and the judgment result of each branch point in the branch point set is recorded to obtain the branch result set and the review result.

[0028] Perform a chained hash operation on the branch result set in the execution order to generate a branch execution hash chain;

[0029] Zero-knowledge proofs are generated based on the audit results and the branch execution hash chain.

[0030] Preferably, the step of performing a chained hash operation on the branch result set in execution order to generate a branch execution hash chain includes:

[0031] Generate a unique identifier for each branch point in the branch point set to obtain the branch point identifier set;

[0032] Each branch point identifier is concatenated with the corresponding branch judgment result in the branch result set to obtain a set of branch identifier result pairs.

[0033] Perform a global hash calculation on the preset review rules to obtain the global hash value of the rules;

[0034] Using the rule's global hash value as the initial hash value, the branch identifier result set is iteratively hashed in the order of execution to generate a branch execution hash chain.

[0035] Preferably, the iterative hash operation on the branch identifier result set according to the execution order to generate a branch execution hash chain includes:

[0036] The branch point identifier, the corresponding branch judgment result, and the current trusted time identifier are concatenated to obtain a set of time-stamped branch result pairs.

[0037] The global hash value of the rule is concatenated with the preset time anchor seed to obtain the initial hash seed of the time anchor;

[0038] Using the initial hash seed of the time anchor as the initial value, iterative hash operations are performed on the time-marked branch result set in the execution order to generate a branch execution hash chain.

[0039] Preferably, the step of generating zero-knowledge proofs based on the audit results and branch execution hash chains includes:

[0040] Extract the identity credentials of the trusted execution environment nodes to obtain the node identity identifier;

[0041] Extract the global hash value of the plaintext review data to obtain the fingerprint of the input data;

[0042] Construct a group of related proof elements from node identity identifiers, input data fingerprints, branch execution hash chains, and audit results;

[0043] Multi-dimensional logical assertions are set for the elements of the related proof, and integrated zero-knowledge proofs are generated based on the multi-dimensional logical assertions.

[0044] Preferably, the validity verification of the zero-knowledge proof includes:

[0045] Using the global hash value of the rule as the initial input, and in accordance with the execution order corresponding to the branch point identifier set, iterative hash operation is performed on the concatenated value of each branch point identifier and the corresponding branch judgment result in the branch result set to obtain the simulated chain value;

[0046] The simulated chain value is compared with the final chain value of the branch execution hash chain to obtain the reproduction verification result;

[0047] The audit results are compared with the preset compliance thresholds to obtain the threshold comparison results;

[0048] Perform a logical AND operation on the reproduction verification result and the threshold comparison result to obtain the validity verification result.

[0049] To address the aforementioned issues, this invention also provides a data security collaborative processing system for the transfer registration of existing housing stock, the system comprising:

[0050] The data grouping encryption module is used to divide the application materials into multiple logical data groups according to the review responsibilities of each participating entity and encrypt them separately.

[0051] The data parallel audit module is used by each participating entity to conduct parallel audits of logical data groups within their own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process;

[0052] The audit result verification module is used to verify the validity of zero-knowledge proofs. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing will be automatically carried out.

[0053] Compared with the prior art, the present invention has the following beneficial effects:

[0054] 1. By dividing logical data into groups according to the review responsibilities of each participating entity and encrypting them separately, and combining this with zero-knowledge proofs that demonstrate the compliance of the review process, precise isolation and minimum access permissions for business data are achieved. This avoids unnecessary data from flowing between multiple entities. At the same time, a unified compliance verification mechanism for the review process is established, so that data security control and credible review verification are compatible and supportive, effectively improving the overall operational stability of online processing of existing housing transfer registration.

[0055] 2. By integrating a key-layered encryption mechanism that combines threshold secret sharing with attribute-based encryption with time attributes, and combining it with a time-anchored branch execution hash chain generation method, the risk of total data loss due to a single key leak is further eliminated. This enables precise binding of access permissions with audit responsibilities and business cycles, while providing tamper-proof time traceability evidence for the audit process. It also strengthens the integrity and non-repudiation of zero-knowledge proofs, constructing a trusted and secure end-to-end system from data encryption and audit execution to result verification, thereby comprehensively improving the security and reliability of business processing. Attached Figure Description

[0056] Figure 1 A flowchart illustrating a data security collaborative processing method for the transfer registration of existing housing stock, provided by this invention;

[0057] Figure 2 A flowchart of the independent symmetric encryption key encryption method provided by the present invention;

[0058] Figure 3 The present invention provides a module structure diagram of a data security collaborative processing system for the transfer registration of existing housing. Detailed Implementation

[0059] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0060] Reference Figures 1-2 As shown in this embodiment, a data security collaborative processing method for the transfer registration of existing housing includes:

[0061] Step 1: Divide the application materials into multiple logical data groups according to the review responsibilities of each participating entity and encrypt them separately.

[0062] In this embodiment of the invention, the application materials are divided into multiple logical data groups according to the review responsibilities of each participating entity, including:

[0063] Extract all data items from the application materials to obtain a set of independent data items;

[0064] For each data item in the set of independent data items, perform audit responsibility matching to obtain the complete set of audit responsibilities corresponding to each data item;

[0065] For each audit responsibility, the corresponding data items in the independent data item set are aggregated to obtain a logical data group.

[0066] In this embodiment of the invention, the logical data groups are encrypted separately, including:

[0067] Random key generation is performed on each logical data group to obtain an independent symmetric encryption key;

[0068] The logical data group is encrypted by performing symmetric encryption operation on an independent symmetric encryption key.

[0069] Based on the audit responsibilities corresponding to the logical data group, an access control policy is generated, resulting in an attribute-based encryption policy.

[0070] An independent symmetric encryption key is encrypted using an attribute-based encryption strategy to obtain an encrypted access key.

[0071] The encrypted data group and the encrypted access key are associated and mapped to obtain the associated storage record.

[0072] In this embodiment of the invention, an independent symmetric encryption key is encrypted using an attribute-based encryption strategy to obtain an encrypted access key, including:

[0073] The independent symmetric encryption key is subjected to threshold secret sharing fragmentation to obtain key fragment groups;

[0074] Attribute-based encryption strategies are constructed based on audit responsibilities and preset effective time intervals.

[0075] The attribute-based encryption strategy is used to perform encryption operations on each fragment in the key fragment group to obtain the encrypted fragment packet;

[0076] All encrypted fragment packets are encapsulated into a single encrypted access key in a preset order.

[0077] In practice, all application materials for the transfer registration of existing housing are scanned page by page, including the property ownership certificate, identity documents of the buyer and seller, existing housing sales contract, tax payment certificate, marital status certificate, etc. All extractable information on each page is identified, and each indivisible information unit is treated as an independent data item.

[0078] For example, the names and ID numbers of the buyer and seller, the address of the house, the building area of ​​the house, the contract price, the amount of tax paid, marital status, etc., all the extracted indivisible information units together form an independent set of data items.

[0079] Furthermore, each data item in the set of independent data items is traversed, and the content of the data item is compared with the audit items corresponding to each preset audit responsibility. When a data item belongs to the audit item scope of a certain audit responsibility, the audit responsibility is added to the audit responsibility set corresponding to the data item.

[0080] The pre-defined review responsibilities may include the ownership review responsibilities of real estate registration agencies, the tax payment review responsibilities of tax authorities, the marital status review responsibilities of civil affairs departments, and the identity information review responsibilities of public security departments. For example, if the data item of the house location address only falls within the scope of the ownership review responsibilities of real estate registration agencies, then the review responsibility set corresponding to this data item only includes the ownership review responsibilities of real estate registration agencies. If the data item of the ID card numbers of the buyer and seller falls within the scope of the identity information review responsibilities of public security departments and the ownership review responsibilities of real estate registration agencies, then the review responsibility set corresponding to this data item includes the above two review responsibilities. The review responsibility sets corresponding to all data items together constitute the complete review responsibility set corresponding to each data item.

[0081] Then, iterate through all the preset audit responsibilities. For each audit responsibility, select all data items in the independent data item set that contain that audit responsibility set, and integrate all the selected data items into a logical data group.

[0082] For example, for the real estate registration agency's responsibility of verifying ownership, data items such as the property address, building area, property ownership certificate number, names of the buyer and seller, and ID card numbers of the buyer and seller are selected and integrated into a logical data group for ownership verification. For the tax department's responsibility of verifying tax payment, data items such as contract transaction price, tax amount, and tax payment certificate number are selected and integrated into a logical data group for tax payment verification.

[0083] Furthermore, for each logical data group, a random binary sequence of a length that meets the encryption requirements is generated by a hardware random number generator. This random binary sequence is used as the independent symmetric encryption key corresponding to the logical data group. Each logical data group corresponds to a unique independent symmetric encryption key, and the independent symmetric encryption keys of different logical data groups are different from each other.

[0084] Next, all data items in the logical data group are converted into a binary data stream in a preset fixed order. The binary data stream is then encrypted block by block using the independent symmetric encryption key corresponding to the logical data group. The resulting binary ciphertext data stream is the encrypted data group.

[0085] Then, the audit responsibilities corresponding to the logical data group are extracted, and the audit responsibilities are used as the core access attributes. At the same time, the identity attribute requirements of the access subject are added, and an access control rule is constructed that can only be decrypted by subjects with the corresponding audit responsibility attributes. This access control rule is the attribute-based encryption strategy.

[0086] For example, the attribute-based encryption strategy for the logical data group for ownership verification stipulates that only entities with the ownership verification responsibilities of real estate registration agencies can decrypt the content encrypted by this strategy.

[0087] Furthermore, the independent symmetric encryption key is split into multiple key fragments. When splitting, a minimum number of fragments required for decryption is set. The complete independent symmetric encryption key can only be recovered if no less than this number of valid key fragments are collected. All the split key fragments together form a key fragment group.

[0088] In this embodiment, during the splitting process, a unique public index value is assigned to each key fragment. Simultaneously, a uniform large prime number is pre-selected as the finite field modulus. The fragmentation is completed based on the Lagrange interpolation principle. The original symmetric encryption key is then recovered using the following formula:

[0089]

[0090] In the formula, The original symmetric encryption key that needs to be recovered is derived from the independent symmetric encryption key generated before the fragmentation.

[0091] The minimum number of valid key fragments required for decryption, also known as the threshold, is derived from a preset value when the fragments are split. This preset value can be determined based on the number of participating entities and business security requirements.

[0092] For the first The value of each valid key fragment comes from the content obtained by the participating entity after decrypting the corresponding encrypted fragment packet using the attribute private key.

[0093] For the first The public index value corresponding to each valid key fragment. For the first The public index value corresponding to each valid key fragment is derived from the unique public identifier assigned to each key fragment during fragment splitting, and is stored in the encrypted access key in association with the encrypted fragment packet.

[0094] The modulus of a finite field of a pre-selected large prime number is chosen, with a sufficiently large prime number selected in advance to ensure cryptographic security, and a unified agreement is reached among all participating entities in advance.

[0095] This formula is obtained through at least The coordinates of each distinct point are interpolated over a finite field to calculate... The constant term of the polynomial is the original symmetric encryption key.

[0096] When the number of valid key fragments collected is equal to At that time, it is possible to uniquely and accurately recover the original symmetric encryption key.

[0097] When the number of valid key fragments collected is less than At this time, there are infinitely many polynomials that meet the conditions, making it impossible to calculate the correct original key, thus ensuring the security of threshold access control.

[0098] When the number of valid key fragments collected is greater than At that time, arbitrarily select one of them Substituting each fragment into the formula yields the same correct original key.

[0099] For example, an independent symmetric encryption key can be split into five key fragments. A minimum of three valid key fragments are required to recover the complete key. During the splitting, a unique public index value is assigned to each fragment. Once the participating entities have collected at least three valid fragments and their corresponding indices, they can substitute them into the formula to calculate the original key.

[0100] Furthermore, based on the previously constructed attribute-based encryption strategy, a preset valid time interval attribute is added, stipulating that only entities with the corresponding review responsibility attributes can decrypt the content encrypted by the strategy within this valid time interval. The preset valid time interval can be determined according to the regular processing cycle of existing housing transfer registration business, for example, it can be set as the time period from the date of submission of application materials to the date of completion of business processing.

[0101] Then, each key fragment in the key fragment group is traversed, and the constructed attribute-based encryption strategy is used to encrypt the key fragment. After each key fragment is encrypted, an independent encrypted fragment packet is obtained. The total number of encrypted fragment packets is the same as the number of key fragments in the key fragment group.

[0102] Then, following the original order in which the key was split, all encrypted fragment packets are sequentially assembled into a complete binary data stream. A uniform file header identifier is added to this binary data stream to identify it as an encrypted access key. The final complete binary data stream with the file header identifier is the encrypted access key.

[0103] Finally, a unique storage identifier is generated for each encrypted data group. This storage identifier is then bound to the corresponding encrypted access key, generating a record that includes the storage address of the encrypted data group, the storage address of the encrypted access key, and the binding relationship between the two. This record is called the associated storage record, which is used to quickly locate the corresponding encrypted access key based on the encrypted data group in the future.

[0104] In summary, this solution constructs a collaborative architecture for data splitting, aggregation, and hierarchical encryption based on the responsibility dimension. First, the application materials are precisely split and logically aggregated at the data granularity according to the review responsibilities of each participating entity. Then, an independent symmetric encryption key is generated for each logical data group. After splitting the key into multiple fragments through threshold secret sharing, the key fragments are encrypted and encapsulated using an attribute-based encryption strategy that integrates review responsibilities and valid time intervals.

[0105] By employing the above methods, least privilege access control is implemented from the data source, completely avoiding the cross-entity flow of unnecessary sensitive data. At the same time, the threshold secret sharing mechanism eliminates the security risk of single key leakage, and attribute-based encryption with time attributes enables dynamic time-limited control of access permissions. While ensuring the security of data throughout its entire lifecycle, it is fully adaptable to the business process requirements of multi-entity parallel review.

[0106] Step 2: Each participating entity performs parallel audits of the logical data group within its own authority in the trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process.

[0107] In this embodiment of the invention, each participating entity performs parallel audits of logical data groups within its own authorized scope in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process, including:

[0108] Extract the conditional branch points from the preset review rules to obtain a set of branch points;

[0109] Decrypt the logical data group within the scope of permissions to obtain plaintext review data;

[0110] Based on plaintext review data, preset review rules are executed, and the judgment result of each branch point in the branch point set is recorded to obtain the branch result set and the review result.

[0111] Perform a chained hash operation on the branch result set in the execution order to generate a branch execution hash chain;

[0112] Zero-knowledge proofs are generated based on the audit results and the branch execution hash chain.

[0113] In this embodiment of the invention, a chained hash operation is performed on the branch result set according to the execution order to generate a branch execution hash chain, including:

[0114] Generate a unique identifier for each branch point in the branch point set to obtain the branch point identifier set;

[0115] Each branch point identifier is concatenated with the corresponding branch judgment result in the branch result set to obtain a set of branch identifier result pairs.

[0116] Perform a global hash calculation on the preset review rules to obtain the global hash value of the rules;

[0117] Using the rule's global hash value as the initial hash value, the branch identifier result set is iteratively hashed in the order of execution to generate a branch execution hash chain.

[0118] In this embodiment of the invention, the branch identifier result set is subjected to iterative hash operation according to the execution order to generate a branch execution hash chain, including:

[0119] The branch point identifier, the corresponding branch judgment result, and the current trusted time identifier are concatenated to obtain a set of time-stamped branch result pairs.

[0120] The global hash value of the rule is concatenated with the preset time anchor seed to obtain the initial hash seed of the time anchor;

[0121] Using the initial hash seed of the time anchor as the initial value, iterative hash operations are performed on the time-marked branch result set in the execution order to generate a branch execution hash chain.

[0122] In this embodiment of the invention, generating a zero-knowledge proof based on the audit result and the branch execution hash chain includes:

[0123] Extract the identity credentials of the trusted execution environment nodes to obtain the node identity identifier;

[0124] Extract the global hash value of the plaintext review data to obtain the fingerprint of the input data;

[0125] Construct a group of related proof elements from node identity identifiers, input data fingerprints, branch execution hash chains, and audit results;

[0126] Multi-dimensional logical assertions are set for the elements of the related proof, and integrated zero-knowledge proofs are generated based on the multi-dimensional logical assertions.

[0127] In practice, conditional branch points are extracted from the preset audit rules to obtain a set of branch points. The preset audit rules are complete logical processes pre-defined by each participating entity for auditing the corresponding logical data groups. All logical judgment nodes of the rule are sorted out line by line. Each node that needs to make a judgment on whether it meets or does not meet the input data is a conditional branch point. All extracted conditional branch points together form a set of branch points.

[0128] For example, the judgment points in the ownership verification rules of real estate registration agencies, such as whether the ownership of the house is clear, whether the house is subject to mortgage or seizure restrictions, and whether the identities of the buyer and seller are consistent with those recorded in the ownership certificate, will be extracted as independent condition branch points.

[0129] Then, the logical data group within the scope of authorization is decrypted to obtain plaintext review data. During decryption, the participating entity uses its own attribute private key to decrypt the corresponding encrypted access key. After collecting a sufficient number of valid key fragments, the complete independent symmetric encryption key is recovered. Then, the independent symmetric encryption key is used to decrypt the corresponding encrypted data group. The original data obtained after decryption is the plaintext review data.

[0130] For example, a real estate registration agency uses its own private key, which is associated with its ownership verification responsibilities, to decrypt the encrypted access key corresponding to the ownership verification logic data group. After recovering the independent symmetric encryption key, it decrypts the data to obtain plaintext verification data containing information such as the property's address, building area, property ownership certificate number, and the names of the buyer and seller.

[0131] Furthermore, based on the plaintext review data, preset review rules are executed, and the judgment result of each branch point in the branch point set is recorded to obtain the branch result set and the review result. According to the execution order of the preset review rules, the corresponding data items in the plaintext review data are substituted into each condition branch point for judgment in turn.

[0132] Here, after each branch point is judged, the judgment result corresponding to that branch point is recorded. When all branch points are judged, all the recorded judgment results are combined to form a branch result set. At the same time, the final review result is obtained by combining the judgment results of all branch points.

[0133] If all branch points meet the requirements, the review result is passed. If any branch point does not meet the requirements, the review result is failed. For example, when the real estate registration agency implements the ownership review rules, it sequentially judges whether the property ownership is clear, whether the property is subject to mortgage or seizure restrictions, and whether the identities of the buyer and seller are consistent with those recorded in the ownership certificate. The result of each judgment is recorded. If all judgments are met, the review result is passed.

[0134] Furthermore, a unique identifier is generated for each branch point in the branch point set to obtain a branch point identifier set. Specifically, according to the execution order of the conditional branch points in the preset review rules, a unique character sequence is assigned to each branch point. This character sequence is the unique identifier of the corresponding branch point. The unique identifiers of all branch points together form the branch point identifier set.

[0135] For example, the identifier for the first branch point in the ownership verification rules, whether the property ownership is clear, is set to a specific character sequence; the identifier for the second branch point, whether the property is subject to mortgage or seizure restrictions, is set to another different character sequence; and so on, generating unique identifiers for all branch points.

[0136] Then, each branch point identifier is concatenated with the corresponding branch judgment result in the branch result set to obtain a set of branch identifier result pairs.

[0137] During the concatenation process, the branch point identifiers are converted into binary byte sequences, and the corresponding branch judgment results are converted into fixed-length binary byte sequences. The two binary byte sequences are then concatenated end to end in the order of branch point identifiers first, followed by branch judgment results, to obtain a branch identifier result pair. All branch identifier result pairs corresponding to all branch points together form a set of branch identifier result pairs.

[0138] For example, the binary sequence of the branch point identifier indicating whether the property ownership is clear is concatenated with the binary sequence of the judgment result of the branch point to obtain the corresponding branch identifier result pair.

[0139] Furthermore, a global hash calculation is performed on the preset review rules to obtain the global hash value of the rules. It should be noted that the basic calculation logic of hash operation is to convert binary input data of arbitrary length into binary output data of fixed length. The same input data will inevitably produce the same output data after the operation. Different input data have a very high probability of producing different output data after the operation, and it is impossible to deduce the original input data from the output data.

[0140] In the specific operation, the input data is first divided into multiple sub-blocks of fixed length. For each sub-block, multiple rounds of bitwise operations and permutation operations are performed sequentially. In each round of operation, the content of the current sub-block is mixed with the result of the previous round of operation, and finally a fixed-length output result is obtained.

[0141] In this scheme, all text content of the preset review rules is converted into a continuous binary data stream. During the conversion, each character is converted into the corresponding binary byte sequence according to a unified character encoding standard. The binary byte sequences of all characters are connected end to end in the order of the text to form a complete binary data stream. Starting from the beginning of the data stream, the data stream is divided into multiple data blocks of a fixed length. If the length of the last data block is less than the fixed length, a fixed binary sequence is padded at the end of the data block to make the length of the last data block consistent with the fixed length. A hash operation is performed on the first data block.

[0142] During the operation, the data block is first divided into multiple sub-blocks of smaller fixed length. For each sub-block, multiple rounds of bitwise operations and permutation operations are performed sequentially. In each round of operation, the content of the current sub-block is mixed with the result of the previous round of operation, and finally the fixed-length hash result corresponding to the first data block is obtained.

[0143] Then, the hash result of the first data block is used as the initial input for the hash operation of the second data block. The same multi-round bit operation and permutation operation are performed on the second data block to obtain the hash result of the second data block. This process is repeated, using the hash result of the previous data block as the initial input for the hash operation of the next data block, and so on, to complete the hash operation of all data blocks in sequence. The hash result of the last data block is the global hash value of the rule, which can uniquely represent the complete content of the preset review rule.

[0144] If any content of the preset review rules changes, the resulting global hash value of the rules will also change. For example, after the ownership review rule text of the real estate registration agency is converted into a binary data stream, it is divided into multiple data blocks of fixed length. The hash operation of all data blocks is completed in sequence, and the final fixed-length binary sequence is the global hash value of the ownership review rule.

[0145] Furthermore, the branch point identifier, the corresponding branch judgment result, and the current trusted time identifier are concatenated by bytes to obtain a set of time-stamped branch result pairs.

[0146] During splicing, the current trusted time identifier is obtained from the trusted time source built into the trusted execution environment. The trusted time identifier is converted into a binary byte sequence and concatenated with the corresponding branch point identifier binary sequence and the branch judgment result binary sequence in the order of branch point identifier first, then branch judgment result, and finally trusted time identifier to obtain a time-stamped branch result pair.

[0147] Then, the time-stamped branch result pairs corresponding to all branch points together form a time-stamped branch result pair set. For example, when determining whether the ownership of a house is clear, the current reliable time identifier is obtained, and it is concatenated with the identifier of the branch point and the judgment result to obtain the corresponding time-stamped branch result pair.

[0148] Furthermore, the global hash value of the rule is concatenated with the preset time anchor seed to obtain the initial hash seed of the time anchor.

[0149] Specifically, the preset time anchor seed is a fixed binary sequence pre-set according to the regular processing cycle of the existing housing transfer registration business. This sequence remains consistent in the same batch of existing housing transfer registration business. The binary sequence corresponding to the rule global hash value is concatenated with the preset time anchor seed binary sequence, and the complete binary sequence obtained is the initial hash seed of the time anchor.

[0150] Then, using the initial hash seed of the time anchor as the initial value, iterative hash operations are performed on the time-marked branch result set in the execution order to generate a branch execution hash chain.

[0151] Specifically, the initial hash seed of the time anchor is used as the first operation input. The binary sequence of the first time-stamped branch result pair in the execution order is taken. This binary sequence is then concatenated with the current operation input in the order of operation input first, followed by time-stamped branch result pair, to form a new binary data stream.

[0152] Here, the same hash operation process as the global hash calculation of the rule is used to operate on the new binary data stream to obtain the first intermediate hash value. The first intermediate hash value is used as the input of the next operation. The binary sequence of the result pair of the second time mark branch in the execution order is taken, concatenated in the same way, and then hashed to obtain the second intermediate hash value.

[0153] This process continues until all time-stamped branch result pairs have been hashed. The last intermediate hash value is the final chain value of the branch execution hash chain. All intermediate hash values ​​and the final chain value together form the branch execution hash chain. For example, if the ownership review of a real estate registration agency has three time-stamped branch result pairs, the above process is followed to complete three iterations of hashing, resulting in three intermediate hash values ​​and the final chain value, which together form the branch execution hash chain for ownership review.

[0154] The identity credentials of the nodes in the Trusted Execution Environment (TEE) are extracted to obtain the node identity identifier. The pre-written node identity credentials are extracted from the secure storage area of ​​the TEE. These identity credentials are unique credentials issued by an authoritative organization when the node is deployed. The character sequence that can uniquely identify the node is extracted from the identity credentials. This character sequence is the node identity identifier.

[0155] Furthermore, the global hash value of the plaintext review data is extracted to obtain the input data fingerprint. During the extraction, the entire content of the plaintext review data is converted into a continuous binary data stream. During the conversion, the content of each data item is converted into the corresponding binary byte sequence according to a unified character encoding standard. The binary byte sequences of all data items are connected end to end in a preset fixed order to form a complete binary data stream.

[0156] Similarly, the binary data stream is processed using the same hash operation process as the global hash calculation of the rules. The final result is the global hash value of the plaintext audit data. This hash value is the input data fingerprint, which can uniquely represent the plaintext audit data used in this audit. If any data item in the plaintext audit data is changed, the final input data fingerprint will change.

[0157] For example, the plaintext verification data of the real estate registration agency includes the address of the house, the building area of ​​the house, the house ownership certificate number, etc. After completing the hash operation according to the above process, the final fixed-length binary sequence is the input data fingerprint of this verification.

[0158] Furthermore, the node identity identifier, input data fingerprint, branch execution hash chain, and audit result are constructed into an associated proof element group. Specifically, the node identity identifier, input data fingerprint, the final chain value of the branch execution hash chain, and the audit result can be arranged in a preset fixed order to form an interrelated set of elements. This set is the associated proof element group, in which each element corresponds to a specific stage of the audit process.

[0159] Finally, multi-dimensional logical assertions are set for the related proof element group, and integrated zero-knowledge proofs are generated based on the multi-dimensional logical assertions.

[0160] For example, the multi-dimensional logical assertions may include: the node identity identifier belongs to a legitimate participating entity node; the input data fingerprint is consistent with the plaintext audit data used in this audit; the branch execution hash chain can prove that the audit process is strictly executed in accordance with the preset audit rules; and the audit result is consistent with the judgment result corresponding to the branch execution hash chain.

[0161] Based on the above logical assertions, an integrated zero-knowledge proof is generated. This zero-knowledge proof can prove the compliance of the audit process and the authenticity of the audit results without disclosing any plaintext audit data or specific details of the audit process.

[0162] In summary, this scheme employs a trusted audit and verification system based on time-anchored branch execution hash chains and multi-dimensional integrated zero-knowledge proofs. It extracts the conditional branch points of audit rules within a trusted execution environment, anchors the branch judgment results with trusted time identifiers to generate chained hash records, and then combines node identity, input data fingerprints, and audit results to construct multi-dimensional logical assertions, thereby generating integrated zero-knowledge proofs.

[0163] Through the above settings, while ensuring the isolated execution of the audit process, zero-knowledge verification of audit compliance is achieved. It can prove that the audit is strictly executed according to the rules without disclosing any plaintext data or execution details. At the same time, the time anchoring mechanism enables precise traceability of the audit process, and multi-dimensional assertions ensure the integrity and immutability of the proof. It effectively solves the trust problem of multi-entity parallel audits and provides an irrefutable and credible basis for post-audit.

[0164] Step 3: Verify the validity of the zero-knowledge proofs. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing will be automatically carried out.

[0165] In this embodiment of the invention, the validity verification of zero-knowledge proof includes:

[0166] Using the global hash value of the rule as the initial input, and in accordance with the execution order corresponding to the branch point identifier set, iterative hash operation is performed on the concatenated value of each branch point identifier and the corresponding branch judgment result in the branch result set to obtain the simulated chain value;

[0167] The simulated chain value is compared with the final chain value of the branch execution hash chain to obtain the reproduction verification result;

[0168] The audit results are compared with the preset compliance thresholds to obtain the threshold comparison results;

[0169] Perform a logical AND operation on the reproduction verification result and the threshold comparison result to obtain the validity verification result.

[0170] In this embodiment of the invention, the global hash value can be used as the initial input, and the simulated chain value is obtained by iteratively hashing the concatenated value of each branch point identifier and the corresponding branch judgment result in the branch result set according to the execution order corresponding to the branch point identifier set.

[0171] For example, for zero-knowledge proofs of ownership verification by real estate registration agencies, the corresponding rule global hash value is extracted as the initial input. In the execution order of whether the property ownership is clear, whether the property is subject to mortgage or seizure restrictions, and whether the identities of the buyer and seller are consistent with those recorded in the ownership certificate, each branch point identifier and the corresponding branch judgment result are concatenated byte by byte. The same hash operation process as the rule global hash calculation is used to iteratively calculate each concatenated value, and finally obtain the simulated chain value.

[0172] The simulated chain value is then compared byte by byte with the final chain value of the branch execution hash chain to obtain the reproduction verification result. If the simulated chain value is completely consistent with the final chain value of the branch execution hash chain, the reproduction verification result is passed. If any byte is different, the reproduction verification result is failed.

[0173] Furthermore, the audit results are compared with the preset compliance thresholds to obtain the threshold comparison results. The preset compliance thresholds are the status indicators of the audit passed. These indicators are uniformly agreed upon in advance among all participating entities. If the audit results extracted from the zero-knowledge proofs are consistent with the status indicators, the threshold comparison results are passed; otherwise, the threshold comparison results are failed.

[0174] Then, a logical AND operation is performed on the reproduction verification result and the threshold comparison result to obtain the validity verification result. The rule of the logical AND operation is that the operation result is valid only when both results are passed, and the operation result is invalid if either result is failed.

[0175] Finally, when the validity verification results of the zero-knowledge proofs submitted by all participating entities are valid, and the review results of all participating entities are passed, the existing housing transfer registration operation will be automatically executed, an electronic real estate ownership certificate will be generated, and the ownership information in the real estate register will be updated.

[0176] In summary, this solution constructs a zero-knowledge proof validity verification mechanism based on branch execution hash chain reproduction and dual-dimensional logical verification. The complete audit execution chain is reproduced with the global hash value of the rule as the initial input. The audit result threshold comparison is used for dual independent verification. The verification results are integrated through logic and operations. Finally, the automatic transfer registration of existing housing is triggered based on the full proof validity and the consistency of the audit results.

[0177] This solution can complete the verification of proof validity without retrieving any original audit data, completely avoiding the risk of sensitive data leakage in the verification process. At the same time, the hash chain reproduction method ensures the objectivity and accuracy of the verification results. The two-dimensional verification effectively prevents proof forgery and audit result tampering. The fully automated verification and registration process greatly improves business processing efficiency, eliminates trust barriers in multi-entity collaboration, and realizes a trusted closed loop from audit to registration.

[0178] Example 2, as Figure 2 The diagram shown is a module structure diagram of a data security collaborative processing system for the transfer registration of existing housing provided by the present invention, which includes:

[0179] The data grouping encryption module is used to divide the application materials into multiple logical data groups according to the review responsibilities of each participating entity and encrypt them separately.

[0180] The data parallel audit module is used by each participating entity to conduct parallel audits of logical data groups within their own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process;

[0181] The audit result verification module is used to verify the validity of zero-knowledge proofs. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing will be automatically carried out.

[0182] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims

1. A data security collaborative processing method for the transfer registration of existing housing stock, characterized in that, The method includes: The application materials are divided into multiple logical data groups according to the review responsibilities of each participating entity, and each group is encrypted. Each participating entity conducts parallel audits of logical data groups within its own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process; The validity of zero-knowledge proofs is verified. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing is automatically carried out.

2. The data security collaborative processing method for the transfer registration of existing housing as described in claim 1, characterized in that, The application materials are divided into multiple logical data groups according to the review responsibilities of each participating entity, including: Extract all data items from the application materials to obtain a set of independent data items; For each data item in the set of independent data items, perform audit responsibility matching to obtain the complete set of audit responsibilities corresponding to each data item; For each audit responsibility, the corresponding data items in the independent data item set are aggregated to obtain a logical data group.

3. The data security collaborative processing method for the transfer registration of existing housing as described in claim 2, characterized in that, The encryption of the logical data groups separately includes: Random key generation is performed on each logical data group to obtain an independent symmetric encryption key; The logical data group is encrypted by performing symmetric encryption operation on an independent symmetric encryption key. Based on the audit responsibilities corresponding to the logical data group, an access control policy is generated, resulting in an attribute-based encryption policy. An independent symmetric encryption key is encrypted using an attribute-based encryption strategy to obtain an encrypted access key. The encrypted data group and the encrypted access key are associated and mapped to obtain the associated storage record.

4. The data security collaborative processing method for the transfer registration of existing housing as described in claim 3, characterized in that, The attribute-based encryption strategy encrypts the independent symmetric encryption key to obtain the encrypted access key, including: The independent symmetric encryption key is subjected to threshold secret sharing fragmentation to obtain key fragment groups; Attribute-based encryption strategies are constructed based on audit responsibilities and preset effective time intervals. The attribute-based encryption strategy is used to perform encryption operations on each fragment in the key fragment group to obtain the encrypted fragment packet; All encrypted fragment packets are encapsulated into a single encrypted access key in a preset order.

5. The data security collaborative processing method for the transfer registration of existing housing as described in claim 1, characterized in that, Each participating entity performs parallel audits of logical data groups within its own authorized scope in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process, including: Extract the conditional branch points from the preset review rules to obtain a set of branch points; Decrypt the logical data group within the scope of permissions to obtain plaintext review data; Based on plaintext review data, preset review rules are executed, and the judgment result of each branch point in the branch point set is recorded to obtain the branch result set and the review result. Perform a chained hash operation on the branch result set in the execution order to generate a branch execution hash chain; Zero-knowledge proofs are generated based on the audit results and the branch execution hash chain.

6. The data security collaborative processing method for the transfer registration of existing housing as described in claim 5, characterized in that, The step of performing a chained hash operation on the branch result set in execution order to generate a branch execution hash chain includes: Generate a unique identifier for each branch point in the branch point set to obtain the branch point identifier set; Each branch point identifier is concatenated with the corresponding branch judgment result in the branch result set to obtain a set of branch identifier result pairs. Perform a global hash calculation on the preset review rules to obtain the global hash value of the rules; Using the rule's global hash value as the initial hash value, the branch identifier result set is iteratively hashed in the order of execution to generate a branch execution hash chain.

7. The data security collaborative processing method for the transfer registration of existing housing as described in claim 6, characterized in that, The iterative hash operation on the branch identifier result set according to the execution order to generate a branch execution hash chain includes: The branch point identifier, the corresponding branch judgment result, and the current trusted time identifier are concatenated to obtain a set of time-stamped branch result pairs. The global hash value of the rule is concatenated with the preset time anchor seed to obtain the initial hash seed of the time anchor; Using the initial hash seed of the time anchor as the initial value, iterative hash operations are performed on the time-marked branch result set in the execution order to generate a branch execution hash chain.

8. The data security collaborative processing method for the transfer registration of existing housing as described in claim 5, characterized in that, The generation of zero-knowledge proofs based on audit results and branch execution hash chains includes: Extract the identity credentials of the trusted execution environment nodes to obtain the node identity identifier; Extract the global hash value of the plaintext review data to obtain the fingerprint of the input data; Construct a group of related proof elements from node identity identifiers, input data fingerprints, branch execution hash chains, and audit results; Multi-dimensional logical assertions are set for the elements of the related proof, and integrated zero-knowledge proofs are generated based on the multi-dimensional logical assertions.

9. The data security collaborative processing method for the transfer registration of existing housing as described in claim 7, characterized in that, The validity verification of zero-knowledge proofs includes: Using the global hash value of the rule as the initial input, and in accordance with the execution order corresponding to the branch point identifier set, iterative hash operation is performed on the concatenated value of each branch point identifier and the corresponding branch judgment result in the branch result set to obtain the simulated chain value; The simulated chain value is compared with the final chain value of the branch execution hash chain to obtain the reproduction verification result; The audit results are compared with the preset compliance thresholds to obtain the threshold comparison results; Perform a logical AND operation on the reproduction verification result and the threshold comparison result to obtain the validity verification result.

10. A data security collaborative processing system for the transfer registration of existing housing stock, used to implement the data security collaborative processing method for the transfer registration of existing housing stock as described in any one of claims 1-9, characterized in that, The system includes: The data grouping encryption module is used to divide the application materials into multiple logical data groups according to the review responsibilities of each participating entity and encrypt them separately. The data parallel audit module is used by each participating entity to conduct parallel audits of logical data groups within their own authority in a trusted execution environment, generating audit results and zero-knowledge proofs to demonstrate the compliance of the audit process; The audit result verification module is used to verify the validity of zero-knowledge proofs. When all zero-knowledge proofs are valid and all audit results are passed, the transfer registration of existing housing will be automatically carried out.

Images