.png){kind=icon}
.png){kind=icon}
Return
A data integrity verification scheme in mobile cloud computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2016.08.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The provable data possession (PDP) scheme is vital to data-oriented mobile cloud computing security architecture. Without an efficient PDP scheme, users cannot verify whether the server retrieves original data before the data is being processed. One big issue of recent PDP verification schemes is that computation complexity and space overheads are very high. In this paper, we develop 2 comprehensive mobile provable data possession schemes (MPDP) using a hash tree data structure and a Boneh-Lynn-Shacham short signature scheme. Our MPDP schemes support data dynamics via verification out-sourcing, blockless verification, stateless verification, and dynamic data operations. Experimental results show that these 2 MPDP schemes are highly accurate in the data verification process, and have a low data transmission cost. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Mobile cloud computing
Provable data possession
Hash tree
BLS signature scheme
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W
View more organizations