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 dat...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2024-10 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Waga, Masaki Matsuoka, Kotaro Suwa, Takashi Matsumoto, Naoki Banno, Ryotaro Bian, Song Suenaga, Kohei |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2405.16767 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2405_16767</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3087015272</sourcerecordid><originalsourceid>FETCH-LOGICAL-a957-6d0796528df590dbb131913eada63c48b48e50e86ab6c04869b68d49be3c5b373</originalsourceid><addsrcrecordid>eNotj7tOwzAARS0kJKrSD2DCEnOC33ZGVFqKCOpA9shOHHCVxMF5iPw9oUV3uMvR1T0A3GEUM8U5etThx00xYYjHWEghr8CKUIojxQi5AZu-PyGEiJCEc7oCb0dTu8n5sYfvvnWDD679hJUP8Nn1RbCDjTLXWPiRpXByGu7Hup7hwTdLQvflCrhrizB3g_PtLbiudN3bzX-vQbbfZdtDlB5fXrdPaaQTLiNRIpkITlRZ8QSVxmCKE0ytLrWgBVOGKcuRVUIbUSCmRGKEKlliLC24oZKuwf1l9myad8E1Osz5n3F-Nl6IhwvRBf892n7IT34M7fIpp0hJhDmRhP4CSjRYqg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3087015272</pqid></control><display><type>article</type><title>Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Waga, Masaki ; Matsuoka, Kotaro ; Suwa, Takashi ; Matsumoto, Naoki ; Banno, Ryotaro ; Bian, Song ; Suenaga, Kohei</creator><creatorcontrib>Waga, Masaki ; Matsuoka, Kotaro ; Suwa, Takashi ; Matsumoto, Naoki ; Banno, Ryotaro ; Bian, Song ; Suenaga, Kohei</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2405.16767</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Arithmetic ; Computer Science - Cryptography and Security ; Computer Science - Formal Languages and Automata Theory ; Cyber-physical systems ; Discrete time systems ; Encryption ; Remote monitoring ; Temporal logic</subject><ispartof>arXiv.org, 2024-10</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27923</link.rule.ids><backlink>$$Uhttps://doi.org/10.1007/978-3-031-74234-7_4$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2405.16767$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Waga, Masaki</creatorcontrib><creatorcontrib>Matsuoka, Kotaro</creatorcontrib><creatorcontrib>Suwa, Takashi</creatorcontrib><creatorcontrib>Matsumoto, Naoki</creatorcontrib><creatorcontrib>Banno, Ryotaro</creatorcontrib><creatorcontrib>Bian, Song</creatorcontrib><creatorcontrib>Suenaga, Kohei</creatorcontrib><title>Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption</title><title>arXiv.org</title><description>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.</description><subject>Arithmetic</subject><subject>Computer Science - Cryptography and Security</subject><subject>Computer Science - Formal Languages and Automata Theory</subject><subject>Cyber-physical systems</subject><subject>Discrete time systems</subject><subject>Encryption</subject><subject>Remote monitoring</subject><subject>Temporal logic</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj7tOwzAARS0kJKrSD2DCEnOC33ZGVFqKCOpA9shOHHCVxMF5iPw9oUV3uMvR1T0A3GEUM8U5etThx00xYYjHWEghr8CKUIojxQi5AZu-PyGEiJCEc7oCb0dTu8n5sYfvvnWDD679hJUP8Nn1RbCDjTLXWPiRpXByGu7Hup7hwTdLQvflCrhrizB3g_PtLbiudN3bzX-vQbbfZdtDlB5fXrdPaaQTLiNRIpkITlRZ8QSVxmCKE0ytLrWgBVOGKcuRVUIbUSCmRGKEKlliLC24oZKuwf1l9myad8E1Osz5n3F-Nl6IhwvRBf892n7IT34M7fIpp0hJhDmRhP4CSjRYqg</recordid><startdate>20241018</startdate><enddate>20241018</enddate><creator>Waga, Masaki</creator><creator>Matsuoka, Kotaro</creator><creator>Suwa, Takashi</creator><creator>Matsumoto, Naoki</creator><creator>Banno, Ryotaro</creator><creator>Bian, Song</creator><creator>Suenaga, Kohei</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20241018</creationdate><title>Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption</title><author>Waga, Masaki ; Matsuoka, Kotaro ; Suwa, Takashi ; Matsumoto, Naoki ; Banno, Ryotaro ; Bian, Song ; Suenaga, Kohei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a957-6d0796528df590dbb131913eada63c48b48e50e86ab6c04869b68d49be3c5b373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Arithmetic</topic><topic>Computer Science - Cryptography and Security</topic><topic>Computer Science - Formal Languages and Automata Theory</topic><topic>Cyber-physical systems</topic><topic>Discrete time systems</topic><topic>Encryption</topic><topic>Remote monitoring</topic><topic>Temporal logic</topic><toplevel>online_resources</toplevel><creatorcontrib>Waga, Masaki</creatorcontrib><creatorcontrib>Matsuoka, Kotaro</creatorcontrib><creatorcontrib>Suwa, Takashi</creatorcontrib><creatorcontrib>Matsumoto, Naoki</creatorcontrib><creatorcontrib>Banno, Ryotaro</creatorcontrib><creatorcontrib>Bian, Song</creatorcontrib><creatorcontrib>Suenaga, Kohei</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Waga, Masaki</au><au>Matsuoka, Kotaro</au><au>Suwa, Takashi</au><au>Matsumoto, Naoki</au><au>Banno, Ryotaro</au><au>Bian, Song</au><au>Suenaga, Kohei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption</atitle><jtitle>arXiv.org</jtitle><date>2024-10-18</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2405.16767</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2024-10 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2405_16767 |
| source | arXiv.org; Free E- Journals |
| subjects | Arithmetic Computer Science - Cryptography and Security Computer Science - Formal Languages and Automata Theory Cyber-physical systems Discrete time systems Encryption Remote monitoring Temporal logic |
| title | Oblivious Monitoring for Discrete-Time STL via Fully Homomorphic Encryption |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T11%3A48%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Oblivious%20Monitoring%20for%20Discrete-Time%20STL%20via%20Fully%20Homomorphic%20Encryption&rft.jtitle=arXiv.org&rft.au=Waga,%20Masaki&rft.date=2024-10-18&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2405.16767&rft_dat=%3Cproquest_arxiv%3E3087015272%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3087015272&rft_id=info:pmid/&rfr_iscdi=true |