A post-quantum editable blockchain method and related device supporting full staff decision and auditing

Abstract

The application discloses a kind of support full staff decision and auditing post quantum editable block chain method and related equipment, this scheme gives the security efficient chameleon hash function based on lattice, and designs a kind of full staff decision and auditing post quantum editable block chain architecture based on the function, only one member has complete editing trap in the architecture, every time editing history block, all staff need to vote;Editor can only edit history block after obtaining a certain number of votes;Other members can verify the edited block.The scheme can solve the problem of centralized editing authority and quantum security vulnerability in editable block chain, so that all participants can jointly decide whether to modify a certain history block, and can verify the modified block, to realize full staff decision and auditing post quantum editable block chain.

Description

Technical Field

[0001] This invention relates to the field of information security technology, and in particular to blockchain solutions. Background Technology

[0002] The immutability of blockchain is one of its core characteristics, effectively guaranteeing the reliability and integrity of historical data. However, the immutability of blockchain data is not absolute. In certain special circumstances (such as program vulnerabilities in blockchain application platforms, errors in historical records, or malicious data), it becomes necessary to correct problematic historical records. To address this need, researchers have proposed an editable blockchain architecture based on the chameleon hash function. This architecture allows for the editing or deletion of on-chain data under specific conditions, thus providing a flexible solution for handling erroneous records or malicious data.

[0003] Chameleon hash (CH) allows users with trapdoor keys to efficiently solve for collisions in input data, meaning that input data can be modified while keeping the hash value unchanged. Since its inception in 2000, most CHs have relied on traditional number theory assumptions and are therefore vulnerable to quantum attacks. As exceptions, in 2021, Wu et al. proposed two lattice-based CHs based on the general group model and the random oracle model, respectively; in 2020, Derler et al. presented a general construction of quantum-resistant CHs using simulated reliable extractable non-interactive zero-knowledge proofs (SSE-NIZK) and non-interactive commitment schemes, and instantiated it based on the learned parity problem (LPN); in 2024, Li et al. proposed label-based chameleon hash (TCH) and constructed two lattice-based TCHs under the standard model and the random oracle model, respectively. These schemes are effectively resistant to quantum attacks.

[0004] Furthermore, for editable blockchains, centralized editing permissions can easily trigger malicious editing or single points of failure. To address this, researchers have proposed decentralized editable blockchains, with three main technical implementation paths currently existing: (1) A policy-based chameleon hash (PCH) is adopted, in which one or more trusted centers (CAs) generate trapdoor keys and then allocate corresponding trapdoors according to the user's attributes. Finally, only users who meet the access policy can perform editing operations. (2) Using a threshold chameleon hash function, the trapdoor of the chameleon hash function is secretly shared among a specific group. Only users with a certain amount (threshold) can cooperate to recover the trapdoor. (3) A chameleon hash function with multiple trapdoors is used. Multiple users have their own trapdoor keys and each user has editing permissions. Finally, a voting method is used to determine the user who actually performs the editing.

[0005] However, existing quantum-resistant chameleon hash functions each have their drawbacks: Wu et al.'s scheme has security proof issues; Derler et al.'s scheme relies on complex cryptographic tools (SSE-NIZK), resulting in high computational overhead; Li et al.'s scheme requires introducing an additional tag for each block, and each block's tag must be unique. Therefore, there is currently a lack of directly constructible, efficient, secure, quantum-resistant chameleon hash functions.

[0006] Furthermore, existing decentralized editable blockchain solutions also have their own drawbacks, as follows: (1) Policy-based Chameleon Hash Function (PCH) route: Trapdoor keys need to be generated and distributed by a trusted central CA, which does not achieve complete decentralization, and in some permissionless blockchain systems, it is difficult to specify such an entity CA; (2) Threshold Chameleon Hash Function Route: It adopts a secure multi-party computation mode, which requires a lot of interaction between users and has high communication complexity; (3) Chameleon hash function route with multiple trapdoors: Multiple users have independent trapdoors, which expands the attack surface, provides attackers with more attack targets, and increases the risk of trapdoor leakage. Summary of the Invention

[0007] To address the problems existing in existing editable blockchain architecture schemes based on chameleon hash functions, the present invention aims to provide a post-quantum editable blockchain method that supports decision-making and review by all members. This scheme constructs a secure and efficient chameleon hash function based on lattices, and builds a post-quantum editable blockchain architecture with decision-making and review by all members based on this function, thereby solving the problem of centralized editing permissions.

[0008] To achieve the above objectives, this invention provides a post-quantum editable blockchain method that supports full participation decision-making and review. The method is based directly on lattice design under a random oracle model, using trapdoors in the lattice and a hash-and-sign pattern framework to construct a post-quantum chameleon hash function CH, and based on the post-quantum chameleon hash function CH, constructs a post-quantum editable blockchain architecture with full participation decision-making and review. The post-quantum editable blockchain architecture with full participation decision-making and review includes three entities: the editor, the consortium chain members, and the leader node. The editor is configured to be responsible for system initialization and generating parameters for the post-quantum chameleon hash function CH; and the editor has a CH trapdoor key for block rewriting, enabling modification of block content; The consortium blockchain members are configured to generate and publish corresponding transactions, and when an editor issues an edit request for a block, the consortium blockchain members vote internally to confirm whether to agree to the edit; the consortium blockchain members can review and verify the edited block. The leader node is configured to use the CH parameters published by the editor to package transactions in the network and generate blocks.

[0009] Furthermore, the post-quantum chameleon hash function CH is constructed as follows: ① First, run the trapdoor generation algorithm. Randomly select a matrix ,calculate ;make It is a hash function. It outputs the hash key. and trapdoor key ; ② Random sampling ,make ,calculate Calculate the chameleon's hash value: ; Output Chameleon Hash Value and random numbers ; ③ According to the news and random numbers Calculate the chameleon hash value And output; ④ First, split it. ,make ,calculate ,verify Check if the condition is true. Output 1 if true, otherwise output 0. ⑤ First, execute the verification algorithm. If the verification fails, the algorithm terminates; if the verification passes, random sampling is performed first. ,make ,calculate Then run the algorithm. ,satisfy The final output is a random number. .

[0010] Furthermore, in the method, when initializing system parameters, the editor first runs the CH key generation algorithm. Generate hash key and trapdoor key The editor then saves the trapdoor key themselves. , hash key Broadcast to other members in the consortium blockchain.

[0011] Furthermore, the method includes the following when creating a block: (1) After collecting transactions in the blockchain network, the leader node first parses the previous block. block header ; (2) Execution algorithm Generate the previous block hash value and set ; (3) Execution algorithm Generate blocks hash value and random numbers Then generate the block and hash value Broadcast; (4) Received block and hash value Then, the other members execute the algorithm. Verify block hash value If the result is 1, it is broadcast to the blockchain network; otherwise, it is rejected.

[0012] Furthermore, in this method, when editing a block, the editor first initiates an edit request, requesting that a certain historical block be edited. Content Change to ; Next, after receiving the edit request, the members of the consortium blockchain vote, sign the edit request, and broadcast the signature. If the editor then obtains more than the preset number of votes, it is considered that the consortium blockchain agrees to edit the historical block, and the editor uses the CH trapdoor key held by him to edit the historical block; Finally, members of the consortium blockchain can review and verify the edited blocks.

[0013] Furthermore, the historical block editing process described in the method includes: First, the editor performs this task. ,generate Corresponding random number Among them, blocks The block header content is from Change to The corresponding hash value is still ; Then broadcast by the editor Voting by consortium blockchain users And the signatures for these two pieces of content.

[0014] Furthermore, the method for performing block verification includes: (S1) Consortium blockchain users first verify the editor's signature and user votes. If the verification is successful, it means that the editor has obtained the rights to the block. Editing permission; (S2) Execute the verification algorithm The successful verification indicates that the editor has approved the block. The editing was performed correctly and effectively; (S3) If both steps (S1) and (S2) pass the verification, the modified historical block is recorded and marked. The marked content includes all the information broadcast by the editor in the previous step.

[0015] To achieve the above objectives, the present invention also provides a computer-readable storage medium having a program stored thereon that, when executed by a processor, implements the steps of the post-quantum editable blockchain method that supports decision-making and review by all stakeholders.

[0016] To achieve the above objectives, the present invention also provides a processor for running a program that, when running, executes the steps of the post-quantum editable blockchain method that supports decision-making and review by all members.

[0017] To achieve the above objectives, the present invention also provides a terminal device, the device including a processor, a memory, and a program stored in the memory and executable on the processor, the program being loaded and executed by the processor to implement the steps of the post-quantum editable blockchain method that supports decision-making and review by all members.

[0018] To achieve the above objectives, the present invention also provides a computer program product that, when executed on a data processing device, is adapted to perform the steps of the post-quantum editable blockchain method that supports decision-making and review by all stakeholders.

[0019] The post-quantum editable blockchain solution provided by this invention, which supports decision-making and review by all participants, has the following beneficial effects: (1) The quantum-resistant chameleon hash function provided in this invention is simple and efficient, without the need for complex cryptographic tools or the introduction of additional restrictions; (2) The present invention is based on an editable blockchain architecture designed by the chameleon hash function. It does not require a dedicated trusted center or a complex secure multi-party computation method. In addition, only the editor has the complete trapdoor key in this architecture, which reduces the trapdoor exposure points. At the same time, by setting up a voting process, the editor's editing behavior is supervised by all members, which effectively ensures the security of blockchain content editing. Attached Figure Description

[0020] The present invention will be further described below with reference to the accompanying drawings and specific embodiments.

[0021] Figure 1 This is a schematic diagram of the framework principle of the editable blockchain architecture that supports decision-making and review by all members in this invention.

[0022] Figure 2 This is a simplified diagram of the blockchain structure in this invention.

[0023] Figure 3 This is a block in the present invention. Example image of editing operation. Detailed Implementation

[0024] To make the technical means, creative features, objectives and effects of this invention easier to understand, the invention will be further described below with reference to specific illustrations.

[0025] To address the issues of centralized editing permissions and quantum security vulnerabilities in editable blockchains, this invention proposes a secure and efficient chameleon hash function based on a lattice. Based on this function, a post-quantum editable blockchain architecture with full participation decision-making and review is constructed. In this architecture, only one member (the editor) possesses the complete edit trapdoor. Each time a historical block is edited, a vote from all members is required. The editor can only edit a historical block after obtaining a certain number of votes. Other members can review and verify the edited block. This post-quantum editable blockchain architecture enables all participants to jointly decide whether to modify a historical block and to review and verify the modified block, achieving a post-quantum editable blockchain with full participation decision-making and review.

[0026] To facilitate the description and understanding of the present invention, the cryptographic concepts involved in the present invention will be explained first.

[0027] Grid cipher: Grid is Discrete additive subgroups, given a group of... linearly independent A matrix composed of dimensional vectors ,Depend on Defined Vig is: ; Given a random matrix There exists a The metalattice and a lattice coset are defined as follows: ; ; Lemma 1 (Trapdoor Generation): The algorithm is a probabilistic multinomial-time algorithm for generating good basis functions of lattices. The algorithm's input parameters are... ,in Output a matrix Passive A good base ,in Statistically close to The uniform distribution.

[0028] Lemma 2 (Preimage Sampling): make It is grid A good foundation, It is in vectors on and There exists a probabilistic multinomial-time algorithm. This algorithm can utilize the good basis in the lattice to obtain data from statistically close values. Output a vector from the distribution. ,satisfy .

[0029] Definition 1: Short Integer Solution (SIS) Problem: Given a matrix , The goal of the problem is to find a non-zero integer vector. And satisfy as well as .

[0030] Chameleon hash function: A family of chameleon hash functions includes three algorithms. The definition is as follows: This algorithm is a key generation algorithm; input security parameters... Output hash key Trapdoor Key

[0031] This algorithm is a hash algorithm; the input is a hash key. information Output Chameleon Hash Value and random numbers .

[0032] This algorithm is a hash recalculation algorithm; the input hash key is... information random numbers Output the chameleon hash value .

[0033] This algorithm is a hash verification algorithm; the input hash key is... Chameleon hash value information and random numbers Output bits The value is 1 if the verification passes, and 0 otherwise.

[0034] This algorithm is a collision extraction algorithm, and the input trapdoor key is... Chameleon hash value ,information and random numbers And another message Output Corresponding random number ,satisfy .

[0035] At the same time, a secure chameleon hash function must satisfy the following two properties: Collision resistance: The adversary does not know the trapdoor key. In the case of a given message random numbers Output random numbers satisfy The probability is negligible.

[0036] Semantic safety: for any message hash value and The probability distribution of is computationally indistinguishable. In particular, for randomly selected Unable to obtain from hash value Get any information about Information.

[0037] The present invention proposes a post-quantum chameleon hash function CH based on the short integer solution (SIS) problem in the random oracle model. Without relying on complex cryptographic tools (such as SSE-NIZK) or introducing additional restrictions (such as one-time labeling), the function is directly based on lattice design and utilizes the trapdoor in the lattice and the hash-and-sign technical framework to enable users with lattice trapdoors to efficiently solve collisions, which is both efficient and quantum secure.

[0038] Specifically, the post-quantum chameleon hash function CH is constructed as follows: ① First, run the trapdoor generation algorithm. Randomly select a matrix ,calculate ;make It is a hash function. It outputs the hash key. and trapdoor key .

[0039] ② Random sampling ,make ,calculate Calculate the chameleon's hash value: ; Output Chameleon Hash Value and random numbers .

[0040] ③ According to the news and random numbers Calculate the chameleon hash value And output it.

[0041] ④ First, split it. ,make ,calculate ,verify Check if the condition is true. If true, output 1; otherwise, output 0.

[0042] ⑤ First, execute the verification algorithm. If the verification fails, the algorithm terminates. If the verification passes, random sampling is performed first. ,make ,calculate Then run the algorithm. ,satisfy The final output is a random number. .

[0043] The post-quantum chameleon hash function CH formed based on the above scheme is efficient and quantum-safe, as detailed below: Collision resistance analysis: For ,if The problem is difficult, therefore the chameleon hash function proposed in this invention is collision-resistant under the random oracle model. The specific analysis is as follows: Assumption It is a probabilistic multinomial adversary capable of breaking the collision resistance of the chameleon hash function mentioned above. use Ability to solve The problem is to calculate... , satisfy Given a matrix As Examples of problems The operation is as follows: Initialization phase: Randomly select matrix ,calculate ,Will Give to the enemy . Initialization list This is used to store hash value query results. Let... For random oracles The range of values.

[0044] Random Oracle Query Phase: When the adversary Ask about input When the hash value is obtained, First, query the list. Does the record exist? If it exists, return . Conversely, random selection is used. ,Will Return to and update the list. .

[0045] Collision query phase: When the opponent Inquire about During a collision, First, select uniformly and randomly. ,make It can be known that The probability is ;Then Random selection Set hash value Update list Then Return to the enemy .

[0046] Forgery Stage: Ultimately, the Enemy Output a pair of chameleon hash collisions ,satisfy , in .

[0047] Transforming the above equation, we get: ; because ,and , can be obtained Therefore, the SIS problem is solved. However, this assumption is incorrect, thus proving by contradiction that the chameleon hash function proposed in this invention satisfies collision resistance.

[0048] Semantic security analysis: Chameleon hash value According to the rejection sampling algorithm, for , The distribution is ,therefore The distribution statistics are close to And conditional entropy Statistics are close to Therefore, the chameleon hash function proposed in this invention satisfies semantic security.

[0049] As a supplementary explanation, the meanings of the relevant parameters in the post-quantum chameleon hash function CH given here are the same as above.

[0050] This invention, based on the aforementioned post-quantum chameleon hash function CH, constructs a post-quantum editable blockchain architecture that supports decision-making and review by all participants. For example... Figure 1 As shown, the post-quantum editable blockchain architecture that supports decision-making and review by all members, as presented in this invention, consists of three entities: the editor, the consortium blockchain members, and the leader node.

[0051] The editor is specifically configured to be responsible for system initialization and generating the parameters of the post-quantum chameleon hash function CH; the editor also has the CH trapdoor key for block rewriting, which enables modification of block content.

[0052] As members of the consortium blockchain, consortium blockchain members are configured to generate and publish corresponding transactions. When an editor issues an edit request for a block, consortium blockchain members will conduct an internal vote to confirm whether to agree to the edit. Furthermore, consortium blockchain members can review and verify the edited block.

[0053] The leader node is configured to use the CH parameters published by the editor to package transactions in the network and generate blocks.

[0054] Furthermore, in the editable blockchain architecture formed here, only the editor has the permission to modify blocks, and the editor's editing behavior is supervised by all members of the consortium blockchain. The scheme for implementing blockchain editing based on this is as follows: In this editable blockchain architecture, when it is necessary to edit a certain historical block, the editor first initiates an edit request; Next, after receiving the edit request, the members of the consortium blockchain vote on it, that is, they sign the edit request and broadcast the signature. Next, if the editor obtains more than a preset number of votes (e.g., more than 2 / 3 of the number of consortium chain members), it is considered that the consortium chain agrees to edit the historical block; at that time, the editor uses the CH trapdoor key to edit the historical block; Finally, the edited blocks are reviewed and verified by the members of the consortium blockchain.

[0055] The post-quantum editable blockchain architecture based on the above scheme, which supports decision-making and review by all members, eliminates the need for a trusted central CA (Certified Authority) or secret sharing of trapdoor keys or the establishment of multiple independent trapdoors, effectively solving the problem of centralized editing permissions. Furthermore, in this architecture, only one member (the editor) possesses the complete editing trapdoor, and each time a historical block is edited, a vote by all members is required. The editor can only edit a historical block after obtaining a certain number of votes. Other members can review and verify the edited block, effectively ensuring the security of blockchain content editing. In addition, this blockchain is resistant to quantum attacks.

[0056] The following section, in conjunction with the post-quantum editable blockchain architecture scheme supporting full participation in decision-making and review provided by this invention, specifically illustrates the implementation scheme for editing historical blocks based on the post-quantum editable blockchain architecture provided by this invention.

[0057] Combination Figure 1 As shown, the implementation scheme for block creation and historical block editing based on the post-quantum editable blockchain architecture given in this invention specifically includes the following 8 steps: Step 1: Initialize system parameters.

[0058] (1.1) The editor first runs CH's key generation algorithm. Generate hash key and trapdoor key ; (1.2) The editor keeps the trapdoor key himself. , hash key Broadcast to other members in the consortium blockchain.

[0059] After initialization, this ensures that only the editor has the complete trapdoor key in the architecture, reducing the number of trapdoor exposure points.

[0060] Step 2: Publish the transaction.

[0061] In this step, the consortium blockchain members generate the corresponding transactions and publish them to the blockchain network.

[0062] Step 3: Create blocks.

[0063] See Figure 2 The blocks involved here It includes a block header and a block body. The block header includes the hash value of the previous block. Merkle roots And chameleon random numbers ,in use Calculated.

[0064] Furthermore, this step is specifically implemented during block creation through the following steps: (3.1) After collecting transactions in the blockchain network, the leader node first parses the previous block. block header ; (3.2) Execution Algorithm Generate the previous block hash value and set ; (3.3) Execution Algorithm Generate blocks hash value and random numbers Then generate the block and hash value Broadcast; (3.4) Received block and hash value Then, the other members execute the algorithm. Verify block hash value If the result is 1, it is broadcast to the blockchain network; otherwise, it is rejected.

[0065] The above scheme uses the chameleon hash function instead of the ordinary hash function to generate the hash value of the block when creating the block, which can provide a technical channel for subsequent editing operations.

[0066] Step 4: Initiate an edit request.

[0067] When editing a specific historical block, the editor initiates an edit request. Request to save a certain historical block Content Change to The editor first responds to the editing request. Obtain by signing Then broadcast For consortium blockchain users.

[0068] Step 5: Voting phase.

[0069] After receiving an edit request, if a consortium blockchain user agrees to the changes, then... Sign and broadcast.

[0070] Since signatures serve as identity authentication, this step involves consortium blockchain members providing their signatures to indicate their agreement to the modifications, thereby ensuring the validity of the vote.

[0071] Step 6: Obtain the voting results.

[0072] If the editor collects more than a certain number (e.g., quantity) The user's signature indicates that they have permission to access the block. Edit and sign user's name Then the editor broadcast this A signature, recorded as .

[0073] This section utilizes the solutions from steps 5 and 6 to construct a voting process, ensuring that the editors' editing activities are subject to full supervision and effectively guaranteeing the security of blockchain content editing.

[0074] Step 7: Edit the transaction block.

[0075] See Figure 3 This step involves editing the transaction block using the following method: (7.1) Editor's Execution ,generate Corresponding random number Block The block header content is from Change to The corresponding hash value is still .

[0076] (7.2) Editor Broadcast Voting by consortium blockchain users And the signatures for these two pieces of content.

[0077] Step 8: Verify the changed block.

[0078] This step completes the block modification verification using the following method: (8.1) Consortium blockchain users first verify the editor's signature and user votes. If the verification is successful, it means that the editor has obtained the rights to the block. Editing permission; (8.2) Execute the verification algorithm The successful verification indicates that the editor has approved the block. The editing was performed correctly and effectively; (8.3) If both of the above steps are verified, the modified historical block is recorded and marked. The marked content includes all the information broadcast by the editor in the previous step.

[0079] By following the steps outlined above to verify changes to blocks, the validity and correctness of the edits can be ensured.

[0080] As can be seen from the above implementation scheme, the post-quantum editable blockchain architecture scheme that supports decision-making and review by all members provided by this invention does not require setting up a dedicated trusted center, nor does it require adopting a complex secure multi-party computation method; in addition, only the editor has the complete trapdoor key in this architecture, reducing the trapdoor exposure points; at the same time, by setting up a voting process, the editor's editing behavior is subject to supervision by all members, effectively ensuring the security of blockchain content editing.

[0081] Based on the above-mentioned post-quantum editable blockchain architecture scheme that supports decision-making and review by all members, this embodiment of the invention also provides a computer-readable storage medium storing a program thereon, which, when executed by a processor, implements the steps of the above-mentioned post-quantum editable blockchain method that supports decision-making and review by all members.

[0082] This invention also provides a processor for running a program, wherein the program executes the steps of the post-quantum editable blockchain method that supports decision-making and review by all members.

[0083] This invention also provides a terminal device, which includes a processor, a memory, and a program stored in the memory and executable on the processor. The program code is loaded and executed by the processor to implement the steps of the post-quantum editable blockchain method that supports decision-making and review by all members.

[0084] The present invention also provides a computer program product, which, when executed on a data processing device, is adapted to perform the steps of the above-described post-quantum editable blockchain method that supports decision-making and review by all stakeholders.

[0085] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0086] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and modules described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0087] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0088] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0089] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0090] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0091] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0092] Memory may include non-persistent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, like read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0093] Computer-readable media, including both permanent and non-permanent, removable and non-removable media, can store information using any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0094] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0095] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0096] The method, specific system unit, or part thereof of the present invention described above is a pure software architecture. It can be deployed via program code on physical media, such as hard disks, optical discs, or any electronic device (such as smartphones or computer-readable storage media). When a machine loads and executes the program code (e.g., a smartphone loads and executes it), the machine becomes a device for implementing the present invention. The method and device of the present invention can also be transmitted in program code form via transmission media, such as cables, optical fibers, or any other transmission method. When the program code is received, loaded, and executed by a machine (e.g., a smartphone), the machine becomes a device for implementing the present invention.

[0097] 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 illustrative of the principles of 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 present invention as claimed. The scope of protection of this invention is defined by the appended claims and their equivalents.

Claims

1. A post-quantum editable blockchain method supporting decision-making and review by all members, characterized in that, The method directly uses a lattice-based design under a random oracle model, employing trapdoors in the lattice and a hash-and-sign pattern framework to construct the post-quantum chameleon hash function CH. Based on this post-quantum chameleon hash function CH, a post-quantum editable blockchain architecture with full participation decision-making and review is constructed. This architecture includes three entities: the editor, consortium blockchain members, and the leader node. The post-quantum chameleon hash function CH is constructed as follows: ① First, run the trapdoor generation algorithm. Randomly select a matrix ,calculate ;make It is a hash function that outputs the hash key. and trapdoor key ; ② Random sampling ,make ,calculate ; Calculate the chameleon hash value: ； Output Chameleon Hash Value and random numbers ; ③ According to the news and random numbers Calculate the chameleon hash value And output; ④ First, split it. ,make ,calculate ,verify Check if the condition is true; if true, output 1, otherwise output 0. ⑤ First, execute the verification algorithm. If the verification fails, the algorithm terminates; if the verification passes, random sampling is performed first. ,make ,calculate Then run the algorithm. ,satisfy The final output is a random number. ; The editor is configured to be responsible for system initialization and generating parameters for the post-quantum chameleon hash function CH; and the editor has a CH trapdoor key for block rewriting, enabling modification of block content; The consortium blockchain members are configured to generate and publish corresponding transactions, and when an editor issues an edit request for a block, the consortium blockchain members vote internally to confirm whether to agree to the edit; the consortium blockchain members can review and verify the edited block. The leader node is configured to utilize the CH parameters published by the editor to package transactions in the network and generate blocks; during block creation, this includes: (1) After collecting transactions in the blockchain network, the leader node first parses the previous block. block header ; (2) Execution algorithm Generate the previous block hash value and set ; (3) Execution algorithm Generate blocks hash value and random numbers Then generate the block and hash value Broadcast; (4) Received block and hash value Then, the other members execute the algorithm. Verify block hash value If the result is 1, it is broadcast to the blockchain network; otherwise, it is rejected.

2. The post-quantum editable blockchain method according to claim 1, characterized in that, In this method, during system parameter initialization, the editor first runs the CH key generation algorithm. Generate hash key and trapdoor key The editor then saves the trapdoor key themselves. , hash key Broadcast to other members in the consortium blockchain.

3. The post-quantum editable blockchain method according to claim 1, characterized in that, In this method, when editing a block, the editor first initiates an edit request, requesting that a certain historical block be edited. Content Change to ; Next, after receiving the edit request, the members of the consortium blockchain vote, sign the edit request, and broadcast the signature. If the editor then obtains more than the preset number of votes, it is considered that the consortium blockchain agrees to edit the historical block, and the editor uses the CH trapdoor key held by him to edit the historical block; Finally, members of the consortium blockchain can review and verify the edited blocks.

4. The post-quantum editable blockchain method according to claim 3, characterized in that, The method for editing historical blocks includes: First, the editor performs this task. ,generate Corresponding random number Among them, blocks The block header content is from Change to The corresponding hash value is still ; Then broadcast by the editor Voting by consortium blockchain users And the signatures for these two pieces of content.

5. The post-quantum editable blockchain method according to claim 3, characterized in that, The method for modifying block verification includes: (S1) Consortium blockchain users first verify the editor's signature and user votes. If the verification is successful, it means that the editor has obtained the rights to the block. Editing permission; (S2) Execute the verification algorithm The successful verification indicates that the editor has approved the block. The editing was performed correctly and effectively; (S3) If both steps (S1) and (S2) pass the verification, the modified historical block is recorded and marked. The marked content includes all the information broadcast by the editor in the previous step.

6. A computer-readable storage medium having a program stored thereon, characterized in that, When the program is executed by the processor, it implements the steps of the post-quantum editable blockchain method that supports full participation in decision-making and review as described in any one of claims 1-5.

7. A terminal device, comprising a processor, a memory, and a program stored in the memory and executable on the processor, characterized in that, The program is loaded and executed by the processor to implement the steps of the post-quantum editable blockchain method supporting full participation decision-making and review as described in any one of claims 1-5.

8. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the steps of the post-quantum editable blockchain method that supports full participation in decision-making and review as described in any one of claims 1-5.

Images