earticle

논문검색

An Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Related Works
  2.1. Provable Data Possession
  2.2. Counting Bloom Filter
 3. Provable Data Possession Using the CBF
 4. Simulation
  4.1. Environment
  4.2. Compare BF and CBF
  4.3. Simulation in HDFS
 5. Conclusion
 Acknowledgment
 References

저자정보

  • Eunmi Jung Department of Computer Engineering, Dongguk University
  • Junho Jeong Department of Computer Engineering, Dongguk University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.