Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption

被引:0
作者
Waga, Masaki [1 ]
Matsuoka, Kotaro [1 ]
Suwa, Takashi [1 ]
Matsumoto, Naoki [1 ]
Banno, Ryotaro [2 ]
Bian, Song [3 ]
Suenaga, Kohei [1 ]
机构
[1] Kyoto Univ, Grad Sch Informat, Kyoto, Japan
[2] Cybozu Inc, Tokyo, Japan
[3] Beihang Univ, Beijing, Peoples R China
来源
RUNTIME VERIFICATION, RV 2024 | 2025年 / 15191卷
关键词
Monitoring; cyber-physical systems; signal temporal logic; fully homomorphic encryption; CKKS; TFHE;
D O I
10.1007/978-3-031-74234-7_4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
When monitoring a cyber-physical system (CPS) from a remote server, keeping the monitored data secret is crucial, particularly when they contain sensitive information, e. g., biological or location data. Recently, Banno et al. (CAV'22) proposed a protocol for online LTL monitoring that keeps data concealed from the server using Fully Homomorphic Encryption (FHE). We build on this protocol to allow arithmetic operations over encrypted values, e. g., to compute a safety measurement combining distance, velocity, and so forth. Overall, our protocol enables oblivious online monitoring of discrete-time real-valued signals against signal temporal logic (STL) formulas. Our protocol combines two FHE schemes, CKKS and TFHE, leveraging their respective strengths. We employ CKKS to evaluate arithmetic predicates in STL formulas while utilizing TFHE to process them using a DFA derived from the STL formula. We conducted case studies on monitoring blood glucose levels and vehicles' behavior against the Responsibility-Sensitive Safety (RSS) rules. Our results suggest the practical relevance of our protocol.
引用
收藏
页码:59 / 69
页数:11
相关论文
共 22 条
[1]  
[Anonymous], 2017, On a Formal Model of Safe and Scalable Self-driving Cars
[2]   Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption [J].
Banno, Ryotaro ;
Matsuoka, Kotaro ;
Matsumoto, Naoki ;
Bian, Song ;
Waga, Masaki ;
Suenaga, Kohei .
COMPUTER AIDED VERIFICATION (CAV 2022), PT I, 2022, 13371 :447-468
[3]   HE3DB: An Efficient and Elastic Encrypted Database Via Arithmetic-And-Logic Fully Homomorphic Encryption [J].
Bian, Song ;
Zhang, Zhou ;
Pan, Haowen ;
Mao, Ran ;
Zhao, Zian ;
Jin, Yier ;
Guan, Zhenyu .
PROCEEDINGS OF THE 2023 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2023, 2023, :2930-2944
[4]   Towards a Verified Artificial Pancreas: Challenges and Solutions for Runtime Verification [J].
Cameron, Fraser ;
Fainekos, Georgios ;
Maahs, David M. ;
Sankaranarayanan, Sriram .
RUNTIME VERIFICATION, RV 2015, 2015, 9333 :3-17
[5]   Homomorphic Encryption for Arithmetic of Approximate Numbers [J].
Cheon, Jung Hee ;
Kim, Andrey ;
Kim, Miran ;
Song, Yongsoo .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT I, 2017, 10624 :409-437
[6]   TFHE: Fast Fully Homomorphic Encryption Over the Torus [J].
Chillotti, Ilaria ;
Gama, Nicolas ;
Georgieva, Mariya ;
Izabachene, Malika .
JOURNAL OF CRYPTOLOGY, 2020, 33 (01) :34-91
[7]  
Daemen J., 1999, AES PROPOSAL
[8]   From Spot 2.0 to Spot 2.10: What's New? [J].
Duret-Lutz, Alexandre ;
Renault, Etienne ;
Colange, Maximilien ;
Renkin, Florian ;
Aisse, Alexandre Gbaguidi ;
Schlehuber-Caissier, Philipp ;
Medioni, Thomas ;
Martin, Antoine ;
Dubois, Jerome ;
Gillard, Clement ;
Lauko, Henrich .
COMPUTER AIDED VERIFICATION (CAV 2022), PT II, 2022, 13372 :174-187
[9]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[10]  
github.com, 2023, Microsoft SEAL (release 4.1)