A blockchain-based method and system for storing anonymous identity data

By using a blockchain-based anonymous identity data storage system that leverages B+ tree and Merkle tree structures as well as the IPFS file system, the system addresses the risks of association and data security in anonymous identity authentication, achieving efficient identity authentication and privacy protection.

CN117394977BActive Publication Date: 2026-11-10CHONGQING UNIV OF POSTS & TELECOMM
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311322895.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-10-12
Publication Date
2026-11-10
Estimated Expiration
2043-10-12

AI Technical Summary

Technical Problem

Existing anonymous identity authentication schemes have issues with association risks, data security, and retrieval efficiency, especially when relying on centralized institutions, making it difficult to guarantee user privacy and efficient data retrieval.

Method used

A blockchain-based anonymous identity data storage system is adopted, including an index caching module, a real identity storage module, and an anonymous identity storage module. It utilizes a B+ tree structure index table, a Merkle tree, and the IPFS file system to achieve fast retrieval and secure storage of real and anonymous identities.

Benefits of technology

It improves the efficiency and security of anonymous identity authentication, reduces the risk of data leakage and tampering, reduces reliance on centralized institutions, and provides higher privacy protection and faster retrieval capabilities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117394977B_ABST
    Figure CN117394977B_ABST
Patent Text Reader

Abstract

This invention relates to the fields of anonymous identity authentication and blockchain technology, specifically to a blockchain-based anonymous identity data storage method and system. First, a blockchain-based anonymous identity data storage system is proposed, including an index caching module, a real identity storage module, and an anonymous identity storage module. Then, a blockchain-based anonymous identity data storage method is proposed, employing a decentralized identity data storage approach to reduce reliance on centralized institutions. This invention reduces the risk of data leakage, tampering, or forgery, providing enhanced security and privacy protection capabilities.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the fields of anonymous identity authentication and blockchain technology, specifically to a blockchain-based anonymous identity data storage method and system. Background Technology

[0002] Blockchain technology is a decentralized storage technology that organizes data into blocks according to time sequence and links them together using cryptographic methods to form a chain-like structure that ensures data integrity. Blockchain offers high security because data is distributed and stored across multiple nodes, eliminating the risk of single points of failure. Furthermore, blockchain provides decentralization, eliminating the intermediary role of traditional centralized institutions, allowing each participant to share and verify data.

[0003] Anonymous authentication is an identity verification method that allows users to remain anonymous during the authentication process without disclosing their real identity information. It is typically used to protect user privacy and personal information while ensuring the credibility and verifiability of a user's identity when performing specific actions or accessing restricted resources. Anonymous authentication can be implemented using anonymous temporary identities or other encryption techniques.

[0004] Current anonymous identity authentication schemes mainly suffer from the following problems: First, there is the issue of association risk. Anonymous temporary identities are linked to real identities through some form of proof of association. Existing schemes often rely on third-party institutions or organizations for association authentication, posing a centralized security risk. Second, there is the issue of data security. Both the real identity and the proof of association require appropriate encryption and storage measures to ensure the security of user identity-related information. Finally, there is the issue of retrieval efficiency. Because anonymous temporary identities need to be updated periodically, one real identity often corresponds to a large number of temporary identities, and only the latest temporary identity is legitimate. Existing relational database structures are complex and cannot meet the requirements for efficient and accurate data retrieval and fast response speeds. Summary of the Invention

[0005] To address the aforementioned issues, this invention proposes a blockchain-based method and system for storing anonymous identity data.

[0006] In a first aspect, the present invention provides a blockchain-based anonymous identity data storage system, the system comprising an index caching module, a real identity storage module, and an anonymous identity storage module.

[0007] Furthermore, the aforementioned index caching module is implemented using a real identity index table based on a B+ tree structure, the structure of which is as follows:

[0008] Index real ={ID real [Height]real ID anony, ID proof ]}

[0009] Among them, Index real Represents a real identity index table, ID real Represents a real identity identifier, ID anony and ID proof Height is a unique identifier representing an anonymous temporary identity and proof of association, respectively. real The block height representing the block containing the real identity, including the ID. real As a key, Height real ID anony and ID proof As the value, create an ID. real With Height real ID anony and ID proof A one-way index relationship.

[0010] Among them, the B+ tree structure mentioned above, such as Figure 1 The diagram shows an index tree structure based on keyword size, comprising a root node, internal nodes, and leaf nodes. The root node stores no data. Internal nodes store the largest key in their subtree and pointers to its child nodes. Leaf nodes store the key and its corresponding data item, sorted in ascending order of key size for fast retrieval. A B+ tree achieves a one-way index from key to corresponding data address by storing the key and its corresponding data address together as data items. Each node, except the root node, contains at least m / 2 data items and at most m-1 data items, where m is the order of the tree.

[0011] Furthermore, the real identity storage module, such as Figure 2 As shown, based on a blockchain structure, each block contains the hash value of the previous block. Any modification to a previous block will result in a change to the hash value of subsequent blocks, making data in the blockchain difficult to tamper with. Each block consists of two parts: a block header and a block body. The block header contains the metadata of the entire block, including the hash value of the previous block, a timestamp, the block height, the root hash value of the block body, and a list of real identities stored in this block. The block body uses a Merkle tree structure to store the real identities and employs cryptographic methods to ensure data security and integrity. Each block contains a certain number of real identities, which are collected, verified, and packaged into blocks, then added to the blockchain through a consensus algorithm.

[0012] The Merkle tree structure described is a full binary tree structure, possessing all the characteristics of a tree. Leaf nodes store the real identity, each internal node stores the hash values ​​of its two child nodes, and the root node summarizes all child node information in the block, generating the root hash value of the entire tree, i.e., the root hash value of the block body. The Merkle tree requires all leaf nodes to have stored data before it can be added to the blockchain as a complete block. Before the Merkle tree is fully constructed, the block is stored locally on the node as a cache table. After all leaf nodes are filled, the hash value of the identity information stored in each leaf node is calculated, proceeding upwards. Once the root hash value of the entire Merkle tree is calculated, the block header corresponding to the block body is generated, and the block is added to the blockchain as a complete block.

[0013] Furthermore, the anonymous identity storage module mentioned above, such as Figure 3 As shown, this implementation is based on the IPFS file system and uses content addressing as its core mechanism. Each file stored within it is assigned a unique identifier (CID) for fast data retrieval and to avoid duplicate data storage. Each piece of data is divided into blocks and distributed across multiple nodes, increasing data redundancy and availability. Each node maintains a distributed hash table to store and locate the hash values ​​of files and is responsible for the transmission of those files. When a user requests a file, the distributed hash table is used to find the various blocks of the file, and then these blocks are transmitted peer-to-peer between nodes until the complete file is reassembled.

[0014] In a second aspect, the present invention also provides a blockchain-based method for storing anonymous identity data, the method comprising:

[0015] Step S1: Register an anonymous temporary identity in the system using your real identity, store the anonymous temporary identity in the anonymous identity storage module, and use the generated unique identifier CID as your ID. anony .

[0016] Step S2 generates a proof of association between the real identity and the corresponding anonymous temporary identity, as well as a symmetric key SK for accessing and verifying the proof of association. proof .

[0017] Step S3 uses SK proof After encrypting the association proof, the association proof is stored in the anonymous identity storage module, and the generated unique identifier CID is used as the ID. proof .

[0018] Step S4 generates an identity identifier ID for the real identity to access the identity. real PK, the public key used for identity verification realand private key SK real .

[0019] Step S5 combines the real identity with the symmetric key SK proof Use the public key of the real identity to perform a PK real After encryption, the private key SK is stored in the real identity storage module. real It shall be handed over to the user for safekeeping.

[0020] Step S6 in Index real Establish ID in real With Height real ID anony and ID proof One-way fast retrieval.

[0021] Step S7 using ID anony The anonymous temporary identity is retrieved and verified based on content addressing in the anonymous identity storage module to achieve anonymous temporary identity authentication.

[0022] Step S8 in Index real China via ID real Search Height real via Height real The system retrieves and verifies the real identity within a block at a specified height, thus achieving real identity authentication.

[0023] Step S9 uses ID real and private key SK real Retrieve real identity and proof of association, and verify through ID. anony The retrieved anonymous temporary identity is verified to establish a connection between the real identity and the anonymous temporary identity.

[0024] Step S10 updates the anonymous temporary identity by registering a new anonymous temporary identity using the real identity and updating the old index relationship.

[0025] In step S11, when storing the anonymous temporary identity and associated proof to the anonymous identity storage module, an expiration time can be set. Files that have exceeded the expiration time are considered no longer needed and will have their access to the service restricted by each node. This means that the anonymous temporary identity and associated proof have expired and will eventually be deleted by all nodes.

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

[0027] 1. The blockchain-based anonymous identity data storage system provided by this invention ensures the secure and reliable storage of real identity data and associated proofs, while enabling rapid retrieval of real and anonymous identities. It can effectively improve the authentication efficiency of real and anonymous identities and provide effective protection for data security.

[0028] 2. The blockchain-based anonymous identity data storage method provided by this invention realizes decentralized identity data storage, reduces the risk of data leakage, tampering or forgery, reduces dependence on centralized institutions, and provides higher security and privacy protection capabilities. Attached Figure Description

[0029] Figure 1 This is a structural diagram of the index caching module proposed in this invention.

[0030] Figure 2 This is a structural diagram of the real identity storage module proposed in this invention.

[0031] Figure 3 This is a structural diagram of the anonymous identity storage module proposed in this invention.

[0032] Figure 4 This is a structural diagram of the blockchain-based anonymous identity data storage system proposed in this invention. Detailed Implementation

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

[0034] This invention proposes a blockchain-based method and system for storing anonymous identity data, the specific implementation of which is as follows:

[0035] Step S1 deploys an identity data storage system, including an index caching module, a real identity storage module, and an anonymous identity storage module.

[0036] Furthermore, the aforementioned index caching module is implemented using a real identity index table based on a B+ tree structure, the structure of which is as follows:

[0037] Index real ={ID real [Height] real ID anony ID poof ]}

[0038] Among them, Index real Represents a real identity index table, ID real Represents a real identity identifier, ID anony and ID proof Hei is a unique identifier representing an anonymous temporary identity and proof of association, respectively. g htreal The block height representing the block containing the real identity, including the ID. real As a key, Height real ID anony and ID proof As the value, create an ID. real With Height real ID anony and ID proof A one-way index relationship.

[0039] Among them, the B+ tree structure mentioned above, such as Figure 1 The diagram shows an index tree structure based on keyword size, comprising a root node, internal nodes, and leaf nodes. The root node stores no data. Internal nodes store the largest key in their subtree and pointers to its child nodes. Leaf nodes store the key and its corresponding data item, sorted in ascending order of key size for fast retrieval. A B+ tree achieves a one-way index from key to corresponding data address by storing the key and its corresponding data address together as data items. Each node, except the root node, contains at least m / 2 data items and at most m-1 data items, where m is the order of the tree.

[0040] Furthermore, the real identity storage module, such as Figure 2 As shown, based on a blockchain structure, each block contains the hash value of the previous block. Any modification to a previous block will result in a change to the hash value of subsequent blocks, making data in the blockchain difficult to tamper with. Each block consists of two parts: a block header and a block body. The block header contains the metadata of the entire block, including the hash value of the previous block, a timestamp, the block height, the root hash value of the block body, and a list of real identities stored in this block. The block body uses a Merkle tree structure to store the real identities and employs cryptographic methods to ensure data security and integrity. Each block contains a certain number of real identities, which are collected, verified, and packaged into blocks, then added to the blockchain through a consensus algorithm.

[0041] The Merkle tree structure described is a full binary tree structure, possessing all the characteristics of a tree. Leaf nodes store the real identity, each internal node stores the hash values ​​of its two child nodes, and the root node summarizes all child node information in the block, generating the root hash value of the entire tree, i.e., the root hash value of the block body. The Merkle tree requires all leaf nodes to have stored data before it can be added to the blockchain as a complete block. Before the Merkle tree is fully constructed, the block is stored locally on the node as a cache table. After all leaf nodes are filled, the hash value of the identity information stored in each leaf node is calculated, proceeding upwards. Once the root hash value of the entire Merkle tree is calculated, the block header corresponding to the block body is generated, and the block is added to the blockchain as a complete block.

[0042] Furthermore, the anonymous identity storage module mentioned above, such as Figure 3 As shown, this implementation is based on the IPFS file system and uses content addressing as its core mechanism. Each file stored within it is assigned a unique identifier (CID) for fast data retrieval and to avoid duplicate data storage. Each piece of data is divided into blocks and distributed across multiple nodes, increasing data redundancy and availability. Each node maintains a distributed hash table to store and locate the hash values ​​of files and is responsible for the transmission of those files. When a user requests a file, the distributed hash table is used to find the various blocks of the file, and then these blocks are transmitted peer-to-peer between nodes until the complete file is reassembled.

[0043] Step S2: Register an anonymous temporary identity in the system using the real identity, store the anonymous temporary identity in the anonymous identity storage module, and use the generated unique identifier CID as the ID. anony .

[0044] Step S3 generates a proof of association between the real identity and the corresponding anonymous temporary identity, as well as a symmetric key SK for accessing and verifying the proof of association. proof .

[0045] Step S4 uses SK proof After encrypting the association proof, the association proof is stored in the anonymous identity storage module, and the generated unique identifier CID is used as the ID. proof .

[0046] Step S5 generates an identity identifier ID for the real identity to access the identity. real PK, the public key used for identity verification real and private key SK real .

[0047] Furthermore, in step S5, the identity identifier IDreal It is generated by hashing the real identity using a hash function. Because hash functions are irreversible and unique, the identity identifier generated from this identity information will also be irreversible and unique.

[0048] Step S6: Combine the real identity with the symmetric key SK proof Use the public key of the real identity to perform a PK real After encryption, the private key SK is stored in the real identity storage module. real It shall be handed over to the user for safekeeping.

[0049] Furthermore, the specific process of step S6 is as follows:

[0050] S6.1: Add the real identity and SK to be added proof Use PK real After encryption, it is added as a data item to the Merkle tree leaf node of the block body, waiting for the block to be packaged.

[0051] S6.2: After all data items in the block body have been added, populate the relevant fields in the block header, including the hash value of the previous block, timestamp, block height, root hash value of the block body, and the list of real identities stored in this block.

[0052] S6.3: Once the relevant fields of the block header are filled in, the block header and block body are combined to form a complete block.

[0053] S6.4: After verification by the consensus mechanism, the newly generated block is added to the blockchain.

[0054] S6.5: Private Key SK real The public key (PK) should be kept safe by the user; only the user holding the private key can decrypt it. real Encrypted data.

[0055] Step S7 in Index real Establish ID in real With Height real ID anony and ID proof One-way fast retrieval.

[0056] Furthermore, the specific process of step S7 is as follows:

[0057] S7.1: Based on the characteristics of B+ trees, the data items in the leaf nodes are arranged according to their key IDs. real The numerical values ​​are sorted, and the position of the leaf node to be inserted is found by comparing the key of the new data item with the key of the existing data items in the node.

[0058] S7.2: If the B+ tree is empty, i.e., the index... real If the node is empty, a new leaf node is created as the root node and data is inserted. If an insertion position is found, the new data item is inserted into the appropriate position, and the order of the data items in the node is adjusted to ensure that the data items are arranged in numerical order of the key.

[0059] S7.3: If inserting a new data item causes the number of data items in the current leaf node to exceed the capacity limit, a split operation is performed. The current node is split into two, with one part of the data items remaining in the original node and the other part moved to the newly created node. Simultaneously, the minimum key of the new node and the maximum key of the original node are moved up to the parent node.

[0060] Step S8 uses ID anony The anonymous temporary identity is retrieved and verified based on content addressing in the anonymous identity storage module to achieve anonymous temporary identity authentication.

[0061] Step S9 in Index real China via ID real Search Hei g ht real via Height real The system retrieves and verifies the real identity within a block at a specified height, thus achieving real identity authentication.

[0062] Furthermore, the specific process for step S9 is as follows:

[0063] S9.1: Based on ID real In Index real The process of retrieving data items corresponding to keywords is as follows: starting from the root node, the search path is determined by comparing the numerical values ​​of the keywords until the specified leaf node is reached.

[0064] S9.2: If in Index real If no data item corresponding to the keyword is found, execute S9.3; if in Index real The corresponding data item was found, based on the Height value in the data item. real Execute S9.4.

[0065] S9.3: Retrieve the local block cache table, i.e., incomplete block bodies that have not yet been packaged and added to the blockchain. If the corresponding leaf node and data item are found in the block cache table, use them as the result for matching and authentication. If the corresponding leaf node and data item are not found in the block cache table, it means that the identity information is not stored in the system, and authentication fails.

[0066] S9.4: According to Height realThe process involves retrieving the block header of the corresponding block, identifying the real identity in the Merkle tree of the block body based on the list of real identities in the block header, finding the corresponding leaf node and data item, using these as the result, and then applying the corresponding private key SK. real After decryption, perform matching and authentication.

[0067] Step S10 uses ID real and private key SK real Retrieve real identity and proof of association, and verify through ID. anony The retrieved anonymous temporary identity is verified to establish a connection between the real identity and the anonymous temporary identity.

[0068] Furthermore, the specific implementation process of step S10 is as follows:

[0069] S10.1: Using ID real In Index real Search for Height real and ID proof .

[0070] S10.2: Using Height real Retrieve real identity and SK in the real identity storage module proof .

[0071] S10.3: Using ID proof Retrieve the associated proof in the anonymous identity storage module.

[0072] S10.4: Use the SK corresponding to this real identity real Uncover the truth about their identities.

[0073] S10.5: Using the symmetric key SK proof Decrypt the correlation proof.

[0074] S10.6: Using ID anony Retrieve anonymous temporary identities from the anonymous identity storage module.

[0075] S10.7: Verification is performed using real identity, proof of association, and anonymous temporary identity.

[0076] Step S11 updates the anonymous temporary identity by registering a new anonymous temporary identity using the real identity and updating the old index relationship.

[0077] Furthermore, the specific implementation process of step S11 is as follows:

[0078] S11.1: Register a new anonymous temporary identity using the real identity and store it in the anonymous identity storage module, obtaining the CID as the new ID. anony .

[0079] S11.2: Using ID real In Index real Search for Height real , using Height real Retrieve real identity and SK in the real identity storage module proof and utilize SK real Decrypt.

[0080] S11.3: Generate a new association proof and use the symmetric key SK proof Encrypt the proof, store it in the anonymous identity storage module, and obtain the CID as the new ID. proof .

[0081] S11.4: In Index real Update ID real With ID anony and ID proof One-way fast retrieval.

[0082] In step S12, when storing the anonymous temporary identity and associated proof to the anonymous identity storage module, an expiration time can be set. Files that have exceeded the expiration time are considered no longer needed and will be restricted from accessing the service by each node. This means that the anonymous temporary identity and associated proof have expired and will eventually be deleted by all nodes.

[0083] Furthermore, in step S12, when a file exceeds its validity period, a node may stop providing access services to the file and delete it from its local machine. The availability of a file depends on the number of its copies. As nodes cease actively providing the file to other nodes, the file's availability will gradually decrease until eventually all nodes stop providing services to the file and delete it from their local machines.

[0084] Although embodiments of the invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims and their equivalents.

Claims

1. A blockchain-based anonymous identity data storage system, characterized in that, It includes an index caching module, a real identity storage module, and an anonymous identity storage module; the index caching module is implemented through a real identity index table based on a B+ tree structure, and its structure is as follows: Represents a real identity index table. Represents a real identity identifier. and Unique identifiers representing anonymous temporary identities and proof of association, respectively. The block height representing the block where the real identity is located will As a key, , and As a value, establish and , and A one-way index relationship; The real identity storage module is implemented based on a blockchain structure. Each block contains the hash value of the previous block. Any modification to a previous block will result in a change to the hash value of subsequent blocks, making the data in the blockchain difficult to tamper with. Each block consists of a block header and a block body. The block header contains the metadata of the entire block, including the hash value of the previous block, timestamp, block height, root hash value of the block body, and a list of real identities stored in this block. The block body uses a Merkle tree structure to store real identities and employs cryptographic methods to ensure data security and integrity. Each block contains real identities, which are collected, verified, and packaged into blocks, then added to the blockchain through a consensus algorithm. The anonymous identity storage module is implemented based on the IPFS file system, using content addressing as its core mechanism. Each file stored within it is assigned a unique identifier CID (Content Address). The data is divided into blocks and distributed across multiple nodes to increase redundancy and availability. Each node maintains a distributed hash table to store and locate the hash value of a file and is responsible for the transmission of the corresponding file. When a user requests a file, the distributed hash table is used to find the various blocks of the file and then the data is transmitted point-to-point between nodes until the complete file is reassembled.

2. A blockchain-based method for storing anonymous identity data, characterized in that, Includes the following steps: Step S1: Register an anonymous temporary identity in the system using your real identity, store the anonymous temporary identity in the anonymous identity storage module, and use the generated unique identifier CID as... ; Step S2 generates a proof of association between the real identity and the corresponding anonymous temporary identity, as well as a symmetric key for accessing and verifying the proof of association. ; Step S3 uses After encrypting the association proof, the association proof is stored in the anonymous identity storage module, and the generated unique identifier CID is used as... ; Step S4 generates an identity identifier for the real identity to access the identity. and the public key used to verify identity and private key ; Step S5 combines the real identity with the symmetric key. Use the public key of the real identity. After encryption, the private key is stored in the real identity storage module. Please keep it safe with the user. Step S6 China and , and A one-way index relationship; Step S7 by using In the anonymous identity storage module, anonymous temporary identities are retrieved and verified based on content addressing to achieve anonymous temporary identity authentication. Step S8 China passed Search ,pass The system retrieves and verifies the real identity within a block at a specified height, thus achieving real identity authentication. Step S9 by using and private key Retrieve real identity and proof of association, and through The retrieved anonymous temporary identity is verified to achieve the association authentication between the real identity and the anonymous temporary identity; Step S10 updates the anonymous temporary identity by registering a new anonymous temporary identity using the real identity and updating the old index relationship; In step S11, when storing the anonymous temporary identity and associated proof to the anonymous identity storage module, an expiration time can be set. Files that have exceeded the expiration time are considered no longer needed and will be restricted from accessing the service by each node. This means that the anonymous temporary identity and associated proof have expired and will eventually be deleted by all nodes.

3. The blockchain-based anonymous identity data storage method according to claim 2, characterized in that, In step S4, the identity identifier The identity identifier generated by hashing the real identity using a hash function is irreversible and unique.

4. The blockchain-based anonymous identity data storage method according to claim 2, characterized in that, The specific process of step S5 is as follows: S5.1: Add the real identity to be added and use After encryption, it is added as a data item to the Merkle leaf node of the block body, waiting for the block to be packaged; S5.2: After all data items in the block body have been added, populate the relevant fields in the block header, including the hash value of the previous block, timestamp, block height, root hash value of the block body, and the list of real identities stored in this block; S5.3: After the relevant fields of the block header are filled in, the block header and block body are combined to form a complete block; S5.4: After verification by the consensus mechanism, the newly generated block is added to the blockchain; S5.5: Private Key The public key should be kept safe by the user; only the user holding the private key can decrypt it. Encrypted data.

5. A blockchain-based anonymous identity data storage method according to claim 2, characterized in that, The specific process of step S6 is as follows: S6.1: Based on the characteristics of B+ trees, the data items in the leaf nodes are arranged according to their keys. The numerical values ​​are arranged by comparing the key of the new data item with the key of the existing data items in the node to find the position of the leaf node to be inserted. S6.2: If the B+ tree is empty, i.e. If the node is empty, a new leaf node is created as the root node and data is inserted. If an insertion position is found, the new data item is inserted into the appropriate position, and the order of the data items in the node is adjusted to ensure that the data items are arranged in order of the numerical value of the key. S6.3: If inserting a new data item causes the number of data items in the current leaf node to exceed the capacity limit, a split operation is performed, dividing the current node into two parts. One part of the data items is kept in the original node, and the other part of the data items is moved to the newly created node. At the same time, the minimum key of the new node and the maximum key of the original node are moved up to the parent node.

6. A blockchain-based anonymous identity data storage method according to claim 2, characterized in that, The specific process of step S8 is as follows: S8.1: According to ,exist The process of retrieving data items corresponding to keywords is as follows: starting from the root node, the search path is determined by comparing the numerical values ​​of the keywords until the specified leaf node is reached. S8.2: If in If no data item corresponding to the keyword is found, execute S8.3; if in The corresponding data item was found in the middle, based on the data item's... Execute S8.4; S8.3: Retrieve the local block cache table, i.e., incomplete block bodies that have not yet been packaged and added to the blockchain. If the corresponding leaf node and data item are found in the block cache table, use them as the result for matching and authentication. If the corresponding leaf node and data item are not found in the block cache table, it means that the identity information is not stored in the system, and authentication fails. S8.4: According to The process involves retrieving the block header of the corresponding block, identifying the real identity in the Merkle tree of the block body based on the list of real identities in the block header, finding the corresponding leaf node and data item, using these as the result, and then applying the corresponding private key. After decryption, perform matching and authentication.

7. A blockchain-based anonymous identity data storage method according to claim 2, characterized in that, The specific process of step S9 is as follows: S9.1: Use exist Search and ; S9.2: Use Retrieving real identity and [other information] from the real identity storage module ; S9.3: Use Retrieve the associated proof from the anonymous identity storage module; S9.4: Using the identity corresponding to the real identity Uncover the true identity; S9.5: Using a symmetric key Decryption of the correlation proof; S9.6: Use Retrieve anonymous temporary identities from the anonymous identity storage module; S9.7: Verification is performed using real identity, proof of association, and anonymous temporary identity.

8. A blockchain-based anonymous identity data storage method according to claim 2, characterized in that, The specific process of step S10 is as follows: S10.1: Register a new anonymous temporary identity using the real identity and store it in the anonymous identity storage module, obtaining the CID as the new identity. ; S10.2: Use exist Search ,use Retrieving real identity and [other information] from the real identity storage module and utilize Decrypt; S10.3: Generate a new association proof and use a symmetric key Encryption is used to store the proof in the anonymous identity storage module, obtaining the CID as a new [identity]. ; S10.4: In Update and and A one-way index relationship.

9. A blockchain-based anonymous identity data storage method according to claim 2, characterized in that, In step S11, when a file exceeds its validity period, a node can stop providing access services to the file and delete it from its local machine. The availability of a file depends on the number of copies it has. As each node no longer actively provides the file to other nodes, the availability of the file will gradually decrease until all nodes eventually stop providing services to the file and delete it from their local machines.