OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series Data

被引:0
作者
Ouyang, Huajie [1 ]
Zheng, Yifeng [2 ]
Wang, Songlei [3 ]
Hua, Zhongyun [1 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Shenzhen 518055, Guangdong, Peoples R China
[2] Hong Kong Polytech Univ, Dept Elect & Elect Engn, Hong Kong, Peoples R China
[3] Shenzhen Univ, Natl Engn Lab Big Data Syst Comp Technol, Shenzhen 518055, Peoples R China
关键词
Time series analysis; Cryptography; Query processing; Databases; Heart rate; Protocols; Data privacy; Security; Monitoring; Data analysis; Time-series analytics; privacy preservation; query processing; cloud computing;
D O I
10.1109/TSC.2025.3553698
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Time-series data is prevalent in many applications like smart homes, smart grids, and healthcare. And it is now increasingly common to store and query time-series data in the cloud. Despite the benefits, data privacy concerns in such outsourced services are pressing, making it imperative to embed privacy assurance mechanisms from the outset. Most existing related works have been focused on querying for different types of aggregate statistics. In this article, we instead focus on the secure support for advanced interval skyline queries, which allow to identify time series that are not dominated by any other time series within a query time interval. This is valuable for time-series data analytics in applications like remote health monitoring (e.g., identifying patients with high heart rates in a certain week). We present OblivTime, a new system framework for oblivious and efficient interval skyline query processing over encrypted time-series data. OblivTime is built from a synergy of time-series data analytics, lightweight cryptography, and GPU parallel computing, achieving stronger security guarantees and lower online query latency over the state-of-the-art prior work. Extensive experiments demonstrate that OblivTime can achieve up to 666x speedup in online query latency over the state-of-the-art prior work.
引用
收藏
页码:1602 / 1617
页数:16
相关论文
共 50 条
[1]  
Amazon Web Services, 2023, Amazon timestream
[2]  
Aminikhanghahi S, 2019, IEEE T KNOWL DATA EN, V31, P1010, DOI [10.1109/tkde.2018.2850347, 10.1109/TKDE.2018.2850347]
[3]  
[Anonymous], 1994, Time Series Analysis
[4]   Secure Graph Analysis at Scale [J].
Araki, Toshinori ;
Furukawa, Jun ;
Ohara, Kazuma ;
Pinkas, Benny ;
Rosemarin, Hanan ;
Tsuchida, Hikaru .
CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, :610-629
[5]   High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority [J].
Araki, Toshinori ;
Furukawa, Jun ;
Lindell, Yehuda ;
Nof, Ariel ;
Ohara, Kazuma .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :805-817
[6]   Secret-Shared Joins with Multiplicity from Aggregation Trees [J].
Badrinarayanan, Saikrishna ;
Das, Sourav ;
Garimella, Gayathri ;
Raghuraman, Srinivasan ;
Rindal, Peter .
PROCEEDINGS OF THE 2022 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2022, 2022, :209-222
[7]  
Bost R., 2017, IACR Cryptol. ePrint Arch., V2017, P1060
[8]  
Bothe S., 2014, P 1 INT WORKSH PRIV, P37
[9]   Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation [J].
Boyle, Elette ;
Chandran, Nishanth ;
Gilboa, Niv ;
Gupta, Divya ;
Ishai, Yuval ;
Kumar, Nishant ;
Rathee, Mayank .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT II, 2021, 12697 :871-900
[10]   Secure Computation with Preprocessing via Function Secret Sharing [J].
Boyle, Elette ;
Gilboa, Niv ;
Ishai, Yuval .
THEORY OF CRYPTOGRAPHY, TCC 2019, PT I, 2019, 11891 :341-371