An Adaptive Authenticated Data Structure With Privacy-Preserving for Big Data Stream in Cloud

被引:52
作者
Sun, Yi [1 ]
Liu, Qian [1 ]
Chen, Xingyuan [1 ,2 ]
Du, Xuehui [1 ]
机构
[1] Inst Zhengzhou Informat Sci & Technol, Zhengzhou 450001, Peoples R China
[2] State Key Lab Cryptol, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Big Data; Cloud computing; Authentication; Data structures; Real-time systems; Data privacy; Authenticated data structure; trapdoor hash function; privacy-preserving; stream verification; EFFICIENT; STORAGE;
D O I
10.1109/TIFS.2020.2986879
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the rapid development of 5G network, big data and IoT, data in many environments is often continuously and dynamically generated with high growth rates, just like stream. Thus, we call it big data stream, which plays an increasingly important role in all walks of life. However, how to verify its authenticity becomes a challenge when this big data stream in an untrusted environment such as cloud platform, for it faces the problems just like delay-sensitive, unpredictable data size and privacy leaks caused by third-party audits. To solve these problems, we propose a new authenticate data structure named privacy-preserving adaptive trapdoor hash authentication tree (P-ATHAT) by introducing trapdoor hash and BLS signature to the Merkle hash tree. The P-ATHAT scheme realizes real-time verification of data stream and can dynamically expand its structure as the data stream arrives. These characteristics not only shorten the authentication path but also solve the single point failure problem of the conventional authentication trees and enhance the robustness of the scheme. Moreover, we construct a homomorphic verification scheme above tree structure to solve the privacy leakage problem in third-party audit. Finally, security analysis and detailed experimental evaluation are performed on the proposed scheme, both results demonstrate that it is desirable for big data stream authentication and privacy-preserving in practical application.
引用
收藏
页码:3295 / 3310
页数:16
相关论文
共 46 条
[1]  
[Anonymous], [No title captured]
[2]  
[Anonymous], 2013, THESIS
[3]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[4]  
Backes M, 2014, LECT NOTES COMPUT SC, V8479, P401, DOI 10.1007/978-3-319-07536-5_24
[5]  
Battistoni G, 2007, AIP CONF PROC, V896, P31, DOI 10.1063/1.2720455
[6]   On the performance and use of a space-efficient Merkle tree traversal algorithm in real-time applications for wireless and sensor networks [J].
Berbecaru, Diana ;
Albertalli, Luca .
2008 4TH IEEE INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), 2008, :234-240
[7]   Short signatures from the Weil pairing [J].
Boneh, D ;
Lynn, B ;
Shacham, H .
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :297-319
[8]   MINIMUM DISCLOSURE PROOFS OF KNOWLEDGE [J].
BRASSARD, G ;
CHAUM, D ;
CREPEAU, C .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (02) :156-189
[9]   Verifiable Computation over Large Database with Incremental Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Weng, Jian ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (10) :3184-3195
[10]   New Publicly Verifiable Databases with Efficient Updates [J].
Chen, Xiaofeng ;
Li, Jin ;
Huang, Xinyi ;
Ma, Jianfeng ;
Lou, Wenjing .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2015, 12 (05) :546-556