A big data-based property transaction data tamper-proof storage system

Abstract

This invention relates to the field of data anti-tampering technology, specifically to a big data-based anti-tampering storage system for property rights transaction data. It includes: a data acquisition and access unit that receives raw transaction data generated during the property rights transaction process, formats and authenticates the raw transaction data to obtain processed transaction data; a data encryption and storage unit that encrypts the processed transaction data using the AES algorithm and submits the encrypted transaction data to a blockchain network for distributed storage; and a block generation and consensus unit that packages the encrypted transaction data using an attribute-based dimensional block structure. This invention employs a hybrid encryption mechanism combining the AES algorithm and post-quantum cryptography, combined with key lifecycle management based on master key protection, fundamentally preventing data leakage and tampering caused by quantum computing or long-term brute-force attacks cracking the encryption key.

Description

Technical Field

[0001] This invention relates to the field of data anti-tampering technology, and more specifically, to a data anti-tampering storage system for property rights transaction data based on big data. Background Technology

[0002] In existing property rights transaction systems, transaction data typically relies on centralized databases for storage and management, which suffers from vulnerabilities such as data tampering, insufficient security, and weak trust mechanisms. Due to the lack of effective anti-tampering mechanisms, internal administrators or external attackers may illegally modify, forge, or delete transaction records, leading to unclear ownership and legal disputes. Furthermore, traditional systems generally employ centralized identity authentication and access control, making it difficult to achieve non-repudiation and full traceability of operational actions, further exacerbating data trust risks. Regarding data encryption, most systems still use traditional public-key cryptography, with simple symmetric key management methods and key updates relying on manual intervention. This poses risks such as key leakage, lack of long-term key rotation, and insecure storage. Once the key is compromised, the confidentiality and integrity of the entire system's data will be compromised. Moreover, when existing blockchains are applied to property rights transactions, they typically use transaction replay for verification, resulting in low consensus efficiency and difficulty in supporting large-scale, high-frequency transaction scenarios. Simultaneously, there is a lack of efficient and verifiable structured representation of transaction data state changes, making it impossible to quickly achieve multi-dimensional (such as asset ID, transaction time, participants, etc.) data integrity verification. Therefore, a tamper-proof storage system for property rights transaction data based on big data is designed. Summary of the Invention

[0003] The purpose of this invention is to provide a data anti-tampering storage system for property rights transactions based on big data, in order to solve the problems of easy data tampering, insecure key management, low efficiency of status verification, and lack of efficient integrity verification mechanism in existing property rights transaction systems mentioned in the background art.

[0004] To achieve the above objectives, the present invention aims to provide a tamper-proof storage system for property rights transaction data based on big data, comprising:

[0005] The data acquisition and access unit receives the raw transaction data generated during the property rights transaction process, and performs formatting and identity authentication on the raw transaction data to obtain processed transaction data.

[0006] A data encryption and storage unit, which uses the AES algorithm to encrypt the processed transaction data and submits the encrypted transaction data to the blockchain network for distributed storage;

[0007] The block generation and consensus unit uses an attribute-based dimensional block structure to package the encrypted transaction data and uses a consensus mechanism based on attribute-based dimensional blocks to perform block consistency confirmation operations among multiple nodes in the blockchain network.

[0008] An on-chain verification unit performs integrity verification on transaction data in the blockchain network when it receives a query request.

[0009] As a further improvement to this technical solution, the data acquisition and access unit includes a data acquisition module and a data access module;

[0010] The data acquisition module acquires the original transaction data generated during the property rights transaction process in real time and adds timestamps and source identifiers to the original transaction data.

[0011] The data access module performs formatting and identity authentication on the collected raw transaction data.

[0012] As a further improvement to this technical solution, the data encryption and storage unit includes a data encryption module, a data storage module, and a key lifecycle management module;

[0013] The data encryption module uses the AES algorithm to encrypt the processed transaction data and performs post-quantum encryption on the data key used for encryption, thereby initializing a quantum-resistant and evolvable key management system and generating transaction data with composite encryption identifiers.

[0014] The data storage module submits the transaction data encrypted with the AES algorithm to the off-chain distributed storage system for storage, forming a distributed storage record, and also uses the encryption key encrypted with the quantum public key. Stored in the blockchain ledger, and at the same time, the master key... The hash value is recorded in the blockchain;

[0015] The key lifecycle management module periodically updates the temporary symmetric encryption key based on the automated key evolution mechanism of blockchain consensus. and ciphertext .

[0016] As a further improvement to this technical solution, the data encryption module initializes a quantum-resistant and evolvable key management system to generate transaction data with composite encryption identifiers, including the following steps:

[0017] S1.1, Call the key generator to generate a temporary symmetric encryption key. ;

[0018] S1.2 Using the AES algorithm based on this temporary symmetric encryption key The processed transaction data is encrypted to generate ciphertext. And mark the encryption status;

[0019] S1.3. Generate a post-quantum public key using a post-quantum cryptography key encapsulation mechanism. and post-quantum private key ;

[0020] S1.4, Using the post-quantum public key Temporary symmetric encryption key Encryption is performed to obtain the encryption key. ;

[0021] S1.5, Generate the master key by calling a secure random source. Using the master key Post-quantum private key Perform symmetric encryption to obtain the encrypted post-quantum private key. .

[0022] As a further improvement to this technical solution, the key lifecycle management module periodically updates the temporary symmetric encryption key based on the automated key evolution mechanism of blockchain consensus. and ciphertext This includes the following steps:

[0023] S1.6 Retrieve the original ciphertext from off-chain storage. And retrieve the encryption key from the chain. ;

[0024] S1.7 Using the master key Decrypt the post-quantum private key Obtain the original post-quantum private key. Using post-quantum private keys Decryption encryption key Obtain the original temporary symmetric encryption key Using a temporary symmetric encryption key Decrypting the ciphertext To retrieve plaintext data from memory;

[0025] S1.8. Using a post-quantum cryptography key encapsulation mechanism, repeat steps S1.1 to S1.5 to generate a new post-quantum public key. Post-quantum private key and new temporary symmetric encryption key ;

[0026] S1.9, Use the new temporary symmetric encryption key Encrypt plaintext data to generate new ciphertext. Replace the original ciphertext ; Utilizing the new post-quantum public key Encrypt new temporary symmetric encryption key Generate a new encryption key Using the original master key Encrypting new post-quantum private keys Generate a new encrypted post-quantum private key .

[0027] As a further improvement to this technical solution, the block generation and consensus unit includes a block generation module and a block consensus module;

[0028] The block generation module uses the attributed dimension block structure to package the encrypted transaction data and generate attributed dimension blocks.

[0029] The block consensus module broadcasts attributed dimension blocks to the blockchain network and uses the consensus mechanism based on attributed dimension blocks to perform block consistency confirmation operations among multiple nodes.

[0030] As a further improvement to this technical solution, the block generation module uses an attribute-based dimensional block structure to package the encrypted transaction data, including the following steps:

[0031] S2.1 Deconstruct the encrypted property rights transaction data into multiple attribute slices, submit each attribute slice to the corresponding global MPT, and at the same time, record the incremental updates of the global MPT state caused by all attribute slices in the block, and generate the corresponding Merkle path proofs, on a block-by-block basis.

[0032] S2.2 Construct attributed dimension blocks based on incremental updates, wherein the attributed dimension blocks include data dimension blocks and consistency proof blocks;

[0033] S2.3. Generate a new attributed dimension block header based on the attributed dimension block.

[0034] As a further improvement to this technical solution, the block consensus module utilizes a consensus mechanism based on attribute-based dimension blocks to perform block consistency confirmation operations among multiple nodes, including the following steps:

[0035] S2.4 The generated attributed dimension blocks are broadcast to all verification nodes of the blockchain network through the block-producing nodes in the blockchain network via a peer-to-peer network;

[0036] S2.5, Invoke the verification algorithm to perform zero-knowledge proofs attached to the attributed dimension blocks. Perform rapid verification;

[0037] S2.6, Verification nodes verify the zero-knowledge proof of the new block. Use the global MPT root hash set of the local ledger to determine the correctness and consistency of the state transitions of attributed dimension blocks;

[0038] S2.7 If the state transition of the attributed dimension block is correct and consistent, the verification node confirms that the attributed dimension block is valid, updates the global MPT root hash set to the latest root hash set declared in the new attributed dimension block header, and submits the verification node's confirmation of the validity of the attributed dimension block to the blockchain network to participate in the consensus process.

[0039] S2.8 Once the attributed dimension block receives confirmation from a legally valid number of verification nodes in the blockchain network, the attributed dimension block becomes the final determined block, and the verified attributed dimension block is recorded in the blockchain ledger status.

[0040] As a further improvement to this technical solution, in S2.6, judging the correctness and consistency of the state transition of the attributed dimension block specifically involves: using the verification node to retrieve the global MPT root hash set of the previous attributed dimension block from the local ledger, verifying whether the original state root referenced by the zero-knowledge proof is consistent with the local record, and confirming that the latest global MPT root hash set declared in the header of the new attributed dimension block is consistent with the verification result of the zero-knowledge proof.

[0041] As a further improvement to this technical solution, when the on-chain verification unit receives a query request, it obtains the corresponding attributed dimension block from the blockchain network and performs integrity checks on the block header, data dimension area, and consistency proof area. At the same time, it uses a zero-knowledge proof verification algorithm to verify the correctness of the transaction data and its incremental updates in the global MPT. If the verification is successful, the transaction data and verification result are returned. If the verification fails, the transaction data is refused and the abnormal state is recorded.

[0042] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0043] 1. The tamper-proof storage system for property rights transaction data based on big data disclosed in this invention employs a hybrid encryption mechanism combining AES algorithm and post-quantum cryptography (PQC-Kyber), along with key lifecycle management based on master key protection. This fundamentally prevents data leakage and tampering caused by the encryption key being cracked by quantum computing or long-term brute-force attacks. Specifically, during key evolution, the newly generated post-quantum private key is encrypted and protected using the unchanging master key K_master, and the encryption key and ciphertext are updated on the blockchain, achieving "forward-secure" re-encryption of the data. This mechanism ensures that even if the key is leaked at a certain stage, attackers cannot decrypt historical or future data, nor can they forge legitimate keys to replace or tamper with existing ciphertext. All key key state changes are recorded in an immutable blockchain ledger, forming a traceable and verifiable key evolution chain, thus building a robust tamper-proof defense at the encryption level and ensuring the authenticity and integrity of property rights transaction data during long-term storage.

[0044] 2. The tamper-proof storage system for property rights transaction data based on big data, as disclosed in this invention, deconstructs encrypted transaction data into multi-dimensional attribute slices and incorporates them into a global MPT (Merkle Patricia Trie) structure. Each transaction write generates a Merkle path proof, and the incremental state update is recorded in the block. By introducing zero-knowledge proofs (ZK-SNARK) into the attribute-based dimension blocks, it is proven that all updates are legitimately derived from transactions in this block and correctly applied to the global state. Verification nodes can quickly verify the state consistency of the entire block without replaying transactions. Any tampering, forgery, or selective modification of transaction data will result in a Merkle root mismatch or zero-knowledge proof verification failure. This mechanism upgrades data integrity verification from "transaction-by-transaction verification" to "overall state verification," significantly improving efficiency and ensuring, through cryptographic means, that all historical records are immutable once uploaded to the chain. Combined with the distributed ledger characteristics of blockchain, any node can independently verify the authenticity of the data, completely eliminating the risk of centralized tampering or partial data forgery, and achieving auditable, traceable, and tamper-proof storage of property rights transaction data throughout its entire lifecycle. Attached Figure Description

[0045] Figure 1 This is an overall flowchart of the present invention;

[0046] The meanings of the various markings in the diagram are as follows:

[0047] 1. Data acquisition and access unit; 2. Data encryption and storage unit; 21. Data encryption module; 22. Data storage module; 23. Key lifecycle management module; 3. Block generation and consensus unit; 31. Block generation module; 32. Block consensus module; 4. On-chain verification unit. Detailed Implementation

[0048] 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.

[0049] Example: Please refer to Figure 1 As shown, a tamper-proof storage system for property rights transaction data based on big data is provided, including:

[0050] Data acquisition and access unit 1 receives the raw transaction data generated during the property rights transaction process, and performs formatting and identity authentication on the raw transaction data to obtain the processed transaction data;

[0051] In this embodiment, the data acquisition and access unit 1 includes a data acquisition module and a data access module;

[0052] The data acquisition module is used to acquire raw transaction data generated during the property rights transaction process from the property rights transaction business system, registration system or user terminal in real time, and add timestamps and source identifiers to the raw transaction data;

[0053] The data access module formats and authenticates the collected raw transaction data to ensure that the data conforms to preset storage standards and generates standardized transaction data that can be used for subsequent encrypted storage. Specifically, it first formats the data according to preset data standards and field specifications, transforming unstructured or heterogeneous property rights transaction information into a unified data format. Then, it calls the identity authentication mechanism to verify the user or system from which the data originates. This process is achieved through distributed identity (DID), digital certificates, or digital signatures based on post-quantum cryptography (PQC) to ensure the legitimacy of the submitter and the credibility of the data source, thereby generating standardized transaction data that can be used for subsequent encryption and storage.

[0054] Data encryption and storage unit 2 uses the AES algorithm (symmetric encryption algorithm) to encrypt the processed transaction data and submits the encrypted transaction data to the blockchain network for distributed storage;

[0055] In this embodiment, the data encryption and storage unit 2 includes a data encryption module 21, a data storage module 22, and a key lifecycle management module 23;

[0056] The data encryption module 21 uses the AES algorithm (symmetric encryption algorithm) to encrypt the processed transaction data, and simultaneously performs post-quantum encryption on the data key used for encryption. This initializes a quantum-resistant and evolvable key management system, generating transaction data with a composite encryption identifier (here, the composite encryption identifier is a composite data structure, including: encryption algorithm identifier (AES algorithm 256 + PQC-KYBER hybrid mode), key metadata (including the hash of the PQC public key, the KDF version number), and version number (used to identify which generation of PQC algorithm is currently being used). The transaction data with the composite encryption identifier is a data packet, including core data encrypted with the AES algorithm, the AES key encrypted with the post-quantum public key, and the composite encryption identifier, to ensure the confidentiality and integrity of the data during storage and transmission.

[0057] Existing technologies typically rely on static keys or periodic manual key rotation, which are vulnerable to quantum computing threats, have low key update efficiency, and are prone to system downtime or data inconsistency. This device achieves quantum-resistant key protection and seamless key rotation through post-quantum cryptography and automated key evolution mechanisms: on the one hand, the post-quantum cryptography (PQC) key encapsulation mechanism (based on lattice-based CRYSTALS-Kyber) ensures long-term security of key distribution and resists quantum computing attacks; on the other hand, the master key-based key evolution architecture enables periodic automatic updates of data keys and post-quantum key pairs, eliminating the need to re-encrypt all historical data, significantly reducing operational complexity, improving system response speed and continuity, and enhancing the traceability and interoperability of multi-version key management by clearly identifying key versions and algorithm information through composite encryption identifiers.

[0058] The data storage module 22 submits the transaction data encrypted with the AES algorithm (symmetric encryption algorithm) to the off-chain distributed storage system (IPFS) for storage, forming an accessible distributed storage record, and also transmits the encryption key encrypted with the quantum public key. Stored in the blockchain ledger, and at the same time, the master key... The hash value is recorded on the blockchain for future verification;

[0059] The data storage module 22 establishes and initializes a long-term, stable key management core. First, it generates an independent master key, which is independent of the post-quantum key pair and serves as the highest-level trust anchor of the system. Then, it uses this master key to encrypt and protect the sensitive post-quantum private key, generating an encrypted post-quantum private key. The purpose of this is to entrust the security of the frequently used and updated post-quantum private key to a static master key that is rarely exposed and highly secure, thereby securely "locking up" the post-quantum private key itself and storing it on the blockchain, laying an operational foundation for subsequent key evolution.

[0060] The key lifecycle management module 23 periodically updates the temporary symmetric encryption key based on the automated key evolution mechanism of blockchain consensus. and ciphertext ;

[0061] The core function of the key lifecycle management module 23 is to securely rotate (evolve) all working keys under the protection of an unchanging master key. During the key evolution cycle, it uses the initially created, always-unchanging master key (rather than newly generated ones) to encrypt newly generated post-quantum private keys. This ensures that although the data encryption keys and post-quantum key pairs have been updated, the "master key" for unlocking these new keys remains the same, thus achieving seamless updates and version replacements of key materials. This step ultimately replaces the old records on the chain with all newly generated ciphertext and encryption keys, completing the re-encryption of data and the forward evolution of keys while maintaining the consistency of management logic.

[0062] Furthermore, the data encryption module 21 initializes a quantum-resistant and evolvable key management system to generate transaction data with composite encryption identifiers, including the following steps:

[0063] S1.1, Use a secure key generator (such as a true random number generator TRNG or a pseudo random number generator PRNG) to generate a temporary symmetric encryption key. ;

[0064] S1.2 Using the AES algorithm based on this temporary symmetric encryption key The processed transaction data is encrypted to generate ciphertext. And mark the encryption status;

[0065] S1.3. Generate post-quantum public keys using a post-quantum cryptography (PQC) key encapsulation mechanism (based on lattice-based CRYSTALS-Kyber). and post-quantum private key Specifically, it involves sampling random vectors on a high-dimensional lattice and performing polynomial operations to output a pair of parameter-dependent keys; where the public key... It consists of public parameters (including modulus, random polynomial, and public key vector) used for subsequent key encryption, and can be securely distributed within the system; the private key... It consists of a secret polynomial corresponding to the public key and related parameters, and is used to decrypt or recover the symmetric key;

[0066] S1.4, Using the post-quantum public key Temporary symmetric encryption key Encryption is performed to obtain the encryption key. The AES key itself is sensitive and is stored on the blockchain or in secure storage after being subjected to post-quantum encryption;

[0067] S1.5, Generate the master key by calling a secure random source. (Master Key) It does not directly decrypt data, but is used to encrypt and protect the key actually used for decryption. This key is a separate, long-term key that is securely stored and managed (off-chain secure storage) and is not publicly disclosed on the blockchain. It is used to generate the master key. The process is as follows: First, a cryptographically compliant true random number generator (such as DRBG recommended by NIST SP800-90A) is invoked to collect random entropy values ​​from high-entropy physical noise sources or trusted hardware security modules. After seed expansion and entropy enhancement, a random bit string of a specified length (such as 256 bits) is generated; this bit string serves as the master key. Upon generation, it is immediately stored in a protected secure storage area, and its hash value is calculated and written to the blockchain for subsequent verification, using the master key. Post-quantum private key Perform symmetric encryption to obtain the encrypted post-quantum private key. ( and (stored together on the blockchain)

[0068] Furthermore, the key lifecycle management module 23 periodically updates the temporary symmetric encryption key based on the automated key evolution mechanism of blockchain consensus. and ciphertext This includes the following steps:

[0069] S1.6 Retrieve the original ciphertext from off-chain storage. And retrieve the encryption key from the chain. ;

[0070] S1.7 Using the master key (Retrieved from off-chain secure storage) Decrypted post-quantum private key Obtain the original post-quantum private key. Using post-quantum private keys Decryption encryption key Obtain the original temporary symmetric encryption key Using a temporary symmetric encryption key Decrypting the ciphertext The plaintext data is retrieved from memory for a brief moment (the plaintext data only exists briefly in the Trusted Execution Environment (TEE) and is securely erased immediately after decryption to prevent residue).

[0071] S1.8. Using a post-quantum cryptography (PQC) key encapsulation mechanism, repeat steps S1.1 to S1.5 to generate a new post-quantum public key. Post-quantum private key and new temporary symmetric encryption key ;

[0072] S1.9, Use the new temporary symmetric encryption key Encrypt plaintext data to generate new ciphertext. Replace the original ciphertext ; Utilizing the new post-quantum public key Encrypt new temporary symmetric encryption key Generate a new encryption key Replace the original record on the chain with the original master key. Encrypting new post-quantum private keys Generate a new encrypted post-quantum private key Replace the original record on the chain.

[0073] Block generation and consensus unit 3 uses an attribute-based dimension block structure to package the encrypted transaction data and uses the consensus mechanism based on attribute-based dimension blocks to perform block consistency confirmation operations among multiple nodes in the blockchain network.

[0074] In this embodiment, the block generation and consensus unit 3 includes a block generation module 31 and a block consensus module 32;

[0075] The block generation module 31 uses an attribute-based dimension block structure to package the encrypted transaction data and generate attribute-based dimension blocks. Compared to the common structure (such as Merkle tree structure) used in existing blockchain technologies, which directly packages transaction data into blocks and verifies them sequentially, the core advantage of the attribute-based dimension block structure is that it changes the data organization method from transaction-centric to attribute-dimensional-centric. This structure deconstructs encrypted transaction data into multiple attribute slices (such as asset ID, transaction parties, etc.) and submits them to the corresponding global MPT state tree, realizing multi-dimensional indexing and efficient verification of data. Its function is not only to store data, but also to build a global state view that can be quickly verified.

[0076] Furthermore, the block generation module 31 uses the attributed dimension block structure to package the encrypted transaction data, including the following steps:

[0077] S2.1 Deconstruct the encrypted property rights transaction data into multiple attribute slices (including: asset ID, transacting party address, transaction time, and transaction type), and submit each attribute slice to the corresponding global MPT (the global MPT uses a root hash to represent the entire state set and can quickly verify whether an element is in the set). The global MPT includes MPT_AssetID: with asset ID as the key, MPT_Participant: with transacting party address as the key, MPT_Time: with transaction time as the key, and MPT_Type: with transaction type as the key. Simultaneously, on a block-by-block basis, record the incremental updates to the global MPT state caused by all attribute slices within the current block, and generate the corresponding Merkle path proof (in this device). In this process, when processing transactions on a block-by-block basis, the encrypted transaction data within a block is broken down into attribute slices of different dimensions (such as asset ID, transacting party, transaction time, transaction type, etc.), and these slices are written one by one into the corresponding global MPT structure. During the writing process, the system calculates the hash path from each slice update node to the MPT root node in real time, forming a Merkle path proof. This proof verifies that the slice has indeed been correctly written into the specified MPT, and that the update has been incorporated into the new global MPT root hash. Finally, the block records all incremental updates caused by attribute slices and their Merkle path proofs, thereby ensuring the integrity and traceability of any data. Once the data is tampered with, the corresponding path hash will no longer match the root hash.

[0078] S2.2 Construct attributed dimension blocks based on incremental updates. Each attributed dimension block contains a data dimension area (used to store the incremental updates and their Merkle proofs corresponding to all transaction slices) and a consistency proof area (generated by the block producer using zero-knowledge proof algorithms (ZK-SNARK, etc.) to prove that all transaction slices do indeed originate from the transactions in this block, and that these incremental updates have been correctly applied to the global MPT, ensuring that the updated root hash calculation is error-free). When subsequent key updates or state updates need to be uploaded to the chain, a new attributed dimension block will be generated with the same structure, but the content and state root hash have been updated.

[0079] S2.3. Based on the attributed dimension block, generate a new attributed dimension block header, which is used to record the necessary global state information, including the previous block hash, the main Merkle root of the transaction slice, the latest root hash set of the global MPT, and zero-knowledge proof.

[0080] The block consensus module 32 broadcasts the attributed dimension blocks to the blockchain network and uses the consensus mechanism based on attributed dimension blocks to perform block consistency confirmation operations among multiple nodes.

[0081] Among them, the consensus mechanism based on attribute-based blocks mainly addresses the core bottleneck problems of traditional blockchains in high-concurrency property rights transactions, which are characterized by low consensus efficiency, limited throughput, and cumbersome query verification due to the need for all nodes to verify and execute each transaction individually. Property rights transactions involve multiple parties, high frequency, and complex data dimensions. Existing technologies (such as traditional BFT or PoW) require each node to replay all transactions to verify the correctness of state transitions. This process is computationally redundant and time-consuming, failing to meet the business's requirements for real-time performance, high throughput, and efficient multi-dimensional query verification. Compared with traditional consensus mechanisms (such as PBFT requiring nodes to re-execute transactions, or PoW having probabilistic finality), the advantage of this mechanism lies in transforming computationally intensive consensus verification into verification-intensive verification: it introduces zero-knowledge proofs (ZK-SNARK), allowing block-producing nodes to generate a concise proof ( This proves that the global state transitions caused by all transaction slices (i.e., updates to the MPT root hashes in each dimension) are correct and consistent. Verifying nodes do not need to parse and replay any encrypted transactions within a block, improving consensus efficiency.

[0082] Furthermore, the block consensus module 32 performs a block consistency confirmation operation, including the following steps:

[0083] S2.4 The generated attributed dimension blocks (including data dimension area, consistency proof area and new attributed dimension block header) are broadcast to all verification nodes of the blockchain network through the block producing nodes in the blockchain network via the peer-to-peer network;

[0084] S2.5 After receiving the attributed dimension block, the verification node no longer replays each transaction in the block, but instead calls the verification algorithm to verify the zero-knowledge proof attached to the attributed dimension block. A rapid verification process is performed (the verification algorithm uses a zero-knowledge proof verifier to check whether the incremental update of the attributed dimension block is correctly generated by the transactions within the block and applied to the previous state, and whether the calculated global MPT root hash is consistent with the block header declaration and local record; where the verification node is a node in the verification network, used to receive blocks broadcast by block nodes, and uses a preset verification algorithm (such as transaction integrity verification, Merkle path verification, zero-knowledge proof verification, etc.) to check the correctness and consistency of the block content and state updates) to confirm that the incremental update of the transaction slice is indeed generated by the encrypted transaction data within the block and has been correctly applied to the global MPT state corresponding to the previous block, wherein the verification content is the node verification proof. Can the following information be correctly verified: Data consistency: This proves that all state incremental updates of this attributed dimension block do indeed originate from the encrypted transaction data contained within the attributed dimension block; state transition validity: This proves that these incremental updates were correctly applied to the original global MPT state corresponding to the previous attributed dimension block; computational correctness: The latest root hash set of the global MPT was correctly output;

[0085] S2.6, Verification nodes verify the zero-knowledge proof of the new block. The global MPT root hash set of the local ledger is used to determine the correctness and consistency of the attributed dimension block state transitions. The local ledger refers to a complete or partial record of the blockchain state stored locally by each node.

[0086] Specifically, determining the correctness and consistency of the state transition of the attributed dimension block involves: using the verification node to retrieve the global MPT root hash set of the previous attributed dimension block from the local ledger, verifying whether the original state root referenced by the zero-knowledge proof is consistent with the local record, and confirming that the latest global MPT root hash set declared in the header of the new attributed dimension block is consistent with the verification result of the zero-knowledge proof.

[0087] S2.7 If the state transition of the attributed dimension block is correct and consistent, the verification node confirms that the attributed dimension block is valid, updates the global MPT root hash set to the latest root hash set declared in the new attributed dimension block header, and submits the verification node's confirmation of the validity of the attributed dimension block to the blockchain network to participate in the consensus process.

[0088] S2.8. When the attributed dimension block is confirmed by the legal number or a preset proportion of the verification nodes in the blockchain network (in this embodiment, if the blockchain network has 100 verification nodes, the block is considered valid and the global state is updated when the attributed dimension block is confirmed by at least 67 verification nodes in the network; or, when the number of verification nodes confirming the attributed dimension block reaches a preset proportion (e.g., two-thirds) of the total number of nodes in the network, the block is considered valid and the global state is updated), that is, the attributed dimension block is the final determined block, and the verified attributed dimension block is recorded in the blockchain ledger state (i.e., written into the blockchain ledger); thus, the global state of the blockchain system is updated from the state corresponding to the previous block to the state corresponding to the new block, and serves as the trusted state benchmark for subsequent block processing.

[0089] When the on-chain verification unit 4 receives a query request, it performs integrity verification on the transaction data in the blockchain network.

[0090] In this embodiment, when the on-chain verification unit 4 receives a query request, it obtains the corresponding attributed dimension block from the blockchain network and performs integrity checks on the block header, data dimension area, and consistency proof area. At the same time, it uses a zero-knowledge proof verification algorithm to verify the correctness of the transaction data and its incremental updates in the global MPT. After the verification is successful, the transaction data and verification result are returned to ensure the integrity and credibility of the query data. If the verification fails, the transaction data is refused and the abnormal state is recorded.

[0091] The foregoing has shown and described the basic principles, main features, and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited to the above embodiments. The embodiments and descriptions in the specification are merely preferred examples and are not intended to limit the invention. Various changes and modifications can be made to the invention without departing from its spirit and scope, and all such changes and modifications fall within the scope of the claimed invention.

Claims

1. A tamper-proof storage system for property rights transaction data based on big data, characterized in that, include: Data acquisition and access unit (1) receives the original transaction data generated during the property rights transaction process, and performs formatting and identity authentication on the original transaction data to obtain the processed transaction data; The data encryption and storage unit (2) includes a data encryption module (21), a data storage module (22), and a key lifecycle management module (23); the data encryption module (21) uses the AES algorithm based on a temporary symmetric encryption key. The processed transaction data is encrypted to generate ciphertext. Generate post-quantum public keys using post-quantum cryptography key encapsulation mechanisms. and post-quantum private key and using the post-quantum public key The temporary symmetric encryption key Encryption is performed to obtain the encryption key. ; Call a secure random source to generate the master key Using the master key For the post-quantum private key Perform symmetric encryption to obtain the encrypted post-quantum private key. This initializes a quantum-resistant and evolvable key management system; the data storage module (22) submits the transaction data encrypted with the AES algorithm to the off-chain distributed storage system for storage, forming a distributed storage record, and the encryption key is then used to... Stored in the blockchain ledger, and the master key is also... The hash value is recorded in the blockchain; the key lifecycle management module (23) updates the temporary symmetric encryption key periodically based on the automated key evolution mechanism of blockchain consensus. and ciphertext ; The block generation and consensus unit (3) includes a block generation module (31) and a block consensus module (32). The block generation module (31) deconstructs the encrypted property rights transaction data into multiple attribute slices, submits each attribute slice to the corresponding global MPT, and records the incremental updates of all attribute slices in the block to the global MPT state in units of blocks, generates the corresponding Merkle path proof, and then constructs attributed dimension blocks based on the incremental updates. The attributed dimension blocks contain a data dimension area and a consistency proof area. The consistency proof area is composed of a data dimension area and a data dimension area. Block producers are generated using a zero-knowledge proof algorithm to prove that the incremental updates of all attribute slices originate from the transactions in this block and have been correctly applied to the global MPT. The block consensus module (32) broadcasts the attributed dimension blocks to the verification nodes of the blockchain network. The verification nodes call the verification algorithm to quickly verify the zero-knowledge proofs attached to the attributed dimension blocks and judge the correctness and consistency of the state transition of the attributed dimension blocks by comparing the zero-knowledge proofs with the global MPT root hash set of the local ledger. After the attributed dimension blocks are confirmed by a legal number of verification nodes, they are recorded in the state of the blockchain ledger. On-chain verification unit (4) verifies the integrity of transaction data in the blockchain network when it receives a query request.

2. The tamper-proof storage system for property rights transaction data based on big data as described in claim 1, characterized in that: The data acquisition and access unit (1) includes a data acquisition module and a data access module; The data acquisition module acquires the original transaction data generated during the property rights transaction process in real time and adds timestamps and source identifiers to the original transaction data. The data access module performs formatting and identity authentication on the collected raw transaction data.

3. The tamper-proof storage system for property rights transaction data based on big data as described in claim 1, characterized in that: The data encryption module (21) initializes a quantum-resistant and evolvable key management system to generate transaction data with composite encryption identifiers, including the following steps: S1.1, Call the key generator to generate a temporary symmetric encryption key. ; S1.2 Using the AES algorithm based on this temporary symmetric encryption key The processed transaction data is encrypted to generate ciphertext. And mark the encryption status; S1.

3. Generate a post-quantum public key using a post-quantum cryptography key encapsulation mechanism. and post-quantum private key ; S1.4, Using the post-quantum public key Temporary symmetric encryption key Encryption is performed to obtain the encryption key. ; S1.5, Generate the master key by calling a secure random source. Using the master key Post-quantum private key Perform symmetric encryption to obtain the encrypted post-quantum private key. .

4. The tamper-proof storage system for property rights transaction data based on big data as described in claim 3, characterized in that: The key lifecycle management module (23) periodically updates the temporary symmetric encryption key based on the automated key evolution mechanism of blockchain consensus. and ciphertext This includes the following steps: S1.6 Retrieve the original ciphertext from off-chain storage. And retrieve the encryption key from the chain. ; S1.7 Using the master key Decrypt the post-quantum private key Obtain the original post-quantum private key. Using post-quantum private keys Decryption encryption key Obtain the original temporary symmetric encryption key Using a temporary symmetric encryption key Decrypting the ciphertext To retrieve plaintext data from memory; S1.

8. Using a post-quantum cryptography key encapsulation mechanism, repeat steps S1.1 to S1.5 to generate a new post-quantum public key. Post-quantum private key and new temporary symmetric encryption key ; S1.9, Use the new temporary symmetric encryption key Encrypt plaintext data to generate new ciphertext. Replace the original ciphertext ; Utilizing the new post-quantum public key For the new temporary symmetric encryption key Encrypt and generate a new encryption key. Using the original master key Encrypting new post-quantum private keys Generate a new encrypted post-quantum private key .

5. The tamper-proof storage system for property rights transaction data based on big data as described in claim 1, characterized in that: The block generation module (31) constructs attributed dimension blocks, including the following steps: S2.1 Deconstruct the encrypted property rights transaction data into multiple attribute slices, submit each attribute slice to the corresponding global MPT, and at the same time, record the incremental updates of the global MPT state caused by all attribute slices in the block, and generate the corresponding Merkle path proofs, on a block-by-block basis. S2.2 Construct attributed dimension blocks based on incremental updates, wherein the attributed dimension blocks include data dimension blocks and consistency proof blocks; S2.

3. Generate a new attributed dimension block header based on the attributed dimension block.

6. The tamper-proof storage system for property rights transaction data based on big data as described in claim 5, characterized in that: The block consensus module (32) uses an attribute-based dimension block consensus mechanism to perform block consistency confirmation operations among multiple nodes, including the following steps: S2.4 The generated attributed dimension blocks are broadcast to all verification nodes of the blockchain network through the block-producing nodes in the blockchain network via a peer-to-peer network; S2.5, Invoke the verification algorithm to perform zero-knowledge proofs attached to the attributed dimension blocks. Perform rapid verification; S2.6, Verification nodes verify the zero-knowledge proof of the new block. Use the global MPT root hash set of the local ledger to determine the correctness and consistency of the state transitions of attributed dimension blocks; S2.7 If the state transition of the attributed dimension block is correct and consistent, the verification node confirms that the attributed dimension block is valid, updates the global MPT root hash set to the latest root hash set declared in the new attributed dimension block header, and submits the verification node's confirmation of the validity of the attributed dimension block to the blockchain network to participate in the consensus process. S2.8 Once the attributed dimension block receives confirmation from a legally valid number of verification nodes in the blockchain network, the attributed dimension block becomes the final determined block, and the verified attributed dimension block is recorded in the blockchain ledger status.

7. The tamper-proof storage system for property rights transaction data based on big data as described in claim 6, characterized in that: In S2.6, determining the correctness and consistency of the state transition of the attributed dimension block specifically involves: using the verification node to retrieve the global MPT root hash set of the previous attributed dimension block from the local ledger, verifying whether the original state root referenced by the zero-knowledge proof is consistent with the local record, and confirming that the latest global MPT root hash set declared in the header of the new attributed dimension block is consistent with the verification result of the zero-knowledge proof.

8. The tamper-proof storage system for property rights transaction data based on big data as described in claim 1, characterized in that: When the on-chain verification unit (4) receives a query request, it obtains the corresponding attributed dimension block from the blockchain network and performs integrity checks on the block header, data dimension area and consistency proof area. At the same time, it uses a zero-knowledge proof verification algorithm to verify the correctness of the transaction data and its incremental updates in the global MPT. After the verification is successful, the transaction data and verification result are returned. If the verification fails, the transaction data is refused and the abnormal state is recorded.

Images