earticle

논문검색

An Efficient Provable Data Possession based on Elliptic Curves in Cloud Storage

목차

Abstract
 1. Introduction
 2. Related Work
 3. Provable Data Possession Schemes by EC (Elliptic Curve)
  3.1 Preliminaries
  3.2 EC-PDP
  3.3 EC-PDP with Weaker Guarantee
 4. System Implementation and Performance Evaluation
  4.1 Implementation
  4.2 Security
  4.3 Computation Complexity
  4.4 Communication Complexity
  4.5 Block Access Complexity
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Hongyuan Wang Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing,100081, China
  • Liehuang Zhu Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing,100081, China
  • Feng Wang Naval Academy of Armament, Beijing, 100161, China
  • Yijia Lilong Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing,100081, China
  • Yu Chen Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing,100081, China
  • Chang Liu Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing,100081, China

참고문헌

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

    함께 이용한 논문

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

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