A Scheme for Verifying the Integrity of Outsourced Data

• Published in: China communications Vol. 12; no. 11; pp. 188 - 195
• Main Authors: Xiaoming, Wang, Fang, Yu, Yanchun, Lin, Qingqing, Gan, Daini, Wu
• Format: Journal Article
• Language: English
• Published: China Institute of Communications 01-11-2015; Department of Computer Science, Jinan University, Guangzhou China, 510632
• Subjects: authenticated; complexity; Complexity theory; constant; Cryptography; data; Data structures; datastructure; Generators; integrity; outsourced; Resistance; Servers; data integrity; constant complexity; authenticated data structure; outsourced data
• DOI: 10.1109/CC.2015.7366241
• ISSN: 1673-5447

Unauthorized tampering with outsourced data can result in significant losses for both data owner and users.Data integrity therefore becomes an important factor in outsourced data systems.In this paper,we address this problem and propose a scheme for verifying the integrity of outsourced data.We first propose a new authenticated data structure for authenticating membership queries in sets based on accumulators,and then show how to apply it to the problem of verifying the integrity of outsourced data.We also prove that our scheme is secure under the q-strong DiffieHellman assumption.More importantly,our scheme has the constant cost communication,meanwhile keeping other complexity measures constant.Compared to previous schemes based on accumulators,our scheme reduces update cost and so improves previous schemes based on accumulators.In addition,the experimental comparison shows that our scheme outperforms the previous schemes.