Ubiquitous network data deduplication system supporting similarity data ownership verification
By generating similarity deduplication tags and chaotic map encryption in the ciphertext domain, combined with challenge generation and integrity evidence modules, the difficulties of similarity deduplication and ownership verification in existing technologies are solved, efficient data deduplication and integrity verification are achieved, replay attacks are prevented, and the security and reliability of the system are improved.
Patent Information
- Application Number
- CN202511029642.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-07-25
- Publication Date
- 2025-10-17
- Estimated Expiration
- 2045-07-25
AI Technical Summary
Existing technologies cannot efficiently identify and delete similar data in the ciphertext domain, cannot provide dynamic download proof of ownership, and find it difficult to quickly locate and recover tampered blocks. They cannot simultaneously meet the requirements of similarity deduplication, ownership verification, and efficient integrity verification in the end-cloud-chain closed loop.
The label generation module is used to generate similarity deduplication labels, the session key is generated through chaotic map encryption, the plaintext data block is encrypted, and similarity judgment and ownership verification are performed in the ciphertext domain. The challenge generation module and verification module are combined to prevent replay attacks, and the integrity evidence module is used to build tamper-proof evidence on the blockchain.
It achieves high-precision identification of similar data in the ciphertext domain, prevents plaintext leakage, improves storage space and network bandwidth utilization efficiency, prevents replay attacks, quickly locates tampered blocks and recovers them, and realizes efficient deduplication and integrity verification of the end-cloud-chain closed loop.
Smart Images

Figure CN120528579B_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of big data processing and network security, in particular to a ubiquitous network data deduplication system supporting similarity data ownership verification. BACKGROUND
[0002] In recent years, with the rapid development of ubiquitous networks such as Internet of Things, Internet of Vehicles, and Mobile Internet, the amount of data generated between terminals and clouds has increased exponentially. Various sensors, terminal devices, and applications continuously push massive heterogeneous data to cloud platforms, bringing great pressure on storage and transmission. To improve storage resource utilization and network bandwidth efficiency, the industry first proposed an exact-match deduplication technology based on precise matching. By comparing data block fingerprints or hash values one by one, the exact-match deduplication technology can achieve deduplication of identical data. With the increasing demand for "slight changes without duplication storage" in business scenarios, approximate deduplication methods such as local sensitive hashing (LSH) and SimHash are introduced to identify highly similar data in a fuzzy comparison manner. However, these solutions mostly operate in the plaintext domain or rely on searchable encryption technology, which can perform keyword retrieval in the ciphertext domain, but cannot directly perform efficient similarity deduplication. Attempts to use homomorphic encryption or verifiable homomorphic structures to perform similarity comparison in the ciphertext domain often fail to support online high-throughput environments due to the huge computational overhead, making it difficult to balance efficiency and privacy protection.
[0003] Although the combination of symmetric / public key encryption and deduplication technology protects plaintext privacy to some extent, it lacks dynamic permission control and ownership proof mechanisms, making it difficult for users to verify the legal ownership of similar data in real time after downloading, which is vulnerable to replay attacks and data theft risks. Existing integrity verification methods are mostly end-to-end packet-level hashes, which can detect whether the overall data has been tampered with, but cannot quickly locate the specific data block that has been tampered with in a block storage architecture. Although blockchain storage can achieve tamper-proof storage, it is usually separate from the deduplication process and cannot meet the needs of similarity deduplication, ownership verification, and efficient integrity verification in an end-to-cloud-chain closed loop. Therefore, the industry urgently needs a comprehensive deduplication solution that can accurately identify and delete similar data in the ciphertext domain, provide dynamic download ownership proof, and balance fast tampered block location and reliable recovery. SUMMARY
[0004] (I) The technical problem solved by the present application is to provide a ubiquitous network data deduplication system supporting similarity data ownership verification to solve the above problems.
[0005] (II) Technical solution: To achieve the above-mentioned purpose, the present invention provides the following technical solution: a ubiquitous network data deduplication system supporting similarity data ownership verification, characterized in that it includes: a label generation module for performing feature processing on the encrypted data block to be uploaded to obtain a similarity deduplication label for similarity determination and data ownership verification; a deduplication judgment module for performing a distance comparison between the similarity deduplication label and the historical similarity deduplication label stored on the server side, and performing a deduplication operation based on the comparison result; a challenge generation module for randomly generating a challenge message upon receiving a user's access request for the target data and sending it to the user; a proof calculation module for calculating a proof value based on the challenge message and the similarity deduplication label stored on the user side ; Verification module, used to calculate the verification value based on the corresponding similarity deduplication tags stored on the server , and authorizes the user to access if the verification is successful.
[0006] Furthermore, it also includes an encryption module for performing the following operations on the original plaintext data block to generate the ciphertext data block to be uploaded: constructing a two-dimensional chaotic map , its mapping function is: ;
[0007] Among them, the initial value and control parameters By the original plaintext data block Computed The hash value is obtained by mapping the front, middle and back sections; Previous iteration Step and discard the previous Step, quantize the iterative output to generate two groups Integer sequence, binarized and XORed Session Key ; Using the session key For the original plaintext data block Symmetric encryption is performed to generate the ciphertext data block to be uploaded.
[0008] Furthermore, the tag generation module includes: a feature extraction unit for extracting features from the encrypted data block to be uploaded and assigning a weight to each feature; a vector mapping unit for mapping each of the features into a hash value of fixed length and performing a hash operation on the hash value. arrive The symbol mapping is converted into a vector; a vector aggregation unit is used to perform weighted aggregation on all vectors according to the weight to obtain an aggregated vector; a symbol quantization unit is used to perform symbol determination on each dimension of the aggregated vector to generate a similarity hash value; a threshold writing unit is used to configure a similarity threshold for the similarity hash value to form a similarity deduplication label.
[0009] Furthermore, the vector mapping unit adopts The algorithm maps each of the features into a 256-bit hash value.
[0010] Furthermore, the distance comparison is specifically based on the Hamming distance between the similarity-based duplicate removal labels and the historical similarity-based duplicate removal labels. ; When the Hamming distance When the ciphertext data block to be uploaded is determined to be the same as the historical data stored on the server, and the index mapping between the ciphertext data block to be uploaded and the historical data is saved; when When the encrypted data block to be uploaded is determined to be similar to the historical data stored on the server, and a logical merger is performed; wherein, is the similarity threshold; when When the encrypted data block to be uploaded is determined to be dissimilar to the historical data stored on the server, the encrypted data block to be uploaded is stored in the server.
[0011] Furthermore, the challenge information includes a 128-bit binary first random vector and the second random vector , and random block numbers and .
[0012] Furthermore, the proof value Calculated by the following formula: ;In the formula, are stored on the user side. , No. Block similarity deduplication labeling, They are respectively the first random vector and the second random vector included in the challenge information.
[0013] Furthermore, the verification module determines the proof value provided by the user side. Validation value calculated on the server side If they are equal, the user is granted the download or access permission; otherwise, the user's download or access request is denied.
[0014] Furthermore, it also includes an integrity evidence module for calculating a block-level hash value for each encrypted data block to be uploaded, and constructing a binary The tree gets the root value ; The root value The corresponding similarity deduplication tags are uploaded to the blockchain to form an unalterable evidence.
[0015] Furthermore, when the user downloads the ciphertext data, the integrity evidence module further recalculates the root value of the downloaded data. , and in On the blockchain In case of inconsistency, the binary The tree path locates the damaged data block.
[0016] (III) Beneficial effects: Compared with the prior art, the present invention provides a ubiquitous network data deduplication system that supports similarity data ownership verification, which has the following beneficial effects: 1. The ubiquitous network data deduplication system that supports similarity data ownership verification introduces a similarity-based deduplication algorithm into the original plaintext data block before uploading. The high-entropy session key derivation and symmetric encryption of chaotic mapping completely eliminate the risk of plaintext leakage and achieve the security premise of similarity deduplication within the ciphertext domain. Next, the label generation module uses weighted aggregation and symbolic quantization to map each ciphertext data block to a thresholded similarity label, accurately capturing highly similar but not identical data features. The deduplication judgment module then uses a three-segment strategy based on the Hamming distance between similarity deduplication labels to distinguish between completely duplicated, nearly duplicated, and non-duplicate data. This eliminates redundancy while retaining necessary differences, significantly improving storage space and network bandwidth utilization, and overcoming the efficiency and accuracy limitations of traditional exact matching and existing approximate deduplication schemes.
[0017] 2. This ubiquitous network data deduplication system that supports similarity data ownership verification randomly issues unpredictable challenge information through the challenge generation module. The proof calculation module uses local similarity deduplication labels and challenges to dynamically generate proof values. The verification module strictly compares the proofs on the server side to confirm the legitimacy of the user, thereby preventing replay attacks and forged requests. It also takes into account performance and security without the need for expensive homomorphic encryption or trusted relays. In addition, the integrity evidence module is built in real time during the deduplication process. The tree will synchronize the root value and similarity label on the chain. After downloading, the user can quickly detect and verify by comparing the recalculated root value with the on-chain evidence. It can locate any damaged data blocks within the complexity, thereby realizing the end-cloud-chain closed loop of deduplication, ownership verification and integrity verification, significantly improving the reliability and availability of the system. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] Figure 1 Schematic diagram of the framework of the ubiquitous network data deduplication system that supports similarity data ownership verification provided by the present invention.
[0019] Figure 2 This is a schematic diagram of the encryption module of the ubiquitous network data deduplication system that supports similarity data ownership verification provided by the present invention.
[0020] Figure 3The support similarity data ownership verification ubiquitous network data deduplication system tag generation module structure schematic diagram provided by the present application.
[0021] Figure 4 The support similarity data ownership verification ubiquitous network data deduplication system similarity hash value algorithm flow schematic diagram provided by the present application.
[0022] Figure 5 The support similarity data ownership verification ubiquitous network data deduplication system integrity storage module schematic diagram provided by the present application.
[0023] Figure 6 The support similarity data ownership verification ubiquitous network data deduplication system binary tree storage structure schematic diagram provided by the present application. DETAILED DESCRIPTION
[0024] The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative labor fall within the protection scope of the present application.
[0025] In order to enable the person skilled in the art to better understand the present application scheme, the present application will be further described in detail below with reference to the drawings and specific embodiments.
[0026] Please refer to Figure 1 , Figure 1 The support similarity data ownership verification ubiquitous network data deduplication system framework schematic diagram provided by the present application, the support similarity data ownership verification ubiquitous network data deduplication system, comprising: a tag generation module, used for performing feature processing on a to-be-uploaded ciphertext data block to obtain a similarity deduplication tag used for similarity determination and data ownership verification; a deduplication decision module, used for comparing the similarity deduplication tag with a historical similarity deduplication tag stored on a server side, and performing a deduplication operation according to a comparison result; a challenge generation module, used for generating challenge information randomly and sending the challenge information to a user when receiving an access request of the user to target data; a proof calculation module, used for calculating a proof value according to the challenge information and a similarity deduplication tag stored on a user side ; a verification module, used for calculating a verification value according to a corresponding similarity deduplication tag stored on the server side , and authorizing the user to access when the verification is successful.
[0027] Further, please refer to Figure 2 , Figure 2The schematic diagram of the encryption module of the ubiquitous network data deduplication system supporting similarity data ownership verification provided by the present invention shows the location of the encryption module in the system; the encryption module is used to perform the following operations on the original plaintext data block to generate the ciphertext data block to be uploaded: construct a two-dimensional chaotic map , its mapping function is: , where the initial value and control parameters By the original plaintext data block Computed The hash value is obtained by mapping the front, middle and back sections; Previous iteration Step and discard the previous Step, quantize the iterative output to generate two groups Integer sequence, binarized and XORed Session Key ; Using the session key For the original plaintext data block Symmetric encryption is performed to generate the ciphertext data block to be uploaded.
[0028] Specifically, the encryption module first performs an encryption on the original plaintext data block. Call The algorithm calculates a 256-bit hash value , and The first 64 bits, middle 64 bits, and last 128 bits are mapped to two-dimensional chaotic maps as follows: Initial value of and control parameters : ; Subsequently, the module Previous iteration , enhance the randomness of the sequence, discard the first 1000 values, and only retain the last 128 groups of mapping results to obtain two random sequences ; Then process the random sequence as follows: ; Among them, 128 integers from 0 to 255 are obtained, among which, The disturbance parameter added by the user is set to 13 in this embodiment of the present invention. The function is a floor function. The function is the absolute value function. and Perform binarization processing: ;in, The function represents the conversion to binary, and finally obtains a binary random sequence ; Then take a random sequence The first bit of each binary random number in the binary random number is used to obtain two 128-bit random numbers. and , and XOR to get the symmetric session key of this data block : ;Finally, the encryption module uses the session key For the original plaintext data block Perform encryption processing to generate ciphertext data blocks to be uploaded .
[0029] For further information, see Figures 3-4 , Figure 3 This is a schematic diagram of the structure of the label generation module of the ubiquitous network data deduplication system that supports similarity data ownership verification provided by the present invention. Figure 3 The sub-unit structure of the label generation module is shown. Figure 4 The example process of generating similarity hash values is shown. The label generation module includes: a feature extraction unit for extracting features from the encrypted data block to be uploaded and assigning weights to each feature; a vector mapping unit for mapping each feature into a hash value of fixed length and performing a vector operation on the hash value. arrive The symbol mapping is converted into a vector; a vector aggregation unit is used to perform weighted aggregation on all vectors according to the weight to obtain an aggregated vector; a symbol quantization unit is used to perform symbol determination on each dimension of the aggregated vector to generate a similarity hash value; a threshold writing unit is used to configure a similarity threshold for the similarity hash value to form a similarity deduplication label.
[0030] Wherein, the vector mapping unit adopts The algorithm maps each of the features into a 256-bit hash value.
[0031] Specifically, the label generation module first treats the uploaded ciphertext data block Perform word segmentation feature extraction to generate feature sets , and for each feature Assign preset weights ; Subsequently, the vector mapping unit uses The algorithm performs the following operations on each original feature: Calculate fixed-length 256-bit hash values respectively , and the hash value The "1" bit in is mapped to +1 and the "0" bit is mapped to -1, thus converting to the corresponding Dimension vector , the formula is as follows: ; Then the vector aggregation unit is based on each feature The weight of For all mapped vectors Perform weighted summation at the element level to obtain the aggregate vector representing the global similarity feature of the data block , the formula of this process is as follows: ; Then, the symbol quantization unit aggregates the vector Perform sign determination on each dimension, quantize non-negative elements to "1" and negative elements to "0", and generate the final similarity hash value No. The formula is: ;Finally get a 256-bit similarity hash value , by using The function enhances the anti-collision property of the hash value and avoids text collisions caused by shorter strings or data. Finally, the threshold writing unit compares the similarity hash value with the pre-set similarity threshold. Packing to get similarity deduplication labels .
[0032] Furthermore, in the deduplication decision module, the distance comparison is specifically based on the Hamming distance between the similarity-based deduplication label and the historical similarity-based deduplication label. .
[0033] When the Hamming distance When the ciphertext data block to be uploaded is determined to be the same as the historical data stored on the server, the index mapping between the ciphertext data block to be uploaded and the historical data is saved.
[0034] when When the encrypted data block to be uploaded is determined to be similar to the historical data stored on the server, and a logical merger is performed; wherein, is the similarity threshold.
[0035] when When the encrypted data block to be uploaded is determined to be dissimilar to the historical data stored on the server, the encrypted data block to be uploaded is stored in the server.
[0036] Specifically, the deduplication judgment module obtains the 256-bit similarity hash value output by the label generation module And the historical similarity deduplication tags stored on the server side and the historical similarity deduplication tags stored on the server side , and compare the two bit by bit. Bit: ;
[0037] The Hamming distance is then calculated by summing the encoded values of all bits: ;
[0038] Then the obtained Similarity threshold in similarity removal label For comparison, similarity threshold The value of The change relationship takes the best value: when When the data corresponding to the two are determined to be exactly the same, only their index mapping is recorded to avoid duplicate storage.
[0039] when When the data is determined to be similar, a logical merge is performed at the storage layer, that is, only the reference relationship is retained without writing a new data entity.
[0040] when When the encrypted data block to be uploaded is determined to be dissimilar to the historical data stored on the server, the encrypted data block is completely written to the server.
[0041] Furthermore, in the challenge generation module, the challenge information includes a 128-bit binary first random vector and the second random vector , and random block numbers and The proof value Calculated by the following formula: ;
[0042] In the formula, are stored on the user side. , No. Block similarity deduplication labeling, They are respectively the first random vector and the second random vector included in the challenge information.
[0043] Specifically, after receiving the user's access request to the target ciphertext data block, the challenge generation module first calls the secure pseudo-random number generator to generate two independent 128-bit random vectors and To ensure the unpredictability of each verification; then, the module is based on the total number of the current ciphertext data block , two block numbers are selected uniformly randomly , and The challenge information is packaged and sent to the user. After receiving the challenge, the user can use the locally stored Block similarity deduplication label and Calculate the proof value together This ensures sufficient randomness and diversity of the challenge, preventing replay attacks and forged requests.
[0044] Furthermore, in the verification module, the verification module determines the proof value provided by the user side. Validation value calculated on the server side If they are equal, the user is granted the download or access permission; otherwise, the user's download or access request is denied.
[0045] Specifically, the verification module receives the proof value submitted by the user Then, first read the sequence number in the challenge information from the server-side tag storage Corresponding similarity deduplication labels , and then call it in the same way as on the user side Function pair Perform calculations to generate server-side verification values ; The module will then User Submissions A byte-by-byte comparison is performed. If they are completely consistent, a one-time authorization token is generated in the access control component and the download or access channel of the target data is opened; if they are inconsistent, the request is immediately rejected, the download permission is waived, and the forgery or abnormal attempt is optionally recorded in the security log to achieve effective protection against unauthorized or replay attacks.
[0046] Furthermore, the present invention also includes an integrity evidence module, please refer to Figures 5-6 , Figure 5 Schematic diagram of the integrity evidence storage module of the ubiquitous network data deduplication system that supports similarity data ownership verification provided by the present invention; Figure 6 Schematic diagram of the binary tree storage structure of the ubiquitous network data deduplication system supporting similarity data ownership verification provided by the present invention; the integrity evidence module is called after the deduplication judgment is completed and the ciphertext data block to be stored is confirmed. The integrity evidence module is used to: calculate the block-level hash value for each ciphertext data block to be uploaded, and construct a binary tree with the block-level hash value The tree gets the root value ; The root value The corresponding similarity deduplication tags are uploaded to the blockchain to form an unalterable evidence.
[0047] When the user downloads the encrypted data, the integrity evidence module further recalculates the root value of the downloaded data. , and in On the blockchain In case of inconsistency, the binary The tree path locates the damaged data block.
[0048] Specifically, the integrity evidence module first checks each encrypted data block to be uploaded Call The algorithm calculates the block-level hash value and constructs a binary tree with all block hashes as leaf nodes in the order of upload. Tree: Each pair of child node hashes are concatenated and then Calculate the parent node hash until the root node hash Generation is complete; the module then uses the root hash value and the corresponding similarity deduplication labels The data is packaged together as a record of evidence, and the pre-configured smart contract or transaction interface is called by the blockchain client to write the record into the blockchain network, thus realizing the tamper-proof evidence of the stored data batch. After the user completes the ownership verification and initiates the data download, the integrity evidence module is triggered again to perform the download integrity check. Specifically, the module first downloads the root hash stored on the blockchain. , and then recalculate the hash value for each ciphertext data block received by the client and follow the original The tree paths are calculated pairwise upwards to the root to obtain the regenerated root hash ; then On the blockchain Compare them. If they are consistent, it is confirmed that the downloaded data has not been tampered with. If they are inconsistent, Path differences can quickly locate the specific damaged leaf node number, making it easier for the system or user to initiate retransmission or repair operations for the block, thereby achieving efficient tampering detection and accurate damaged block location in a massive block storage environment.
[0049] It should be noted that, in this document, relational terms such as first and second, etc., are used only to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply the existence of any such actual relationship or order between these entities or operations. Moreover, the terms "comprises," "comprising," or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article, or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or device. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article, or device comprising the element.
[0050] While embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions, and variations may be made to these embodiments without departing from the principles and spirit of the invention, and that the scope of the invention is defined by the appended claims and their equivalents.
Claims
1. A ubiquitous network data deduplication system that supports similarity data ownership verification, characterized by: include: The label generation module is used to perform feature processing on the uploaded ciphertext data blocks to obtain similarity deduplication labels for similarity determination and data ownership verification; The similarity deduplication tags are stored on the user side and the server side respectively; A deduplication judgment module is used to compare the distance between the similarity deduplication label and the historical similarity deduplication label stored on the server side, and perform a deduplication operation based on the comparison result; A challenge generation module is used to randomly generate challenge information and send it to the user when receiving a user's access request for target data; The proof calculation module is used to calculate the proof value based on the challenge information and the similarity deduplication tags stored on the user side ; Verification module, used to calculate verification value based on the corresponding similarity deduplication tags stored on the server , and authorize user access when verification is successful; The challenge information includes a 128-bit binary first random vector and the second random vector , and random block numbers and The proof value Calculated by the following formula: ;In the formula, are stored on the user side. , No. Block similarity deduplication labeling, are respectively a first random vector and a second random vector included in the challenge information; The verification module determines the proof value provided by the user Validation value calculated on the server side If they are equal, the user is granted the download or access permission; otherwise, the user's download or access request is denied; The tag generation module includes: a feature extraction unit for extracting features from the encrypted data block to be uploaded and assigning weights to each feature; a vector mapping unit for mapping each feature into a hash value of fixed length and performing a vector operation on the hash value. arrive The symbol mapping is converted into a vector; a vector aggregation unit is used to perform weighted aggregation on all vectors according to the weight to obtain an aggregated vector; a symbol quantization unit is used to perform symbol determination on each dimension of the aggregated vector to generate a similarity hash value; a threshold writing unit is used to configure a similarity threshold for the similarity hash value to form a similarity deduplication label; The distance comparison is specifically based on the Hamming distance between the similarity-based duplicate removal labels and the historical similarity-based duplicate removal labels. ; When the Hamming distance When the ciphertext data block to be uploaded is determined to be the same as the historical data stored on the server, and the index mapping between the ciphertext data block to be uploaded and the historical data is saved; when When the encrypted data block to be uploaded is determined to be similar to the historical data stored on the server, and a logical merger is performed; wherein, is the similarity threshold; when When the encrypted data block to be uploaded is determined to be dissimilar to the historical data stored on the server, the encrypted data block to be uploaded is stored in the server.
2. The ubiquitous network data deduplication system supporting similarity data ownership verification according to claim 1 is characterized in that: It also includes an encryption module for performing the following operations on the original plaintext data block to generate the ciphertext data block to be uploaded: constructing a two-dimensional chaotic map , its mapping function is: ; Among them, the initial value and control parameters By the original plaintext data block Computed The hash value is obtained by mapping the front, middle and back sections; Previous iteration Step and discard the previous Step, quantize the iterative output to generate two groups Integer sequence, binarized and XORed Session Key ; Using the session key For the original plaintext data block Symmetric encryption is performed to generate the ciphertext data block to be uploaded.
3. The ubiquitous network data deduplication system supporting similarity data ownership verification according to claim 1 is characterized in that: The vector mapping unit adopts The algorithm maps each of the features into a 256-bit hash value.
4. The system according to any one of claims 1 to 3, characterized in that: It also includes an integrity evidence module for: calculating a block-level hash value for each encrypted data block to be uploaded, and constructing a binary The tree gets the root value ; The root value The corresponding similarity deduplication tags are uploaded to the blockchain to form an unalterable evidence.
5. The ubiquitous network data deduplication system supporting similarity data ownership verification according to claim 4 is characterized in that: When the user downloads the encrypted data, the integrity evidence module further recalculates the root value of the downloaded data , and in On the blockchain In case of inconsistency, the binary The tree path locates the damaged data block.
Citation Information
Patent Citations
Cloud storage security deduplication method and device based on Merkel hash tree
CN112565434A
Image encryption method and device based on novel two-dimensional composite chaotic mapping and SHA-256
CN113538203A
Ciphertext deduplication and decentration auditing method based on block chain
CN115037530A
Ciphertext duplicate checking and storage method based on homomorphic encryption and Simhash
CN116070276A
