通过完全同态加密实现离散时间 STL 的遗忘监控

Masaki Waga, Kotaro Matsuoka, Takashi Suwa, Naoki Matsumoto, Ryotaro Banno, Song Bian, Kohei Suenaga
{"title":"通过完全同态加密实现离散时间 STL 的遗忘监控","authors":"Masaki Waga, Kotaro Matsuoka, Takashi Suwa, Naoki Matsumoto, Ryotaro Banno, Song Bian, Kohei Suenaga","doi":"arxiv-2405.16767","DOIUrl":null,"url":null,"abstract":"When monitoring a cyber-physical system (CPS) from a remote server, keeping\nthe monitored data secret is crucial, particularly when they contain sensitive\ninformation, e.g., biological or location data. Recently, Banno et al. (CAV'22)\nproposed a protocol for online LTL monitoring that keeps data concealed from\nthe server using Fully Homomorphic Encryption (FHE). We build on this protocol\nto allow arithmetic operations over encrypted values, e.g., to compute a safety\nmeasurement combining distance, velocity, and so forth. Overall, our protocol\nenables oblivious online monitoring of discrete-time real-valued signals\nagainst signal temporal logic (STL) formulas. Our protocol combines two FHE\nschemes, CKKS and TFHE, leveraging their respective strengths. We employ CKKS\nto evaluate arithmetic predicates in STL formulas while utilizing TFHE to\nprocess them using a DFA derived from the STL formula. We conducted case\nstudies on monitoring blood glucose levels and vehicles' behavior against the\nResponsibility-Sensitive Safety (RSS) rules. Our results suggest the practical\nrelevance of our protocol.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"164 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption\",\"authors\":\"Masaki Waga, Kotaro Matsuoka, Takashi Suwa, Naoki Matsumoto, Ryotaro Banno, Song Bian, Kohei Suenaga\",\"doi\":\"arxiv-2405.16767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When monitoring a cyber-physical system (CPS) from a remote server, keeping\\nthe monitored data secret is crucial, particularly when they contain sensitive\\ninformation, e.g., biological or location data. Recently, Banno et al. (CAV'22)\\nproposed a protocol for online LTL monitoring that keeps data concealed from\\nthe server using Fully Homomorphic Encryption (FHE). We build on this protocol\\nto allow arithmetic operations over encrypted values, e.g., to compute a safety\\nmeasurement combining distance, velocity, and so forth. Overall, our protocol\\nenables oblivious online monitoring of discrete-time real-valued signals\\nagainst signal temporal logic (STL) formulas. Our protocol combines two FHE\\nschemes, CKKS and TFHE, leveraging their respective strengths. We employ CKKS\\nto evaluate arithmetic predicates in STL formulas while utilizing TFHE to\\nprocess them using a DFA derived from the STL formula. We conducted case\\nstudies on monitoring blood glucose levels and vehicles' behavior against the\\nResponsibility-Sensitive Safety (RSS) rules. Our results suggest the practical\\nrelevance of our protocol.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"164 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.16767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.16767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

从远程服务器监控网络物理系统(CPS)时,保持监控数据的机密性至关重要,尤其是当这些数据包含敏感信息(如生物或位置数据)时。最近,Banno 等人(CAV'22)提出了一种在线 LTL 监控协议,该协议使用完全同态加密(FHE)技术对服务器进行数据保密。我们以该协议为基础,允许对加密值进行算术运算,例如,计算距离、速度等组合的安全测量值。总之,我们的协议可以根据信号时间逻辑(STL)公式对离散时间实值信号进行遗忘式在线监控。我们的协议结合了 CKKS 和 TFHE 两种 FHE 方案,充分利用了它们各自的优势。我们采用 CKKS 来评估 STL 公式中的算术谓词,同时利用 TFHE,使用从 STL 公式导出的 DFA 来处理这些算术谓词。我们针对责任敏感安全(RSS)规则进行了血糖水平和车辆行为监控的案例研究。我们的研究结果表明,我们的协议非常实用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1