An Effective Scheme for Provable Data Possession

DOI

10.2991/icca-16.2016.82How to use a DOI?

Keywords

Provable data possession, NTRU, Cloud storage, Data integrity

Abstract

At present, almost all the provable data possession schemes require a large number of exponent calculations. In this paper a new scheme based on the homomorphy of NTRU algorithm is proposed. The scheme includes modules of Key Generation, Tag Generation, Challenge, Proof Generation, and Verification. This scheme requires only plus, minus, multiplication and modular computation. The correctness and security of the scheme are analyzed and the result shows that this scheme is reliable. Compared with other existing schemes, this scheme is with higher security, less computation, storage and communication cost.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shanyue Bu
AU  - Mengdie Huang
AU  - Kun Yu
PY  - 2016/01
DA  - 2016/01
TI  - An Effective Scheme for Provable Data Possession
BT  - Proceedings of the 2016 International Conference on Intelligent Control and Computer Application
PB  - Atlantis Press
SP  - 344
EP  - 348
SN  - 2352-538X
UR  - https://doi.org/10.2991/icca-16.2016.82
DO  - 10.2991/icca-16.2016.82
ID  - Bu2016/01
ER  -