Dynamic updating cloud auditing method based on chameleon hash function

Through the chameleon hash function and blockchain technology, the problems of data loss and low audit efficiency in cloud storage are solved, and efficient and dynamic update audit of medical data without relying on third-party audit agencies is realized, ensuring data security and consistency.

CN119011225AActive Publication Date: 2024-11-22SOUTHWEST PETROLEUM UNIV

Patent Information

Application Number
CN202411028281.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-30
Publication Date
2024-11-22
Estimated Expiration
2044-07-30

AI Technical Summary

Technical Problem

In smart healthcare, cloud storage data has problems such as loss, inconsistency and low audit efficiency. Traditional audit solutions rely on third-party agencies and are difficult to support dynamic updates.

Method used

Adopt a dynamic update cloud audit method based on chameleon hash function, and use blockchain and Merkel hash tree to realize encrypted storage and audit of data, ensure data integrity through bilinear mapping verification, and do not rely on third-party audits. efficient audits in the case of an institution.

Benefits of technology

It realizes efficient audit of secure storage and dynamic updates of medical data, reduces costs, avoids data loss and inconsistency, and improves audit efficiency and massive data processing capabilities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119011225A_ABST
    Figure CN119011225A_ABST
Patent Text Reader

Abstract

The invention discloses a dynamic update cloud auditing method based on a chameleon hash function, and relates to the technical field of information security. Comprising the following steps: an initialization stage: a certain user in a system initializes system parameters, and then all users generate public and private key pairs with corresponding functions; in the data uploading stage, the system user uploads the encrypted medical data to the CSP end and adds a new block for the editable block chain system; a data auditing stage: after a system user entrusts an auditor to return Rootrbc and a CSP to return Rootcsp, verifying bilinear mapping and comparing whether the bilinear mapping is equal or not; and a block editing stage: when the medical data file of the patient is changed, updating contents involved in the CSP and the editable block chain. According to the method, the medical data stored by the system user can be protected, the medical data can be audited without depending on a third-party auditing mechanism, mass data can be audited efficiently, and the medical data dynamically updated by the system user can be audited.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of information security technology, and in particular to a dynamic update cloud audit method based on a chameleon hash function. Background Art

[0002] Cloud storage is an online storage mode, which means storing data on multiple virtual servers hosted by a third party. This mode can be applied in online education, smart healthcare, smart government affairs, team collaboration and other fields. In the medical field of electronic medical records, medical images and experimental data storage, cloud storage services can realize the centralized management and sharing of medical data, provide data backup and recovery services for medical institutions, and ensure the security of patient data, which has received widespread attention. However, medical data stored on a single server will face the potential risk of data loss or tampering, and when sharing and synchronizing data between multiple systems and applications, data inconsistency may occur. Some scholars have proposed cloud audit services that check and record operations on stored data. Traditional cloud audit services need to rely on third-party audit agencies (TPA), which have high costs and entity trust issues. In addition, the existing audit scheme uses bilinear mapping verification, which has problems of low efficiency and high overhead. At the same time, with the increase of patient data in medical institutions, traditional audit schemes cannot audit dynamically updated data. In summary, smart healthcare needs to be improved in terms of data storage security, consistency, efficiency and audit after data update. Summary of the invention

[0003] The purpose of the present invention is to overcome the shortcomings of the prior art and provide a dynamically updated cloud audit method based on the chameleon hash function, which aims to prevent user data loss while achieving a low-cost and dynamically updated efficient and fast integrity audit solution.

[0004] The objective of the present invention is achieved through the following technical solutions:

[0005] A dynamically updated cloud audit method based on a chameleon hash function, comprising:

[0006] Initialization phase: System users initialize system parameters, generate and broadcast the genesis block to the editable blockchain network, and cloud storage service providers CSP and all users generate public and private key pairs for corresponding functions;

[0007] Data upload stage: System users upload encrypted medical data to the cloud storage service provider CSP and add new blocks to the editable blockchain network;

[0008] Data audit stage: The auditor calculates the corresponding block of medical data and returns the storage proof on the editable blockchain rbc ; The system user sends an audit challenge to the cloud storage service provider CSP, and entrusts an auditor to audit the medical data and generate challenge information; After receiving the challenge, the cloud storage service provider CSP decrypts the medical data file, builds the Merkle hash tree MHT, and returns the storage proof Proof in the cloud server to the system user csp , the system user verifies the bilinear mapping and then compares the MHT value Root of the corresponding block in the editable blockchain rbc MHT root built with cloud server csp whether they are equal;

[0009] Block editing stage: When the patient's medical data file changes, the content involved in the cloud storage service provider CSP and the editable blockchain network is updated.

[0010] Furthermore, the initialization phase includes:

[0011] 1) Choose the Gap Diffie-Hellman group G and the multiplicative cyclic group G of prime order p T , generating a bilinear map e: G×G→G T , where the generator of G is g, and the hash function is selected and H 3 : {0, 1} * →G, select random function and

[0012] 2) Generate the public and private key pair (pk ch ,sk ch ), that is, select the private key Calculate the public key pk ch :y=g x ; Generate public parameters Calculate Genesis Block B 0 The hash value h 0 =H 2 (pp||v 0 ), where v 0 It is the random number that allows the block to be put on the chain; broadcast the genesis block B 0 =(h 0 , v 0 ,pp) to an editable blockchain network;

[0013] 3) The cloud storage service provider CSP generates a public-private key pair (cpk, csk) for file encryption and decryption and a public-private key pair (spk′, ssk′) for signing;

[0014] 4) All users generate a random public and private key pair (spk, ssk), and then select a random value As a partial private key, and calculate the partial public key ψ = g β , forming a private key sk = (β, ssk) and a public key pk = (ψ, spk); generating a public-private key pair (sk′, pk′) used by the auditor for signing.

[0015] Furthermore, the data uploading stage includes:

[0016] 1) Divide the medical data file F into n fixed-size data blocks ω i , that is, F = ω 1 ,ω 2 , ..., ω i , ..., ω n , i∈(1,n); use the public key cpk of the cloud storage service provider CSP to store the data block ω i Encrypted to get the secret value e i , that is, e i =Encrypt cpk (ω i ); select a random value ρ←G and calculate the secret value e i The signature σ i ,Right now

[0017] 2) Set the secret file F′=e 1 , e 2 , ..., e i , ..., e n , and the signature σ i Upload to cloud storage service provider CSP; store files F and σ locally i The mapping index is used for subsequent reconstruction of files;

[0018] 3) Calculate the label of the secret value according to the order of uploaded data blocks, i.e., δ i =H 3 (e i ), the user ID number U ID , label set δ = {δ i}Broadcast as a transaction to the editable blockchain network;

[0019] 4) Other data owners act as data verification verifiers. The data verification verifiers will verify all the labels δ in the label set δ. i Then form the Merkle hash tree MHT and get the root value m i ;

[0020] 5) Data verification verifier selects the adaptation value Calculate the current file Fi Corresponding block B i Chameleon hash function value: where h i-1 =H 2 (ch i-1 , v i-1 ), add new block B i =(h i-1 ,ch i , m i , r i ,s i ) to an editable blockchain network.

[0021] Furthermore, the data audit stage includes:

[0022] 1) The auditor uses the user ID U ID Positioning system user medical data F i The corresponding block B i , by establishing MHT to obtain Root rbc , and returns Proof rbc To system users, where Proof rbc ={Root rbc , sig sk′ (H 3 (Root rbc ))};

[0023] 2) The system user sends an audit challenge to the cloud storage service provider CSP and entrusts an auditor to audit the medical data and generate a challenge, i.e., chal = {z, l 1 , l 2} 1≤z≤n ,in

[0024] 3) After receiving the challenge, the cloud storage service provider CSP first calculates the index and coefficient Then decrypt the medical data file i ω i ,calculate The aggregate signature is

[0025] 4) The cloud storage service provider CSP calculates the secret value e i The label is used to construct the Merkle hash tree MHT and obtain the root value of the Merkle hash tree Root csp , return Proof csp ={ σ, Root csp , sig ssk′ (H3 (Root csp ))} to system users;

[0026] 5) System users receive Proof rbc and Proof csp Then, check the bilinear map in If established, verify If all are true, the audit is passed.

[0027] Furthermore, the block editing stage includes:

[0028] 1) The system user re-downloads the patient data file, modifies it and uploads the latest data file;

[0029] 2) When updating the content of the block with data block number π, the system user broadcasts the new data block e′ π After receiving the label, the data verification verifier replaces the label and constructs MHT to generate a new Merkle hash tree root value m′ π ;

[0030] 3) The data verification verifier calculates the long-term trapdoor key k of the block π =s π +H 1 (h π-1 ||m π , r π )·x π mod p, where (s π , r π ) is the original adaptation value, h π-1 is the hash value of the previous block, m π is the root value of the block’s MHT, x π is the Chameleon hash function public key; then choose the temporary trapdoor key Calculate s′ π =k π -H 1 (h π-1 ||m′ π , r′ π )·x π mod p, where m′ π Is the new MHT root value, generating the corresponding block B π =(h π-1 ,ch π , m π , r π ,s π ) is B′ π =(h π-1 ,ch π , m′ π, r′ π , s′ π ).

[0031] Furthermore, the proof process of the bilinear mapping is as follows:

[0032] Given: ψ = g β , chal={z,l 1 , l 2} 1≤z≤n ,

[0033] Proof process:

[0034] The beneficial effects of the present invention are:

[0035] Compared with existing auditing schemes, the present invention overcomes several major difficulties in traditional cloud data storage auditing: 1) Cloud storage in traditional cloud auditing schemes relies on a single CSP, which is prone to losing the medical data of system users; 2) Mainstream auditing schemes rely on third-party auditing agencies, which have problems of high cost and entity trust; 3) Existing auditing schemes can usually only audit part of the data, and have poor performance when auditing massive amounts of data; 4) Current auditing schemes are difficult to cope with the update of system users' medical data, and there is still room for improvement in dynamic update support.

[0036] Compared with the existing cloud auditing solutions that support dynamic data updates, the present invention 1) can protect the medical data stored by system users; 2) can audit medical data without relying on a third-party auditing agency; 3) can efficiently audit massive amounts of data; and 4) can audit medical data dynamically updated by system users. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 A system model diagram of the dynamic update cloud audit method based on the chameleon hash function of the present invention;

[0038] Figure 2 It is the structure of Merkle Hash Tree (MHT);

[0039] Figure 3 A schematic diagram of the structure of an editable blockchain. DETAILED DESCRIPTION

[0040] The technical solution of the present invention will be clearly and completely described below in conjunction with the embodiments. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0041] See also Figure 1-Figure 3 , the present invention provides a technical solution:

[0042] The objective of the present invention is achieved through the following technical solutions:

[0043] A dynamic update cloud audit method based on chameleon hash function. The system model is shown in the figure Figure 1 As shown, including:

[0044] S1: Initialization phase: System users initialize system parameters, generate and broadcast the genesis block to the editable blockchain network, and the cloud storage service provider CSP and all users generate public and private key pairs for corresponding functions; in this embodiment, the initialization phase includes:

[0045] 1) Choose the Gap Diffie-Hellman group G and the multiplicative cyclic group G of prime order p T , generating a bilinear map e: G×G→G T , where the generator of G is g, and the hash function is selected and H 3 : {0, 1} * →G, select random function and

[0046] 2) Generate the public and private key pair (pk ch ,sk ch ), that is, select the private key Calculate the public key pk ch :y=g x ; Generate public parameters Calculate Genesis Block B 0 The hash value h 0 =H 2 (pp||v 0 ), where v 0 It is the random number that allows the block to be put on the chain; broadcast the genesis block B 0 =(h 0 , v 0 ,pp) to an editable blockchain network;

[0047] 3) The cloud storage service provider CSP generates a public-private key pair (cpk, csk) for file encryption and decryption and a public-private key pair (spk′, ssk′) for signing;

[0048] 4) All users generate a random public and private key pair (spk, ssk), and then select a random value As a partial private key, and calculate the partial public key ψ = g β , forming a private key sk = (β, ssk) and a public key pk = (ψ, spk); generating a public-private key pair (sk′, pk′) used by the auditor for signing.

[0049] S2: Data upload stage: The system user uploads the encrypted medical data to the cloud storage service provider CSP and adds a new block to the editable blockchain network; in this embodiment, the data upload stage includes:

[0050] 1) Divide the medical data file F into n fixed-size data blocks ω i , that is, F = ω 1 ,ω 2 , ..., ω i , ..., ω n , i∈(1,n); use the public key cpk of the cloud storage service provider CSP to store the data block ω i Encrypted to get the secret value e i , that is, e i =Encrypt cpk (ω i ); select a random value ρ←G and calculate the secret value e i The signature σ i ,Right now

[0051] 2) Set the secret file F′=e 1 , e 2 , ..., e i , ..., e n , and the signature σ i Upload to cloud storage service provider CSP; store files F and σ locally i The mapping index is used for subsequent reconstruction of files;

[0052] 3) Calculate the label of the secret value according to the order of uploaded data blocks, i.e., δ i =H 3 (e i ), the user ID number U ID , label set δ = {δ i}Broadcast as a transaction to the editable blockchain network;

[0053] 4) Other data owners act as data verification verifiers. The data verification verifiers will verify all the labels δ in the label set δ. i Then form the Merkle hash tree MHT and get the root value m i In some specific embodiments, the Merkle hash tree MHT structure created by eight transaction data values ​​is as follows: Figure 2 As shown, the root value m of the Merkle hash tree MHT is finally generated i ;

[0054] 5) Data verification verifier selects the fitness value Calculate the current file F i Corresponding block B i Chameleon hash function value: where h i-1 =H 2 (ch i-1 , v i-1 ), add new block B i =(h i-1 ,ch i , m i , r i ,s i ) to an editable blockchain network.

[0055] Cloud Service Provider (CSP) can effectively manage the remote data of data uploaders and save local storage space. This work uses dual CSP to ensure the secure storage of data and avoid the risk of data loss caused by single point failure attacks.

[0056] S3: Data audit stage: The auditor calculates and returns Proof based on the corresponding block of medical data rbc ; The system user sends an audit challenge to the cloud storage service provider CSP, and entrusts an auditor to audit the medical data and generate challenge information; After receiving the challenge, the cloud storage service provider CSP decrypts the medical data file, builds the Merkle hash tree MHT and returns the Root csp , the system user verifies the bilinear mapping and then compares the Root rbc and Root csp In this embodiment, the data audit stage includes:

[0057] 1) The auditor uses the user ID U ID Positioning system user medical data F i The corresponding block B i , by establishing MHT to obtain Root rbc , return Proof rbc To system users, where Proofrbc ={Root bc , sig sk′ (H 3 (Root bc ))};

[0058] 2) The system user sends an audit challenge to the cloud storage service provider CSP and entrusts an auditor to audit the medical data and generate a challenge, i.e., chal = {z, l 1 , l 2} 1≤z≤n ,in

[0059] 3) After receiving the challenge, the cloud storage service provider CSP first calculates the index and coefficient Then decrypt the medical data file i ω i ,calculate The aggregate signature is

[0060] 4) The cloud storage service provider CSP calculates the secret value e i The label is used to construct the Merkle hash tree MHT and obtain the root value of the Merkle hash tree Root csp , return Proof csp ={ σ, Root csp , sig ssk′ (H 3 (Root csp ))} to system users;

[0061] 5) System users receive Proof rbc and Proof csp Then, check the bilinear map in If established, verify If all are true, the audit is passed.

[0062] The proof process of bilinear mapping is as follows:

[0063] Given: ψ = g β , chal={z,l 1 , l 2} 1≤z≤n ,

[0064] Proof process:

[0065] In order to reduce the high cost and entity trust issues caused by TPA audits, the present invention uses blockchain technology to design a new public audit scheme to replace TPA. e , MHT) structure for auditing, which speeds up audit efficiency and reduces audit expenses.

[0066] S4: Block editing stage: When the patient's medical data file changes, update the content involved in the cloud storage service provider CSP and the editable blockchain network. In this embodiment, the block editing stage specifically includes:

[0067] 1) The system user re-downloads the patient data file, modifies it and uploads the latest data file;

[0068] 2) When updating the content of the block with data block number π, the system user broadcasts the new data block e′ π After receiving the label, the data verification verifier replaces the label and constructs MHT to generate a new Merkle hash tree root value m′ π ;

[0069] 3) The data verification verifier calculates the long-term trapdoor key k of the block π =s π +H 1 (h π-1 ||m π , r π )·x π mod p, where (s π , r π ) is the original adaptation value, h π-1 is the hash value of the previous block, m π is the root value of the block’s MHT, x π is the Chameleon hash function public key; then choose the temporary trapdoor key Calculate s′ π =k π -H 1 (h π-1 ||m′ π , r′ π )·x π mod p, where m′ π Is the new MHT root value, generating the corresponding block B π =(h π-1 ,ch π , m π , r π ,s π ) is B′ π =(h π-1 ,ch π , m′π , r′ π , s′ π ).

[0070] The structure of the editable blockchain network is as follows Figure 3 As shown, Block Hash h i is the hash value of the block, that is, the chameleon hash value ch of the block i And the random number Nonce v on the block chain i Perform hash operation; the chameleon hash value ch of the block i is the block hash value h of the previous block i-1 、MHT root value m of the current block i and the fitness value of the chameleon hash function (s i , r i ) performs chameleon hash calculation, where (s i , r i ) Adaptive value means that by adjusting this pair of values, the Chameleon hash function can produce the same output after different inputs; Hash.Pre h i-1 It is the hash value of the previous block.

[0071] The present invention introduces an editable blockchain based on the chameleon hash function to support auditing of updated data, solving the auditing problem caused by the increase of patient data.

[0072] Compared with existing auditing schemes, the present invention overcomes several major difficulties in traditional cloud data storage auditing: 1) Cloud storage in traditional cloud auditing schemes relies on a single CSP, which is prone to losing the medical data of system users; 2) Mainstream auditing schemes rely on third-party auditing agencies, which have problems of high cost and entity trust; 3) Existing auditing schemes can usually only audit part of the data, and have poor performance when auditing massive amounts of data; 4) Current auditing schemes are difficult to cope with the update of system users' medical data, and there is still room for improvement in dynamic update support.

[0073] Compared with the existing cloud auditing solutions that support dynamic data updates, the present invention 1) can protect the medical data stored by system users; 2) can audit medical data without relying on a third-party auditing agency; 3) can efficiently audit massive amounts of data; and 4) can audit medical data dynamically updated by system users.

[0074] The above is only a preferred embodiment of the present invention. It should be understood that the present invention is not limited to the form disclosed herein, and should not be regarded as excluding other embodiments, but can be used in various other combinations, modifications and environments, and can be modified within the scope of the concept described herein through the above teachings or the technology or knowledge of the relevant field. The changes and modifications made by those skilled in the art shall not deviate from the spirit and scope of the present invention, and shall be within the scope of protection of the claims attached to the present invention.

Claims

1. A dynamic update cloud audit method based on chameleon hash function, characterized in that: include: Initialization phase: System users initialize system parameters, generate and broadcast the genesis block to the editable blockchain network, and cloud storage service providers CSP and all users generate public and private key pairs for corresponding functions; Data upload stage: System users upload encrypted medical data to the cloud storage service provider CSP and add new blocks to the editable blockchain network; Data audit stage: The auditor calculates the corresponding block of medical data and returns the storage proof on the editable blockchain rbc ; The system user sends an audit challenge to the cloud storage service provider CSP, and entrusts an auditor to audit the medical data and generate challenge information; After receiving the challenge, the cloud storage service provider CSP decrypts the medical data file, builds the Merkle hash tree MHT, and returns the storage proof Proof in the cloud server to the system user csp , the system user verifies the bilinear mapping and then compares the MHT value Root of the corresponding block in the editable blockchain rbc MHT root built with cloud server csp whether they are equal; Block editing stage: When the patient's medical data file changes, the content involved in the cloud storage service provider CSP and the editable blockchain network is updated.

2. A dynamically updated cloud audit method based on chameleon hash function according to claim 1, characterized in that: The initialization phase includes: 1) Choose the Gap Diffie-Hellman group G and the multiplicative cyclic group G of prime order p T , generating a bilinear map e:G×G→G T , where the generator of G is g, and the hash function is selected and H3:{0,1} * →G, select random function and 2) Generate the public and private key pair (pk ch ,sk ch ), that is, select the private key Calculate the public key pk ch :y=g x ; Generate public parameters Calculate the hash value of the genesis block B0 h0=H2(pp||v0), where v0 is the random number that allows the block to be put on the chain; broadcast the genesis block B0=(h0,v0,pp) to the editable blockchain network; 3) The cloud storage service provider CSP generates a public-private key pair (cpk, csk) for file encryption and decryption and a public-private key pair (spk', ssk') for signing; 4) All users generate a random public and private key pair (spk, ssk), and then select a random value As a partial private key, and calculate the partial public key ψ = g β , forming the private key sk = (β, ssk) and the public key pk = (ψ, spk); generating the public-private key pair (sk', pk') used by the auditor for signing.

3. A dynamic update cloud audit method based on chameleon hash function according to claim 2, characterized in that: The data uploading stage includes: 1) Divide the medical data file F into n fixed-size data blocks ω i , that is, F=ω1,ω2,...,ω i , ..., ω n , i∈(1,n); use the public key cpk of the cloud storage service provider CSP to store the data block ω i Encrypted to get the secret value e i , that is, e i =Encrypt cpk (ω i ); select a random value ρ←G and calculate the secret value e i The signature σ i ,Right now 2) Set the encrypted file F′=e1, e2, ..., e i , ..., e n , and the signature σ i Upload to cloud storage service provider CSP; store files F and σ locally i The mapping index is used for subsequent reconstruction of files; 3) Calculate the label of the secret value according to the order of uploaded data blocks, i.e., δ i =H3(e i ), the user ID number U ID , label set δ = {δ i }Broadcast as a transaction to the editable blockchain network; 4) Other data owners act as data verification verifiers. The data verification verifiers will verify all the labels δ in the label set δ. i Then form the Merkle hash tree MHT and get the root value m i ; 5) Data verification verifier selects the fitness value Calculate the current file F i Corresponding block B i Chameleon hash function value: where h i-1 =H2(ch i-1 , v i-1 ), add new block B i =(h i-1 ,ch i , m i , r i ,s i ) to an editable blockchain network.

4. A method for dynamically updating cloud auditing based on chameleon hash function according to claim 3, characterized in that: The data audit phase includes: 1) The auditor uses the user ID U ID Positioning system user medical data F i The corresponding block B i , by establishing MHT to obtain Root rbc , and returns Proof rbc To system users, where Proof rbc ={Root rbc ,sig sk '(H3(Root rbc ))}; 2) System users send an audit challenge to the cloud storage service provider CSP and entrust an auditor to audit the medical data and generate a challenge, i.e., chal = {z, l1, l2} 1≤z≤n ,in 3) After receiving the challenge, the cloud storage service provider CSP first calculates the index and coefficient Then decrypt the medical data file i ω i ,calculate The aggregate signature is 4) The cloud storage service provider CSP calculates the secret value e i The label is used to construct the Merkle hash tree MHT and obtain the root value of the Merkle hash tree Root csp ,return To system users; 5) System users receive Proof rbc and Proof csp Then, check the bilinear map in If established, verify If all are true, the audit is passed.

5. A dynamic update cloud audit method based on chameleon hash function according to claim 4, characterized in that: The block editing phase includes: 1) The system user re-downloads the patient data file, modifies it and uploads the latest data file; 2) When updating the content of the block with data block number π, the system user broadcasts the new data block e′ π After receiving the label, the data verification verifier replaces the label and constructs MHT to generate a new Merkle hash tree root value m′ π ; 3) The data verification verifier calculates the long-term trapdoor key k of the block π =s π +H1(h π-1 ||m π , r π )·x π mod p, where (s π , r π ) is the original adaptation value, h π-1 is the hash value of the previous block, m π is the root value of the block’s MHT, x π is the Chameleon hash function public key; then choose the temporary trapdoor key Calculate s′ π =k π -H1(h π-1 ||m′ π , r′ π )·x π mod p, where m′ π Is the new MHT root value, generating the corresponding block B π =(h π-1 ,ch π , m π , r π ,s π ) is B′ π =(h π-1 ,ch π , m′ π , r′ π , s′ π ).

6. A method for dynamically updating cloud auditing based on chameleon hash function according to claim 4, characterized in that: The proof process of the bilinear mapping is as follows: Known: Proof process:

Citation Information

Patent Citations

  • Efficient privacy protecting audit scheme based on chameleon hash function of cloud storage

    CN104601605A

  • Medical cloud storage public auditing method of anonymous identity based on blockchain technology

    CN109639420A

  • Cloud data integrity dynamic verification method and system based on chameleon hash algorithm

    CN117424717A

  • Dynamic cloud data integrity public auditing method based on chameleon hash

    CN117650879A

Cited By

  • Effective integrity public auditing method for cross-department cooperation multi-ownership data

    CN121118126A

  • Public auditing methods for the effectiveness and integrity of cross-departmental collaborative multi-ownership data

    CN121118126B

  • Collaborative signature method and system based on coding

    CN121567331A