Dynamic Chameleon Authentication Tree for Verifiable Data Streaming in 5G Networks

被引:8
作者
Xu, Jian [1 ,4 ]
Li, Fuxiang [5 ]
Chen, Ke [2 ]
Zhou, Fucai [3 ]
Choi, Junho [6 ]
Shin, Juhyun [7 ]
机构
[1] Northeastern Univ, Software Coll, Shenyang 110169, Liaoning, Peoples R China
[2] Northeastern Univ, Software Coll, Software Engn, Shenyang 110169, Liaoning, Peoples R China
[3] Northeastern Univ, Software Coll, Informat Sci & Engn Coll, Shenyang 110169, Liaoning, Peoples R China
[4] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[5] Natl Police Univ China, Criminal Invest Dept, Shenyang 110035, Liaoning, Peoples R China
[6] Chosun Univ, Dept Undeclared Majors, Div Undeclared Majors, Gwangju 61452, South Korea
[7] Chosun Univ, Dept ICT Convergence, Gwangju 61452, South Korea
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Verifiable data streaming; chameleon authentication tree; authenticated data structures; integrity;
D O I
10.1109/ACCESS.2017.2771281
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Chameleon authentication tree (CAT) is an important authenticated data structure for verifiable data streaming in 5G networks. But the typical CAT cannot support the dynamic scenario very well because it cannot expend freely since its height is fixed. Therefore, we proposed a dynamic CAT (DCAT) with the feature of adaptive expansion. We divided the algorithms of the DCAT with the following phases: setup, append, query, and verification. The DCAT removes the drawbacks of the static CAT. In the setup phase, it is not required for the scale of the tree to be determined, and the scale of the tree can be adaptively expanded during the data-appending phase. Therefore, the DCAT can suit the data stream environment better. During the data querying phase, the average authentication path length has been reduced, which leads to less space requirement and better verification efficiency. Finally, we performed theoretical analysis and drew a comparison between the static CAT and the DCAT in terms of performance. The result indicates that the DCAT provides improvements in the performance of the data-appending, data-querying, and data verification processes.
引用
收藏
页码:26448 / 26459
页数:12
相关论文
共 25 条
[1]  
[Anonymous], **NON-TRADITIONAL**
[2]  
[Anonymous], PROC 9 CONF THEOR
[3]  
[Anonymous], PROC 31 ANN CONF
[4]  
CAMENISCH J, 2002, P CRYPTO 2002, V2442, P61
[5]  
CAMENISCH J, 2009, PKC, V5443, P481
[6]  
Catalano D, 2013, LECT NOTES COMPUT SC, V7778, P55, DOI 10.1007/978-3-642-36362-7_5
[7]  
Cormode G., 2012, P 3 INN THEOR COMP S, P112, DOI [10.1145/2090236.2090245, DOI 10.1145/2090236.2090245]
[8]   An efficient online direction-preserving compression approach for trajectory streaming data [J].
Deng, Ze ;
Han, Wei ;
Wang, Lizhe ;
Ranjan, Rajiv ;
Zomaya, Albert Y. ;
Jie, Wei .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 68 :150-162
[9]  
Fiore D., 2012, P 2012 ACM C COMP CO, P501
[10]   Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems [J].
Goodrich, Michael T. ;
Tamassia, Roberto ;
Triandopoulos, Nikos .
ALGORITHMICA, 2011, 60 (03) :505-552