MARS: Enabling Verifiable Range-Aggregate Queries in Multi-Source Environments

被引:6
作者
Liu, Qin [1 ]
Peng, Yu [1 ]
Xu, Qian [1 ]
Jiang, Hongbo [1 ]
Wu, Jie [2 ]
Wang, Tian [3 ]
Peng, Tao [4 ]
Wang, Guojun [4 ]
Zhang, Shaobo [5 ]
机构
[1] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
[2] Temple Univ, Dept Comp & Informat Sci, Philadelphia, PA 19122 USA
[3] Beijing Normal Univ & UIC, Artificial Intelligence & Future Networks, Zhuhai 519000, Guangdong, Peoples R China
[4] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou 510006, Guangdong, Peoples R China
[5] Hunan Univ Sci & Technol, Sch Comp Sci & Engn, Xiangtan 411201, Hunan, Peoples R China
关键词
Aggregates; Data integration; Soft sensors; Data models; Computer science; Scalability; Fuses; Authentication; cloud computing; data fusion; multi-source data; range-aggregate queries; AUTHENTICATION; EFFICIENT; SECURE;
D O I
10.1109/TDSC.2023.3299337
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The huge values created by Big Data and the recent advances in cloud computing have been driving data from different sources into cloud repositories for comprehensive query services. However, cloud-based data fusion makes it challenging to verify if an untrusted server faithfully integrates data and executes queries or not. This is even harder for range-aggregate queries that apply aggregate operations on data within given ranges. In this article, we propose a query authentication scheme, named MARS, enabling a user to efficiently authenticate range-aggregate queries on multi-source data. Specifically, MARS creates a VG-tree by subtly integrating Expressive Set Accumulator into a multi-dimensional G-tree while signing the root digest with a multi-source aggregate signature scheme. Compared with previous solutions, MARS has the following merits: (1) Practicality. Instead of treating range and aggregate queries separately, the user can directly verify the statistical result of selected data. (2) Scalability. Instead of authenticating the individual result from each source, the user can perform an aggregative validation on the integrated result from multiple sources. The experimental results demonstrate the effectiveness of MARS. For large-scale data fusion, the user-side verification time increases by only 103 ms as the amount of data sources increases by five times.
引用
收藏
页码:1994 / 2011
页数:18
相关论文
共 36 条
[21]  
Lu M. Li, 2022, IEEE Trans. CloudComput., V11, P1927
[22]   Verifiable Spatial Range Query Over Encrypted Cloud Data in VANET [J].
Meng, Qian ;
Weng, Jian ;
Miao, Yinbin ;
Chen, Kefei ;
Shen, Zhonghua ;
Wang, Fuqun ;
Li, Zhijun .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (12) :12342-12357
[23]  
Nguyen L, 2005, LECT NOTES COMPUT SC, V3376, P275
[24]  
Pedersen TorbenP., 1991, ADV CRYPTOLOGY EUROC, V547, P522, DOI DOI 10.1007/3-540-46416-6_47
[25]   GENERATING A CANONICAL PREFIX ENCODING [J].
SCHWARTZ, ES ;
KALLICK, B .
COMMUNICATIONS OF THE ACM, 1964, 7 (03) :166-169
[26]   HOW TO SHARE A SECRET [J].
SHAMIR, A .
COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613
[27]   Protecting Your Right: Verifiable Attribute-Based Keyword Search with Fine-Grained Owner-Enforced Search Authorization in the Cloud [J].
Sun, Wenhai ;
Yu, Shucheng ;
Lou, Wenjing ;
Hou, Y. Thomas ;
Li, Hui .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (04) :1187-1198
[28]   An Adaptive Authenticated Data Structure With Privacy-Preserving for Big Data Stream in Cloud [J].
Sun, Yi ;
Liu, Qian ;
Chen, Xingyuan ;
Du, Xuehui .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2020, 15 :3295-3310
[29]   VFIRM: Verifiable Fine-Grained Encrypted Image Retrieval in Multi-Owner Multi-User Settings [J].
Tong, Qiuyun ;
Miao, Yinbin ;
Chen, Lei ;
Weng, Jian ;
Liu, Ximeng ;
Choo, Kim-Kwang Raymond ;
Deng, Robert H. .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (06) :3606-3619
[30]   A Dynamic-Efficient Structure for Secure and Verifiable Location-Based Skyline Queries [J].
Wang, Zuan ;
Zhang, Liang ;
Ding, Xiaofeng ;
Choo, Kim-Kwang Raymond ;
Jin, Hai .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 :920-935