The Latest Application and Security Analysis of Cryptography in Cloud Storage Data Audit

This paper studies on data integrity audit and privacy protection in cloud storage. When discussing the possible problems of identity privacy leakage and data tampering in the cloud storage shared data integrity audit scheme, the solution is being proposed to manage the users of the entity permission allocation center to ensure the integrity and security of data and effectively realize identity traceability. At the same time, according to the vulnerability of the traditional cloud storage data integrity verification protocol under quantum attack, a dynamic integrity verification scheme based on lattice and Bloom filter is proposed. This scheme uses lattice theory to solve the small integer solution calculation problem, and combines the Merkel hash tree and Bloom filter to achieve efficient data integrity verification, while ensuring the security and privacy protection of user data. After security proof and performance evaluation, the scheme has a small overhead in storage space and computing time, and meets the goals of security, correctness and feasibility, and effectively resists quantum attacks. This paper aims to provide beneficial exploration and practice for the security and privacy protection in the cloud storage field, and provides new ideas and methods for solving the cloud storage security problem.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.04.052
Citations
3
Primary Topic
Advanced Steganography and Watermarking Techniques
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Latest Application and Security Analysis of Cryptography in Cloud Storage Data Audit

Yu Liu
3 citations
Procedia Computer Science
Advanced Steganography and Watermarking Techniques
3.83
article

The Latest Application and Security Analysis of Cryptography in Cloud Storage Data Audit

Yu Liu
article en
3 citations

Abstract

This paper studies on data integrity audit and privacy protection in cloud storage. When discussing the possible problems of identity privacy leakage and data tampering in the cloud storage shared data integrity audit scheme, the solution is being proposed to manage the users of the entity permission allocation center to ensure the integrity and security of data and effectively realize identity traceability. At the same time, according to the vulnerability of the traditional cloud storage data integrity verification protocol under quantum attack, a dynamic integrity verification scheme based on lattice and Bloom filter is proposed. This scheme uses lattice theory to solve the small integer solution calculation problem, and combines the Merkel hash tree and Bloom filter to achieve efficient data integrity verification, while ensuring the security and privacy protection of user data. After security proof and performance evaluation, the scheme has a small overhead in storage space and computing time, and meets the goals of security, correctness and feasibility, and effectively resists quantum attacks. This paper aims to provide beneficial exploration and practice for the security and privacy protection in the cloud storage field, and provides new ideas and methods for solving the cloud storage security problem.

Procedia Computer ScienceVol. 259
Deloitte (United States) (US)
Industry, innovation and infrastructure
Openalex Percentile: Top 7%
Advanced Steganography and Watermarking Techniques
3.83
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.