Anonymous report and transaction modification method based on editable block chain architecture

Abstract

The invention relates to an anonymous report and transaction modification method based on an editable block chain architecture, a block chain comprises a user node, a management node, a supervision node and a secretary node, the operation of the editable block chain comprises a query stage, an anonymous review stage and a data modification stage, and transaction query and transaction report can be realized. And performing modification after successful reporting. According to the method and the device, an editable block chain scheme which supports multi-party restriction and has anonymity is realized, meanwhile, a reporter is endowed with a tradeoff capability between anonymity and declaration, and the single-point fault problem of a centralized database is also avoided.

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 usually rely on centralized architectures. With the expansion of computer networks and the explosive growth of data volumes, these architectures will face increasing security threats and data management pressures. Frequent network attacks and system overloads often lead to system crashes and inaccessible data. 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 need for citizens to exercise their right to be forgotten about their private information.

[0004] Blockchain already has an editable solution, the core idea of ​​which is to replace the traditional hash function with a chameleon hash function, allowing the authorized person holding the trapdoor key to make controllable modifications to the content in the blockchain and maintain the linkability of the original data structure of the blockchain. In recent years, some technicians have used multi-center attribute encryption to solve the problem of excessive concentration of editing authority, but the complexity of attribute encryption increases the difficulty of implementing the solution engineering. In addition, due to the openness and transparency of blockchain information, in the blockchain-based grade management system, the identity of the applicant for editing behavior will become highly sensitive information, and it is necessary to protect the privacy of the applicant's identity while verifying the legitimacy of the application. At the same time, when it comes to identity proof, the applicant for editing behavior should also have the right to reveal his identity in order to meet the need to fight for legitimate rights and interests. Therefore, the autonomous management of identity hiding and revealing by the applicant for editing behavior is an important factor in maintaining the grade management system based on editable blockchain. However, the existing technology still has no relevant statement on the identity hiding and revealing of the above-mentioned applicant for editing behavior. 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: An anonymous reporting and transaction modification method based on an editable blockchain architecture, This method is implemented based on an editable blockchain, which includes a user node, a management node, an inspection node, and a secretary node; 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 security 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; User nodes, management nodes, and secretary nodes receive After that, Run the key generation algorithm for the input to generate a public and private key pair 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 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; For a valid raw transaction, the user node lists the public keys , Signer's private key and As input, a signature is generated by running the ring signature algorithm 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-signing 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 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; 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.

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

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

[0009] Furthermore, the public parameters are output 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 .

[0010] 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 anonymous review, as follows: Enter a list of public keys in the ring signature algorithm , a private key And the 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 If yes, output 1; otherwise, output 0.

[0011] Furthermore, the algorithm output statement The process is as follows: by For input, run Algorithm calculation ; by For input, run Algorithm calculation ; by For input, run Algorithm calculation ; Get the 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 declare Valid; otherwise, invalid.

[0012] Furthermore, during the transaction modification phase: Review - Temporary Trapdoor Generation Algorithm Generates Temporary Trapdoors The specific process is as follows: enter , triple as well as After that, calculate , output temporary trapdoor and the new random number ,in Indicates the identity of the editor. Represents the root hash value of the Merkle tree; The secretary node runs the review-modification algorithm process as follows: run as well as To verify the triple and signature Correctness; When the verification is correct, As input, calculate , and output a new random number , then run Generate a signature for a new random number ; The process of each node in the review team running the review-verification algorithm is as follows: by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; Calculated and verified in , in the Merkle tree Is it consistent? 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 not successful.

[0013] Due to the adoption of the above technical solution, the beneficial effects of this application are as follows: This application proposes two blockchain data editing mechanisms, one is a basic editing mechanism and the second is an advanced editing mechanism.

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

[0015] 2. In the advanced editing mechanism, this application has an anonymity and multi-party constraint mechanism, and user nodes can anonymously report transactions. Anonymous reports will be handled by a review team, which is responsible for evaluating the content of the report and making necessary corrections. The reporting process is completed through the declarable ring signature technology, which not only protects the anonymity of the reporter's identity, but also ensures that they can choose between public or hidden identities. This blockchain editing method achieves accurate modification of data through multi-party constraints, while giving reporters the ability to balance anonymity and declarativeness.

[0016] 3. The technical solution of this application uses blockchain technology to store transaction information, thereby avoiding the single point failure problem of centralized databases. However, due to various reasons, transaction error correction is inevitable. To this end, this application introduces an editable blockchain. In order to ensure the security of blockchain data editing, this application adopts a double trapdoor mechanism of digital signatures and chameleon hash functions to form a three-party restriction on editing permissions. In response to the unique supervision and reporting needs, this application introduces a declarable ring signature. This signature mechanism gives the applicant of the editing behavior the ability to manage his identity independently. The declarable ring signature not only protects the identity privacy of the applicant of the editing behavior, but also allows the applicant to declare his identity in specific scenarios. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] 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: Figure 1 A system model diagram of an embodiment of the present application; Figure 2 It is a process diagram of the initial stage and the transaction generation stage of the embodiment of this application; Figure 3 This is a process diagram of the review and submission stage of the embodiment in this application; Figure 4 This is a process diagram of the transaction modification stage in the embodiment of this application; Figure 5 This is a schematic diagram of the structure of the Merkle tree in the embodiment of this application. DETAILED DESCRIPTION

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

[0019] Traditional grade management systems usually rely on centralized institutions. However, with the expansion of computer networks and the explosive growth of data, these institutions will face more and more security threats and data management pressures. Frequent network attacks and system overload often lead to system crashes and inaccessible data. In such a scenario, in order to ensure the security and availability of data in the grade management system, new data management technologies are urgently needed.

[0020] As attached Figure 1 As shown, the college students' grades are used as transaction data. In this embodiment, the transactions are further divided into two types: academic performance and comprehensive assessment performance. The teacher is responsible for uploading and modifying the academic performance, and the counselor is responsible for calculating and modifying the comprehensive assessment performance. The basic editing scheme relies on the traditional chameleon hash function to perform data editing operations.

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

[0022] In this embodiment, the user node is a student. The management node is a counselor. The inspection node is the administrator of the blockchain, which has two responsibilities: one is to initialize the system and broadcast relevant parameters to all participants on the chain; the other is to be a member of the review team and be responsible for supervising and handling report requests. The secretary node is a teaching secretary, who is responsible for verifying and adding transactions to the blockchain, and is also a member of the review team and is responsible for supervising and handling report requests.

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

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

[0025] 1. Digital Signature Digital signatures can ensure the integrity, authentication, and non-repudiation of messages. Only the sender with the private key can generate the correct signature, and other users cannot tamper with the data or forge the signature. This application calls four algorithms: → : Initialize the algorithm and input security parameters , output system common parameters .

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

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

[0028] → : 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.

[0029] Digital signature properties: Correctness: For appropriate safety parameters and message space Every message in ,like → , → , → can be executed correctly, then Established.

[0030] Message space refers to the digital signature scheme in which the message to be signed is stored by default.

[0031] The original information is stored on the blockchain without modifying the previous information.

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

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

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

[0035] 2. Ring Digital Signature Assume the message space is , the ring signature scheme contains three core algorithms { }: → : Key generation algorithm, input security parameters , output the public and private key pairs of members in the system .

[0036] → : Signature algorithm, member public key list , Signer's private key and Message As input, output signature . Represents a list of public keys, ring L There aren The public keys of the ring members are It is i The public keys of the ring members.

[0037] → : Verification algorithm, member public key list ,information sign As input, if the signature is verified, it returns 1; otherwise, it returns 0.

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

[0039] A claimable ring signature satisfies 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.

[0040] 3. Pseudo Random Function → : Security parameters As input, output Key .

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

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

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

[0044] The commitment scheme should meet the requirements of confidentiality and bindingness: Confidentiality: During the commitment phase, the committed value should not reveal any information about the content of the commitment.

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

[0046] 5. Chameleon Hash In the message space Chameleon hash functions on, including five algorithms { .

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

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

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

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

[0051] → : Modify the algorithm and enter the trapdoor key , triple and the new message value , output a new random string . New random string , ensure that the original hash value Without changing, the message can be modified, that is, .

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

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

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

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

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

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

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

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

[0060] Report a review submission: For questionable grades, students can report a review submission 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.

[0061] Identity declaration: Review submitters can choose to disclose or hide their identity. When a 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 and indicates the identity of the review submitter. Otherwise, it returns 0 and the identity of the review submitter remains hidden.

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

[0063] Transaction Modification: After the Review Panel receives the review request and verifies that it is qualified, the Teaching Supervisor will run To create 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.

[0064] 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, output 1; otherwise output 0.

[0065] With respect to the algorithm application in the anonymous reporting stage and the transaction modification stage, this embodiment provides a detailed algorithm implementation principle.

[0066] Algorithm input for anonymous reporting stage Check for new reports Is it a duplicate 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.

[0067] → :Initialize the algorithm and set the security parameters As input, and then select two orders as 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 a pseudo-random generator . The public parameters returned by the algorithm Will serve as implicit input to other algorithms.

[0068] → : Key generation algorithm, public parameters As input, the following steps are then performed in sequence: run Initialize a signing key pair ( , ); , ): indicates running the digital signature algorithm The generated key pair, subscript DS It means running DS The name of the algorithm.

[0069] run Initialize the ring signature key pair ; run Initialize the pseudo-random function key ; The algorithm returns a private key and the public key ,in , .

[0070] → : 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: calculate = ; Random Selection And calculate ; For each Choose one And calculate ; calculate The ring signature is ; 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 ; This algorithm returns a signature .

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

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

[0073] → : declare algorithm, public key list , the signer's private key ,sign As input, and execute in the following order: calculate ; calculate ; calculate ; This algorithm returns a statement .

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

[0075] → {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.

[0076] Transaction modification stage → : The trapdoor generation algorithm is implemented by the teaching supervisor. The algorithm is based on the public parameters As input, three random numbers are then picked ,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 multiplicative group of , specifically, all the numbers less than q Among the positive integers, those q The set of mutually prime numbers.

[0077] → : 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 .

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

[0079] → : The review-signature algorithm will be performed by the counselor. If the counselor agrees to report the rationality of the review request, the counselor will use his signature private key Correct score information Sign and output the signature of the new score message .

[0080] The above stage is the stage of proposing transaction modification, that is, the algorithm called before outputting the signature. When modifying a transaction, the following algorithm is used.

[0081] → : 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 , triple and correct grade information First calculate , output temporary trapdoor and a new random number ,in Represents the identity of an editor, such as a 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.

[0082] When a transaction is generated, a random number is generated The inspector node has two functions: one is to generate a temporary trapdoor. tk , sent to the secretary node; the second is to modify the transaction. The modification here only modifies one part, that is, become , for the remaining The purpose of this is to achieve a power constraint and checks and balances among multiple parties, so that no party can make changes 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.

[0083] → : 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 run as well as To verify the triple and signature If the verification is successful, enter the trapdoor key , New news (scores) 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 .

[0084] → :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, it is then executed in the following order: if all verifications pass, output 1; otherwise, output 0; calculate Is the result of 1? calculate Is the result of 1? calculate Is the result of 1? calculate Is the result of 1? Calculated and verified in Merkle tree If the entire verification process is consistent, the algorithm outputs 1 to indicate that the verification is successful; otherwise, the algorithm outputs 0 to indicate that the verification is unsuccessful.

[0085] Anything not described in this application can be achieved by adopting or drawing on existing technologies. The above is only 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 modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in 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 a user node, a management node, an inspection node, and a secretary node; 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 security 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; User nodes, management nodes, and secretary nodes receive After that, Run the key generation algorithm for the input to generate a public and private key pair 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 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 signature is generated by running the ring signature algorithm 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-signing 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 、 and As input, use the declaration algorithm to output declarations The review team For input, use the claim verification algorithm to verify the claim The validity of the node is verified. When the verification is passed, the identity information of the user node is made public; otherwise, the user node remains anonymous. Or, 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. According to claim 1, an anonymous reporting and transaction modification method based on an editable blockchain architecture 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 duplicate reporting.

3. According to claim 1, an anonymous reporting and transaction modification method based on an editable blockchain architecture is characterized in that: During the transaction modification phase, once each node in the review team verifies that the transaction is valid, it indicates that the transaction modification is valid.

4. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 1, characterized in that: Output common 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. According to claim 4, an anonymous reporting and transaction modification method based on an editable blockchain architecture 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 anonymous review, as follows: Enter a list of public keys into the ring signature algorithm , a private key And the 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 If yes, output 1; otherwise, output 0.

6. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 5, characterized in that: Declare algorithm output declaration The process is as follows: by For input, run Algorithm calculation ; by For input, run Algorithm calculation ; by For input, run Algorithm calculation ; Get the 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; If both of the above judgments are yes, then the statement Valid; otherwise, invalid.

7. The anonymous reporting and transaction modification method based on an editable blockchain architecture according to claim 6 is characterized in that: During the transaction modification phase: Review - Temporary Trapdoor Generation Algorithm Generates Temporary Trapdoors The specific process is as follows: enter , triple as well as After that, calculate , output temporary trapdoor and the new random number ,in Indicates the identity of the editor. Represents the root hash value of the Merkle tree; The secretary node runs the review-modification algorithm process as follows: run as well as To verify the triple and signature Correctness; When the verification is correct, As input, calculate , and output a new random number , then run Generate a signature for a new random number ; The process of each node in the review team running the review-verification algorithm is as follows: by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; by For input, run Determine whether the result is 1; Calculated and verified in , in the Merkle tree Is it consistent? 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 not successful.

Images