An anonymous reporting and transaction modification method based on editable blockchain architecture

Abstract

This application relates to an anonymous reporting and transaction modification method based on an editable blockchain architecture. The blockchain comprises user nodes, management nodes, supervisor nodes, and secretary nodes. The editable blockchain operates through a query phase, an anonymous review phase, and a data modification phase, enabling transaction query, transaction reporting, and post-report modification. This application implements an editable blockchain solution that supports multi-party constraints and anonymity, while enabling reporters to balance anonymity and declarativeness, while avoiding the single point of failure inherent in centralized databases.

Description

Technical Field

[0001] The present application relates to the field of blockchain technology, and in particular to an anonymous reporting and transaction modification method based on an editable blockchain architecture. Background Art

[0002] Traditional grade management systems typically rely on centralized architectures. With the expansion of computer networks and the explosive growth of data volumes, these architectures face increasing security threats and data management pressures. Frequent network attacks and system overloads often lead to system crashes and data inaccessibility. In fact, centralized grade management systems are gradually becoming obsolete.

[0003] Blockchain technology can achieve decentralization, but it may also cause some negative problems due to the nature of data that cannot be tampered with: (1) When malicious users store harmful information that cannot be deleted in the blockchain, it may cause adverse effects; (2) When there are errors in the recorded data, they cannot be corrected, resulting in the long-term existence of erroneous information; (3) The data written to the blockchain cannot be deleted, which is not in line with the needs of citizens to exercise their right to be forgotten about their private information.

[0004] Blockchains already have editable solutions. The core concept is to replace traditional hash functions with chameleon hash functions, allowing authorized users with trapdoor keys to controllably modify blockchain content while maintaining the linkability of the original blockchain data structure. In recent years, researchers have used multi-center attribute encryption to address the issue of over-centralized editing authority. However, the complexity of attribute encryption increases the difficulty of implementing these solutions. Furthermore, due to the public transparency of blockchain information, the identity of the applicant who requested editing becomes highly sensitive information in a blockchain-based grade management system. This requires verifying the legitimacy of the application while protecting the applicant's privacy. Furthermore, when identity verification is required, the applicant who requested editing should also have the right to reveal their identity to fulfill their legitimate rights and interests. Therefore, the ability of the applicant to manage the concealment and disclosure of their identity is a crucial factor in maintaining an editable blockchain-based grade management system. However, existing technologies still lack relevant information regarding the concealment and disclosure of the identity of the applicant who requested editing. Summary of the Invention

[0005] The present invention provides a performance management method based on an editable blockchain, which is used to implement an editable blockchain solution that supports multi-party constraints and has anonymity.

[0006] The technical solution of this application is as follows:

[0007] An anonymous reporting and transaction modification method based on an editable blockchain architecture,

[0008] This method is implemented based on an editable blockchain, which includes user nodes, management nodes, supervisor nodes, and secretary nodes. The operation of the editable blockchain includes a query phase, an anonymous review phase, and a data modification phase.

[0009] The query phase is the initial phase, and the following steps are performed:

[0010] Inspect nodes with safety parameters Run for input Function and output common parameters ; Then run the trapdoor generation algorithm to generate a hash key pair - , and and Broadcast to the blockchain;

[0011] User nodes, management nodes, and secretary nodes receive Afterwards, Run the key generation algorithm for the input to generate public and private key pairs respectively , , , and broadcast the public key in the blockchain; i Indicates the sequence number of the user node, l Indicates the serial number of the management node, t Indicates the serial number of the secretary node;

[0012] Management nodes and Run the hash algorithm on the input and output the Hash value and a random string , and then broadcast it to the blockchain , generate the original transaction;

[0013] After receiving the original transaction, the secretary node and identity information Run the validation algorithm for the input, verifying effectiveness;

[0014] For a valid raw transaction, the user node lists the public keys , signer's private key and As input, a ring signature algorithm is run to generate a signature for the anonymous review phase. And send it to the review team composed of management nodes, supervision nodes and secretary nodes;

[0015] When a transaction in the anonymous review phase needs to be modified, it enters the transaction modification phase;

[0016] During the transaction modification phase:

[0017] Inspection nodes News For input, run the review-temporary trapdoor generation algorithm to generate a temporary trapdoor , and Send to secretary node;

[0018] at the same time,

[0019] Management nodes and Run the review-signature algorithm on the input to generate a new signature , and Send to secretary node;

[0020] Secretary node As input, run the review-modification algorithm to generate a new random number , thereby generating a modified transaction;

[0021] When the transaction modification is published: the user node 、 and As input, use the declaration algorithm to output declarations The review team For input, use the claim verification algorithm to verify the claim If the verification is successful, the identity information of the user node will be disclosed; otherwise, the user node will remain anonymous; or no operation will be performed;

[0022] After receiving the modified transaction notification: each node in the review team As input, a review-verification algorithm is run to verify the validity of the transaction.

[0023] Furthermore, during the anonymous review phase, Run the ring signature chaining algorithm for the input to determine whether it is a duplicate report. If the output is 0, it means Is a new report; if the output is 1, it means For duplicate reporting.

[0024] Furthermore, in the transaction modification phase, after each node in the review team verifies that the transaction is valid, it indicates that the transaction modification is valid.

[0025] Furthermore, the public parameters are output in the query phase The process is:

[0026] With safety parameters As input, we select two orders of The multiplicative cyclic group of and its corresponding generator and , construct a bilinear map as ;

[0027] Choose four hash functions and pseudo-random generators ;

[0028] run Returns public parameters after the algorithm and ;

[0029] In the query phase, the key generation algorithm generates a public and private key pair respectively. ， ， The process is: As input, run:

[0030] Initialize a signing key pair ( , );in, Represents a user node;

[0031] Initialize the ring signature key pair ;

[0032] by As input, run:

[0033] Initialize the pseudo-random function key k .

[0034] Furthermore, the ring signature algorithm is run to generate a signature for the anonymous review phase. This process is run by the user node that submits the anonymous review, as follows:

[0035] Enter a public key list in the ring signature algorithm , a private key and news ;in ;

[0036] calculate = ;

[0037] Random selection And calculate ;

[0038] For every Choose one and calculate ;

[0039] calculate Assuming a ring signature ;

[0040] run Generate a random number As a signature random number;

[0041] run Generate a standard digital signature ;

[0042] run Generate a random number As a commitment random number;

[0043] run Generate Commitment ;

[0044] Use the verification algorithm to verify the above signature The specific process is as follows:

[0045] calculate (L) ,calculate ;

[0046] if Then calculate ;

[0047] if Then output 1; otherwise output 0.

[0048] Furthermore, the algorithm output statement The process is as follows:

[0049] by For input, run Algorithmic calculation ;

[0050] by For input, run Algorithmic calculation ;

[0051] by For input, run Algorithmic calculation ;

[0052] Get statement ;

[0053] Verify the claim using the claim verification algorithm The specific process is as follows:

[0054] by For input, Calculation in the algorithm ,as well as,

[0055] by For input, In the algorithm, whether the calculation result is 1;

[0056] When both of the above judgments are yes, then the statement Valid; otherwise, invalid.

[0057] Furthermore, during the transaction modification phase:

[0058] Review - Temporary Trapdoor Generation Algorithm Generates Temporary Trapdoors The specific process is as follows:

[0059] enter , triples as well as After that, calculate , output temporary trapdoor and a new random number ,in Indicates the identity of the editor. Represents the root hash value of the Merkle tree;

[0060] The secretary node runs the review-modification algorithm process as follows:

[0061] run as well as To verify the triple and signature Correctness;

[0062] When the verification is correct, As input, calculate , and output a new random number , then run Generate a signature for a new random number ;

[0063] The process of each node in the review team running the review-verification algorithm is as follows:

[0064] by For input, run Determine whether the result is 1;

[0065] by For input, run Determine whether the result is 1;

[0066] by For input, run Determine whether the result is 1;

[0067] by For input, run Determine whether the result is 1;

[0068] Calculated and verified in , in the Merkle tree Is it consistent?

[0069] If they are consistent, the output is 1 to indicate that the verification is successful. If not, the output is 0 to indicate that the verification is failed.

[0070] Due to the adoption of the above technical solution, the beneficial effects of this application are as follows:

[0071] This application proposes two blockchain data editing mechanisms, one is a basic editing mechanism and the second is an advanced editing mechanism.

[0072] 1. In the basic editing mechanism, user nodes can query transactions and raise objections to transactions. The management node then uses the Chameleon hash function modification algorithm to modify the transaction data.

[0073] 2. In the advanced editing mechanism, this application incorporates anonymity and multi-party control mechanisms, allowing user nodes to anonymously report transactions. Anonymous reports are handled by a review team responsible for evaluating the report and making necessary corrections. The reporting process is completed using claimable ring signature technology, which not only protects the anonymity of the reporter's identity but also ensures that they can choose to reveal or conceal their identity. This blockchain editing method achieves accurate data modification through multi-party control, while giving reporters the ability to balance anonymity and claimability.

[0074] 3. The technical solution of this application utilizes blockchain technology to store transaction information, thereby avoiding the single point of failure of centralized databases. However, due to various reasons, transaction error correction is inevitable. To this end, this application introduces an editable blockchain. To ensure the security of blockchain data editing, this application utilizes a double trapdoor mechanism of digital signatures and chameleon hash functions, forming a three-party control over editing permissions. To address the unique needs of supervision and reporting, this application introduces claimable ring signatures. This signature mechanism empowers applicants of editing actions to independently manage their identities. Claimable ring signatures not only protect the identity privacy of applicants of editing actions but also allow applicants to claim their identities in specific scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0075] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0076] Figure 1 This is a system model diagram of an embodiment of the present application;

[0077] Figure 2 This is a process diagram of the initialization phase and transaction generation phase of the embodiment of this application;

[0078] Figure 3 This is a process diagram for the review and submission stage of the embodiments in this application;

[0079] Figure 4 This is a process diagram of the transaction modification stage in the embodiment of this application;

[0080] Figure 5 This is a schematic diagram of the structure of the Merkle tree in the embodiment of this application. DETAILED DESCRIPTION

[0081] Based on the background technology, this application provides an anonymous reporting and transaction modification method based on an editable blockchain architecture. This application takes the college student performance management system as an example to explain in detail the application method of this application.

[0082] Traditional grade management systems typically rely on centralized organizations. However, with the expansion of computer networks and the explosive growth of data volumes, these organizations face increasing security threats and data management pressures. Frequent network attacks and system overloads often lead to system crashes and data inaccessibility. In such scenarios, new data management technologies are urgently needed to ensure the security and availability of data in grade management systems.

[0083] As attached Figure 1 As shown, using university student grades as transaction data, transactions in this embodiment are further divided into academic performance and comprehensive assessment scores. Teachers are responsible for uploading and modifying academic performance, while counselors are responsible for calculating and modifying comprehensive assessment scores. The basic editing solution relies on the traditional Chameleon hash function for data editing operations.

[0084] Learning results can only be queried by the user node itself, while comprehensive evaluation results can be queried by all user nodes together, that is, one user node can query the comprehensive evaluation results of all user nodes.

[0085] In this example, the user node is the student. The management node is the instructor. The supervisor node is the blockchain administrator, with two responsibilities: first, initializing the system and broadcasting relevant parameters to all participants on the chain; second, serving as a member of the review team, responsible for monitoring and handling report requests. The secretary node is the teaching secretary, responsible for verifying and adding transactions to the blockchain, and serving as a member of the review team, responsible for monitoring and handling report requests.

[0086] In order to describe this method more clearly, this application first lists the detailed rules of each algorithm called.

[0087] The algorithm prefix is ​​indicated by an abbreviation, the input is indicated by a bracket before an arrow, and the output is indicated by a bracket after an arrow.

[0088] 1. Digital Signature

[0089] Digital signatures can ensure the integrity, authentication, and non-repudiation of messages. Only the sender with the private key can generate a correct signature, and other users cannot tamper with data or forge signatures. This application uses four algorithms:

[0090] → : Initialize the algorithm and input security parameters , output system common parameters .

[0091] → : Key generation algorithm, input public parameters , output the public key pk and private key sk .

[0092] → : Signature algorithm, input the signer's private key and messages , output the corresponding signature .

[0093] → : Verification algorithm, input the signer's public key ,information and signature If the signature It's news m If the signature is valid, the verification is passed and the output is 1; otherwise, the verification fails and the output is 0.

[0094] Digital signature properties:

[0095] Correctness: For appropriate security parameters and message space Every message in ,like → , → , → If all are executed correctly, Established.

[0096] Message space refers to the digital signature scheme where the message to be signed is stored by default.

[0097] The original information is stored on the blockchain without modification.

[0098] Identity information is data that a user or entity uses to prove their identity, such as an ID number.

[0099] In the public key cryptography system, a participant has a public key and a private key, and a list of multiple public keys is called a public key list.

[0100] Unforgeability: Any user who does not have the signature private key cannot create a new message Calculate the corresponding legal signature .

[0101] 2. Ring Digital Signature

[0102] Assume the message space is , the ring signature scheme includes three core algorithms { }:

[0103] → : Key generation algorithm, input security parameters , output the public and private key pairs of members in the system .

[0104] → : Signature algorithm, member public key list , signer's private key and messages As input, output signature . Indicates a list of public keys, ring L There are n ring member public keys, where It isi The public keys of the ring members.

[0105] → : Verification algorithm, member public key list ,information sign Takes as input and returns 1 if the signature is verified, otherwise returns 0.

[0106] → : declare algorithm, member public key list , signer's private key and signature As input, output statement

[0107] : Declaration verification algorithm, member public key list , signer's public key ,sign and statement As input, if the statement If it is valid, output 1; otherwise, output 0.

[0108] Claimable ring signatures satisfy three conditions: (1) an honest signer can compute a valid claim; (2) a non-signer cannot compute a valid claim; and (3) a malicious signer cannot harm the honest party.

[0109] 3. Pseudo Random Function

[0110] → : Security parameters As input, output Key .

[0111] → : Key and a random string , output a pseudo-random string .

[0112] 4. Commitment Scheme

[0113] : Commitment generation algorithm, message and random numbers r As input, output promise .

[0114] Open(c)→ : Commitment to open the algorithm, commitment c As input, the random number used when outputting the commitment .

[0115] The commitment scheme should be confidential and binding:

[0116] Confidentiality: During the commitment phase, the submitted commitment value should not reveal any information about the content of the commitment.

[0117] Binding: After committing a value, the committer cannot find another message that corresponds to the same value.

[0118] 5. Chameleon Hash

[0119] In the message space Chameleon hash function on, including five algorithms { .

[0120] → : Initialize the algorithm and input security parameters , output common parameters , and assuming As implicit input to other algorithms.

[0121] → : Key generation algorithm, input public parameters , output the public key and trapdoor keys .

[0122] → : Hash algorithm, input public key and the original message , output the message Hash value and a random string .

[0123] → : Verify algorithm, enter public key and hash value ,information With random string The triplet , if the triple If valid, output 1; otherwise, output 0.

[0124] → : Modify the algorithm and enter the trapdoor key , triples and the new message value , output a new random string . New random string , ensure that the original hash value Under the condition of no change, the message is modified, that is, .

[0125] This embodiment can be generally divided into an initialization phase, a transaction generation phase, an anonymous review phase, and a transaction modification phase.

[0126] System initialization phase: as shown in the attached Figure 2 As shown, the functions of this stage include system initialization and key generation.

[0127] System initialization: Teaching Inspector by running Generate public parameters . Then run the trapdoor generation algorithm To generate a hash key pair , and the public parameters and hash key Broadcast to other participants in the system.

[0128] Key generation: Each user in the system uses the public parameters received run Generate your own public and private key pair The instructor and teaching secretary generate their public and private key pairs respectively. and , the public keys of all roles are broadcast in the blockchain.

[0129] Transaction generation phase: The functions of this phase include original transaction generation and original transaction verification.

[0130] Original transaction generation: The instructor generates the transaction by running Generate Chameleon hash value and random values , Chameleon hash value is the hash value of the blockchain transaction. The instructor will then Broadcast to the entire blockchain system.

[0131] Original transaction verification: After the teaching secretary receives the original transaction, run To verify the hash value If the verification passes, the transaction is valid; otherwise, the transaction is discarded.

[0132] Anonymous review submission stage: as attached Figure 3 As shown, the functions of this stage include report review submission and identity declaration.

[0133] Report Review Submission: For questionable grades, students can submit a report by running To generate a signature for a review request , and send it to the review team, who will process the submitted report request. This process uses ring signature technology to protect the identity privacy of the review submitter. The algorithm effectively prevents the same user from making repeated malicious reports, avoiding wasting resources and processing duplicate data.

[0134] Identity declaration: The review submitter can choose to disclose or hide their identity. When the review submitter needs to reveal their identity for some reason, such as a positive response, they can do so by running To generate identity claims . Review team members can run To verify the validity of the identity claim. If the identity claim is valid, the algorithm returns 1, indicating the identity of the review submitter. Otherwise, it returns 0, and the identity of the review submitter remains hidden.

[0135] Transaction modification stage: as attached Figure 4 As shown, the functions of this stage include transaction modification and verification of the modified transaction.

[0136] Transaction Modification: After the Review Panel receives the review request and verifies that it is qualified, the Teaching Supervisor will run To generate a temporary trapdoor , and put Sent to the teaching secretary for subsequent grade modification. At the same time, the instructor will run Generate a new signature , and put Send to the teaching secretary. The teaching secretary runs To generate a new random number The modification operation is subject to the mutual constraints of multiple parties and can only be carried out when all members of the review team, counselors, teaching supervisors, and teaching secretaries agree to the request.

[0137] Verification of modified transactions: After receiving the modified transaction, users in the system can run To verify the validity of the transaction. If the verification is successful, it outputs 1; otherwise, it outputs 0.

[0138] Regarding the algorithm application in the anonymous reporting stage and the transaction modification stage, this embodiment provides detailed algorithm implementation principles.

[0139] Algorithm input during the anonymous reporting phase Check for new reports Is it a repeated report? The algorithm outputs 0, indicating that there is no identical report. Is a new report; if the algorithm outputs 1, it means there is an identical report, and users can punish them for repeated reports.

[0140] → :Initialize the algorithm and set the security parameters As input, then select two orders The multiplicative cyclic group of and And the generators corresponding to these two groups and , construct a bilinear map as , then select four hash functions , and pseudo-random generators The public parameters returned by the algorithm Will serve as implicit input to other algorithms.

[0141] → : Key generation algorithm, public parameters As input, the following steps are then performed in sequence:

[0142] run Initialize a signing key pair ( , ); , ): Indicates running the digital signature algorithm Generated key pair, subscript DS It means running DS The name of the algorithm.

[0143] run Initialize the ring signature key pair ;

[0144] run Initialize the pseudo-random function key ;

[0145] The algorithm returns a private key and public key ,in , .

[0146] → : Signature algorithm, run by the user submitting the review, which takes as input a list of public keys , private key ,information ,in , the algorithm will be executed in the following order:

[0147] calculate = ;

[0148] Random selection And calculate ;

[0149] For each Choose one and calculate ;

[0150] calculate Ring signature ;

[0151] run Generate a random number As a signature random number;

[0152] run Generate a standard digital signature ;

[0153] run Generate a random number As a commitment random number;

[0154] run Generate Commitment ;

[0155] The algorithm returns a signature .

[0156] →{0,1}: verification algorithm, public key list ,sign and messages As input to check the signature effectiveness.

[0157] First calculate (L) , then calculate .if Then calculate .if Then output 1; otherwise output 0.

[0158] → : declare algorithm, public key list , the signer's private key ,sign As input, and execute in the following order:

[0159] calculate ;

[0160] calculate ;

[0161] calculate ;

[0162] The algorithm returns a statement .

[0163] → {0,1}: declare verification algorithm, public key list , the signer's public key ,sign and statement As input. Calculated within the algorithm , Results If both are true, the algorithm returns 1; otherwise, it returns 0.

[0164] → {0,1}: for a list of public keys , the algorithm inputs two ring signatures ,in The algorithm will check Is it equal to , if they are equal, then output 1, otherwise output 0.

[0165] Transaction modification stage

[0166] → :The trapdoor generation algorithm is implemented by the teaching inspector. The algorithm is based on the public parameter As input, three random numbers are selected ,in If they are not equal to each other, then calculate The algorithm then runs produce Finally, the hash key pair is output ,in ( , ), . Representation model q The multiplication group of , specifically meaning all smaller than q Among the positive integers, those q The set of coprime numbers.

[0167] → : The hash generation algorithm is executed by the instructor to hash the key ( , ) ,information and identity information As input. Then select two elements , and calculate ,in The algorithm finally outputs a tuple .

[0168] → :The hash verification algorithm of the original transaction is performed by the teaching secretary. Input hash key ( , ) and triples and identity information ,in , then calculate the hash value Is it true? If so, output 1; otherwise, output 0.

[0169] → :The review-signature algorithm will be executed by the counselor. If the counselor agrees that the report review request is reasonable, the counselor will use his signature private key Correct score information Sign and output the signature of the new score message .

[0170] The above stage is the stage for proposing transaction modifications, that is, the algorithm called before outputting the signature. When performing transaction modifications, the following algorithm is used.

[0171] → : Review - Temporary trapdoor generation algorithm will be run by the teaching supervisor. If the teaching supervisor agrees with the rationality of the report review request, then enter his master key , triples and correct score information First calculate , output temporary trapdoor and a new random number ,in Represents the identity of the editor, such as teaching secretary. Represents the root hash value of the Merkle tree, which corresponds to the correct information and identity of the editor recorded in the Merkle tree. Figure 5 shown.

[0172] When the transaction is generated, the random number generated ,Here the inspector node has two functions: one is to generate a temporary trapdoor tk , sent to the secretary node; second, modify the transaction. The modification here only modifies one part, that is, become , for the remaining The purpose of leaving it to the secretary node to modify is to achieve checks and balances among multiple parties, so that no one party can modify it independently. r become r’ , here r The structure is , the modification is actually completed Both become . CID become CIDs , specify the identity of the editor; It is the hash value of a newly generated Merkle tree, which corresponds to the correct information and identity of the editor recorded in the Merkle tree.

[0173] → : The review-modification algorithm will be executed by the teaching secretary. If the teaching secretary agrees that the report review request is reasonable, the first step is to run as well as To verify the triple and signature If the verification is successful, enter the trapdoor key 、New news (achievements) And the private key of the teaching secretary ,calculate , and output a new random number , then run To generate a signature for a new random number .

[0174] → :The verification algorithm can be executed by any user in the blockchain. , the public keys of the instructor and teaching secretary , two triplets and As input, then execute in the following order: if all verifications pass, output 1; otherwise, output 0;

[0175] calculate Is the result of 1?

[0176] calculate Is the result of 1?

[0177] calculate Is the result of 1?

[0178] calculate Is the result of 1?

[0179] Calculated and verified in Merkle tree If the entire verification process is consistent, the algorithm outputs 1 to indicate verification is successful; otherwise, it outputs 0 to indicate verification is unsuccessful.

[0180] Anything not described in this application can be achieved by adopting or drawing on existing technologies.

[0181] The foregoing is merely an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

Claims

1. An anonymous reporting and transaction modification method based on an editable blockchain architecture, This method is implemented based on an editable blockchain, which includes user nodes, management nodes, supervisor nodes, and secretary nodes. The operation of the editable blockchain includes a query phase, an anonymous review phase, and a data modification phase. The query phase is the initial phase, and the following steps are performed: Inspect nodes with safety parameters Run for input algorithm and output common parameters ; Then run the trapdoor generation algorithm to generate a hash key pair - , and and Broadcast to the blockchain; User nodes, management nodes, and secretary nodes receive Afterwards, Run the key generation algorithm for the input to generate public and private key pairs respectively , , , and broadcast the public key in the blockchain; i Indicates the sequence number of the user node, l Indicates the serial number of the management node, t Indicates the serial number of the secretary node; Management nodes and messages Run the hash algorithm on the input and output the Hash value and a random string , and then broadcast it to the blockchain , generate the original transaction; After receiving the original transaction, the secretary node and identity information Run the validation algorithm for the input, verifying effectiveness; It is characterized in that For a valid raw transaction, the user node lists the public keys , signer's private key and As input, a ring signature algorithm is run to generate a signature for the anonymous review phase. And send it to the review team composed of management nodes, supervision nodes and secretary nodes; When a transaction in the anonymous review phase needs to be modified, it enters the transaction modification phase; During the transaction modification phase: Inspection nodes News For input, run the review-temporary trapdoor generation algorithm to generate a temporary trapdoor , and Send to secretary node; at the same time, Management nodes and Run the review-signature algorithm on the input to generate a new signature , and Send to secretary node; Secretary node As input, run the review-modification algorithm to generate a new random number , thereby generating a modified transaction; When a transaction modification is announced: The user node is 、 and As input, use the declaration algorithm to output declarations The review team For input, use the claim verification algorithm to verify the claim If the verification is successful, the identity information of the user node will be disclosed; otherwise, the user node will remain anonymous. Alternatively, do nothing; Upon receiving notification of a modified transaction: Each node in the review team As input, a review-verification algorithm is run to verify the validity of the transaction.

2. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 1 is characterized in that: During the anonymous review phase, Run the ring signature chaining algorithm for the input to determine whether it is a duplicate report. If the output is 0, it means Is a new report; if the output is 1, it means For repeated reporting; among them, and Respectively represent messages m Two ring signatures.

3. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 1 is characterized in that: During the transaction modification phase, once all nodes in the review team have verified that the transaction is valid, the transaction modification is considered valid.

4. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 1 is characterized in that: Output public parameters in the query phase The process is: With safety parameters As input, we select two orders of The multiplicative cyclic group of and its corresponding generator and , construct a bilinear map as ; Choose four hash functions and a pseudo-random generator ; run Returns public parameters after the algorithm and ; In the query phase, the key generation algorithm generates a public and private key pair respectively. ， ， The process is: As input, run: Initialize a signing key pair ( , );in, Represents a user node; Initialize the ring signature key pair ; by As input, run: Initialize the pseudo-random function key k .

5. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 4 is characterized in that: Run the ring signature algorithm to generate a signature for the anonymous review phase This process is run by the user node that submits the anonymous review, as follows: Enter a public key list in the ring signature algorithm , a private key and news ;in ; calculate = ; Random selection And calculate ; For each Choose one and calculate ; calculate Assuming a ring signature ; run Generate a random number As a signature random number; run Generate a standard digital signature ; run Generate a random number As a commitment random number; run Generate Commitment ; Use the verification algorithm to verify the above signature The specific process is as follows: calculate (L) ,calculate ; if Then calculate ; if Then output 1; otherwise output 0.

6. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 5 is characterized in that: Declare algorithm output declaration The process is as follows: by For input, run Algorithmic calculation ; by For input, run Algorithmic calculation ; by For input, run Algorithmic calculation ; Get statement ; Verify the claim using the claim verification algorithm The specific process is as follows: by For input, Calculation in the algorithm ,as well as, by For input, In the algorithm, whether the calculation result is 1; When both of the above judgments are yes, then the statement Valid; otherwise, invalid.

Images