VMPQ: An Efficient Protocol for Privacy-Preserving and Verifiable Multi-Predicate Queries Over Time-Series Databases

Abstract

With the widespread adoption of cloud storage, time-series databases have become indispensable for managing and analyzing sequential data generated on the user side over time (i.e., time-series data), thereby alleviating the computational and storage burden on resource-constrained users. However, critical security and privacy challenges—such as query privacy leakage, data exposure, and threats to storage integrity—remain inadequately addressed by existing solutions. To this end, we propose VMPQ, an efficient protocol for privacy-preserving and verifiable multi-predicate queries over time-series databases. Specifically, we introduce a new cryptographic primitive, verifiable offline/online private information retrieval (V-OO-PIR), which supports sublinear retrieval complexity while simultaneously ensuring both query privacy and result verifiability against untrusted servers. Building on V-OO-PIR, we design a dual-layer security framework that integrates replicated secret sharing (RSS) and secure multiparty computation (MPC): 1) RSS splits time-series data into two shares stored across two non-colluding servers, ensuring data confidentiality and mitigating exposure risks, and 2) MPC performs secure multiplication directly on these shares, enabling efficient evaluation of multi-predicate queries without reconstructing the original data. As a result, VMPQ ensures query privacy by preventing servers from inferring user interests across multiple predicates, while simultaneously guaranteeing data confidentiality and the verifiability of query results. Theoretical analysis confirms the security of VMPQ against malicious adversaries. Experimental results demonstrate that VMPQ reduces query latency by up to 5× compared to the state-of-the-art solution Waldo, while also enhancing throughput and preserving high storage efficiency through optimized database encoding.