Skip to Content
SensorsSensors
  • Article
  • Open Access

22 October 2024

19 Pages

EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores

,
,
and
1
School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China
2
Software College, Northeastern University, Shenyang 110819, China
3
National Frontiers Science Center for Industrial Intelligence and Systems Optimization, Northeastern University, Shenyang 110819, China
*
Author to whom correspondence should be addressed.

Abstract

To address the deficiencies in privacy-preserving expressive query and verification mechanisms in outsourced key-value stores, we propose EKV-VBQ, a scheme designed to ensure verifiable Boolean queries over encrypted key-value data. We have integrated blockchain and homomorphic Xor operations and pseudo-random functions to create a secure and verifiable datastore, while enabling efficient encrypted Boolean queries. Additionally, we have designed a lightweight verification protocol using bilinear map accumulators to guarantee the correctness of Boolean query results. Our security analysis demonstrates that EKV-VBQ is secure against adaptive chosen label attacks (IND-CLA) and guarantees Integrity and Unforgeability under the bilinear q-strong Diffie–Hellman assumption. Our performance evaluations showed reduced server-side storage overhead, efficient proof generation, and a significant reduction in user-side computational complexity by a factor of log n. Finally, GPU-accelerated optimizations significantly enhance EKV-VBQ’s performance, reducing computational overhead by up to 50%, making EKV-VBQ highly efficient and suitable for deployment in environments with limited computational resources.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.