模式识别与人工智能
Saturday, May. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
Pattern Recognition and Artificial Intelligence  2024, Vol. 37 Issue (1): 27-46    DOI: 10.16451/j.cnki.issn1003-6059.202401003
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
Efficient Encrypted Range Query Integrity Authentication for Hundreds of Millions of Records
WANG Zhaokang1, PAN Jiahui1, ZHOU Lu1
1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106

Download: PDF (1556 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The encrypted query integrity authentication mechanism can provide assurance for the reliability of the query results while protecting the data privacy of artificial intelligence applications. However, the existing encrypted range query integrity authentication methods suffer from high overhead in authentication data structure construction and poor data scalability. To address these issues, the causes of performance bottlenecks in secure verifiable and efficient framework(ServeDB)are analyzed. Based on the analysis conclusions, a cube-cell-based authentication method(CubeTree) is proposed for the encrypted range query integrity authentication problem. A quantile-normalization-based data redistribution optimization is adopted to balance the data distribution in the domain. The encoding overheads of data records are reduced by the data redistribution optimization. Furthermore, a flat balanced K-ary tree structure and a cube-cell-based index authentication data structure are proposed. The redundancy of the authentication data structure is significantly reduced by merging data records with same codes and adopting cube cells as the basic units. Consequently, the computational and storage costs of the CubeTree construction are decreased. Experiments on real-world and synthetic datasets show that CubeTree can significantly reduce the construction costs of the authentication data structure and the generation/verification costs of query integrity proofs, while efficiently handling large-scale datasets with hundreds of millions of data records.
Key wordsApplication Security      Encrypted Range Query      Query Integrity Authentication      Authentica-tion Data Structure      Cube Cell Index     
Received: 07 September 2023     
ZTFLH: TP315  
Fund:National Key Research and Development Program of China(No.2021YFB3101100), National Natural Science Founda-tion of China(No.62202225)
Corresponding Authors: WANG Zhaokang, Ph.D., lecturer. His research interests include big data parallel processing and graph computing.   
About author:: PAN Jiahui, Master student. His research interests include query integrity authentication.ZHOU Lu, Ph.D., professor. Her resear-ch interests include cryptography and IoT security.
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
WANG Zhaokang
PAN Jiahui
ZHOU Lu
Cite this article:   
WANG Zhaokang,PAN Jiahui,ZHOU Lu. Efficient Encrypted Range Query Integrity Authentication for Hundreds of Millions of Records[J]. Pattern Recognition and Artificial Intelligence, 2024, 37(1): 27-46.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.202401003      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2024/V37/I1/27
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn