Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
An efficient provable data possession scheme based on counting bloom filter for dynamic data in the cloud storage
- Issue Date
- 2016
- Publisher
- Science and Engineering Research Support Society
- Keywords
- Cloud computing security; Data integrity; Provable data possession
- Citation
- International Journal of Multimedia and Ubiquitous Engineering, v.11, no.4, pp 9 - 16
- Pages
- 8
- Indexed
- SCOPUS
- Volume
- 11
- Number
- 4
- Start Page
- 9
- End Page
- 16
- ISSN
- 1975-0080
- Abstract
- Cloud services have become a trend, because many companies are supplying various cloud services that reflect the needs of users. However, as cloud services increase, security problems, such as saved data spills and data modulation, also increase. This paper focuses on the problem of data integrity. A PDP (Provable Data Possession) scheme has the disadvantage of time overheads, because dynamic data needs additional processing time. To solve the problem, this paper examines the use of a Counting Bloom Filter for updating data. This technique is more efficient than using PDP when changing part of the data in a simulation. The result is more effective if the saved data changes part of the dynamic data. © 2016 SERSC.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Jeong, Jun Ho
- College of Advanced Convergence Engineering (Department of Computer Science and Artificial Intelligence)