Public cloud auditing method supporting full dynamic parallel operations of user and preventing leakage
An auditor and multiplication technology, which is applied in the direction of public key for secure communication, user identity/authority verification, secure communication device, etc., can solve the problem of not guaranteeing the confidentiality of data owner's data
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0201] Example 1: File Storage and Auditing
[0202] 1) build
[0203] 1.1) System parameter generation:
[0204] The cloud storage service provider CSP uses the parameter generation algorithm ParamGen(1 k )→(p,G,G T , g, e, H, N) generate system parameters cp and disclose the generated system parameters, specifically:
[0205] The cloud storage service provider CSP first selects an appropriate prime number generation algorithm, and generates a large prime number p according to the security parameter k, so that the binary bit length of the prime number p is greater than or equal to k;
[0206] Secondly, in the PBC cryptographic library environment, two p-order multiplicative cyclic groups G and G are randomly selected T , and select the generator g of the multiplicative cyclic group G, and specify a bilinear map e:G×G→G T ;
[0207] Then, use the Cryptopp cryptographic library to select a hash function H that is resistant to strong collisions, such as the MD5 algorithm o...
Embodiment 2
[0263] Embodiment 2: Dynamically update and verify based on the original storage file: insert data block
[0264] 2.1) Insertion preparation:
[0265] 2.1.1) The data owner DO determines to insert the data block d in the file F * =12, the new document is formalized as F'=F∪{d *}={2,3,6,13,12,5,4,8,11,15,7}, record D * ={d *}={12}; the data owner DO determines the set Y={1} consisting of the insert position index set X={5} in the file F and the number of data blocks to be inserted after each position, where X is A subset of the index set {1,2,...,10} of file F, Y={1} indicates the number of data blocks to be inserted after each position in X, this example is specifically described as: Insert 1 data block after 5 data blocks;
[0266] 2.1.2) Insert data block D * The version information initialization:
[0267] The data owner DO uses the data version information to initialize the algorithm VIGen(D * )→(VI * ) to create the version information VI corresponding to the ins...
Embodiment 3
[0305] Embodiment 3: Dynamically update and verify based on the original storage file: delete data block
[0306] 3.1) Preparation for deletion:
[0307] The data owner DO determines that the data block position index set X={6} to be deleted from the file F, where X is a subset of the position index set {1,2,...,n} of the file F, specifically described as: will delete The sixth data block of file F;
[0308] 3.2) Delete request:
[0309] The data owner DO sends a delete request message U to the cloud storage service provider CSP CSP =(delete,X), ie U CSP =(delete,6), and send another delete request message to the third-party auditor TPA which is Where delete means delete operation request;
[0310] 3.3) Return to delete data block:
[0311] Let the set of deleted data blocks be D # ={d 6}={4}, the cloud storage service provider CSP receives the delete request message U CSP After = (delete, 6), return the deleted data block set D to the data owner DO # ={d 6}={4},...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



