Table of Content

Open Access iconOpen Access

ARTICLE

WiBPA: An Efficient Data Integrity Auditing Scheme Without Bilinear Pairings

Chunhua Li1,*, Peng Wang1, Changhong Sun1, Ke Zhou1, Ping Huang2

Wuhan National Lab for Optoelectronics, Huazhong University of Science and Technology, Wuhan, 430074, China.
2 Computer and Information Sciences, Temple University, Philadelphia, 19122, USA.

* Corresponding Author: Chunhua Li. Email: email.

Computers, Materials & Continua 2019, 58(2), 319-333. https://doi.org/10.32604/cmc.2019.03856

Abstract

The security of cloud data has always been a concern. Cloud server provider may maliciously tamper or delete user’s data for their own benefit, so data integrity audit is of great significance to verify whether data is modified or not. Based on the general three-party audit architecture, a dynamic auditing scheme without bilinear pairings is proposed in this paper. It utilizes exponential operation instead of bilinear mapping to verify the validity of evidence. By establishing the mapping relation between logic index and tag index of data block with index transformation table, our scheme can easily support dynamic data operation. By hiding random numbers in the integrity evidence, our scheme can protect users’ privacy information. Detailed security analysis shows that our scheme is secure against attacks such as forgery, replaying and substitution. Further experiments demonstrate that our scheme has lower computational overhead.

Keywords


Cite This Article

APA Style
Li, C., Wang, P., Sun, C., Zhou, K., , P.H. (2019). Wibpa: an efficient data integrity auditing scheme without bilinear pairings. Computers, Materials & Continua, 58(2), 319-333. https://doi.org/10.32604/cmc.2019.03856
Vancouver Style
Li C, Wang P, Sun C, Zhou K, PH. Wibpa: an efficient data integrity auditing scheme without bilinear pairings. Comput Mater Contin. 2019;58(2):319-333 https://doi.org/10.32604/cmc.2019.03856
IEEE Style
C. Li, P. Wang, C. Sun, K. Zhou, and P.H. "WiBPA: An Efficient Data Integrity Auditing Scheme Without Bilinear Pairings," Comput. Mater. Contin., vol. 58, no. 2, pp. 319-333. 2019. https://doi.org/10.32604/cmc.2019.03856

Citations




cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2852

    View

  • 1504

    Download

  • 0

    Like

Related articles

Share Link