Embedded Insertion Functions for Opacity Enforcement

We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the obser...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2021-09, Vol.66 (9), p.4184-4191
Main Authors: Keroglou, Christoforos, Lafortune, Stephane
Format: Article
Language:English
Subjects:
Algorithms
Automata
Discrete event systems
finite automata
Information flow
Insertion
Monitoring
Observers
Opacity
Polynomials
Prediction algorithms
Privacy
Runtime
Sequences
Servers
Synthesis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753
cites cdi_FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753
container_end_page 4191
container_issue 9
container_start_page 4184
container_title IEEE transactions on automatic control
container_volume 66
creator Keroglou, Christoforos
Lafortune, Stephane
description We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate the more powerful method of insertion sequences based on the exact system states and events. In this case, the insertion function would be embedded into the system itself, rather than being an output interface. In this article, we develop methods that verify if a valid insertion function exists in this setting; if one exists, synthesize one using a computationally effective algorithm; and investigate a special case where it is possible to verify and synthesize a valid embedded insertion function with polynomial complexity in the size of the system.
doi_str_mv 10.1109/TAC.2020.3037891
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_9259077</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9259077</ieee_id><sourcerecordid>2565239389</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753</originalsourceid><addsrcrecordid>eNo9kL1rwzAQxUVpoWnavdDF0NnuSbIsaQwhaQOBLOksLOkEDrWdSs6Q_74KCZ3uHrx3Hz9CXilUlIL-2C-WFQMGFQculaZ3ZEaFUCUTjN-TGQBVpWaqeSRPKR2ybOqazki96i16j77YDAnj1I1DsT4N7tKkIoyx2B1b103nYjVk5bDHYXomD6H9Sfhyq3PyvV7tl1_ldve5WS62pWOaTmXLkbc6WK4s-IANSCap9yB5wOBaz5SQ1ionnKQ2oEAeLAWv8z1acin4nLxf5x7j-HvCNJnDeIpDXmmYaPJjmiudXXB1uTimFDGYY-z6Np4NBXNhYzIbc2Fjbmxy5O0a6RDx366Z0CAl_wMKVV_U</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2565239389</pqid></control><display><type>article</type><title>Embedded Insertion Functions for Opacity Enforcement</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Keroglou, Christoforos ; Lafortune, Stephane</creator><creatorcontrib>Keroglou, Christoforos ; Lafortune, Stephane</creatorcontrib><description>We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate the more powerful method of insertion sequences based on the exact system states and events. In this case, the insertion function would be embedded into the system itself, rather than being an output interface. In this article, we develop methods that verify if a valid insertion function exists in this setting; if one exists, synthesize one using a computationally effective algorithm; and investigate a special case where it is possible to verify and synthesize a valid embedded insertion function with polynomial complexity in the size of the system.</description><identifier>ISSN: 0018-9286</identifier><identifier>EISSN: 1558-2523</identifier><identifier>DOI: 10.1109/TAC.2020.3037891</identifier><identifier>CODEN: IETAA9</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Automata ; Discrete event systems ; finite automata ; Information flow ; Insertion ; Monitoring ; Observers ; Opacity ; Polynomials ; Prediction algorithms ; Privacy ; Runtime ; Sequences ; Servers ; Synthesis</subject><ispartof>IEEE transactions on automatic control, 2021-09, Vol.66 (9), p.4184-4191</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753</citedby><cites>FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753</cites><orcidid>0000-0002-6461-439X ; 0000-0002-7526-6642</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9259077$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,786,790,27957,27958,55147</link.rule.ids></links><search><creatorcontrib>Keroglou, Christoforos</creatorcontrib><creatorcontrib>Lafortune, Stephane</creatorcontrib><title>Embedded Insertion Functions for Opacity Enforcement</title><title>IEEE transactions on automatic control</title><addtitle>TAC</addtitle><description>We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate the more powerful method of insertion sequences based on the exact system states and events. In this case, the insertion function would be embedded into the system itself, rather than being an output interface. In this article, we develop methods that verify if a valid insertion function exists in this setting; if one exists, synthesize one using a computationally effective algorithm; and investigate a special case where it is possible to verify and synthesize a valid embedded insertion function with polynomial complexity in the size of the system.</description><subject>Algorithms</subject><subject>Automata</subject><subject>Discrete event systems</subject><subject>finite automata</subject><subject>Information flow</subject><subject>Insertion</subject><subject>Monitoring</subject><subject>Observers</subject><subject>Opacity</subject><subject>Polynomials</subject><subject>Prediction algorithms</subject><subject>Privacy</subject><subject>Runtime</subject><subject>Sequences</subject><subject>Servers</subject><subject>Synthesis</subject><issn>0018-9286</issn><issn>1558-2523</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNo9kL1rwzAQxUVpoWnavdDF0NnuSbIsaQwhaQOBLOksLOkEDrWdSs6Q_74KCZ3uHrx3Hz9CXilUlIL-2C-WFQMGFQculaZ3ZEaFUCUTjN-TGQBVpWaqeSRPKR2ybOqazki96i16j77YDAnj1I1DsT4N7tKkIoyx2B1b103nYjVk5bDHYXomD6H9Sfhyq3PyvV7tl1_ldve5WS62pWOaTmXLkbc6WK4s-IANSCap9yB5wOBaz5SQ1ionnKQ2oEAeLAWv8z1acin4nLxf5x7j-HvCNJnDeIpDXmmYaPJjmiudXXB1uTimFDGYY-z6Np4NBXNhYzIbc2Fjbmxy5O0a6RDx366Z0CAl_wMKVV_U</recordid><startdate>20210901</startdate><enddate>20210901</enddate><creator>Keroglou, Christoforos</creator><creator>Lafortune, Stephane</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-6461-439X</orcidid><orcidid>https://orcid.org/0000-0002-7526-6642</orcidid></search><sort><creationdate>20210901</creationdate><title>Embedded Insertion Functions for Opacity Enforcement</title><author>Keroglou, Christoforos ; Lafortune, Stephane</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Automata</topic><topic>Discrete event systems</topic><topic>finite automata</topic><topic>Information flow</topic><topic>Insertion</topic><topic>Monitoring</topic><topic>Observers</topic><topic>Opacity</topic><topic>Polynomials</topic><topic>Prediction algorithms</topic><topic>Privacy</topic><topic>Runtime</topic><topic>Sequences</topic><topic>Servers</topic><topic>Synthesis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Keroglou, Christoforos</creatorcontrib><creatorcontrib>Lafortune, Stephane</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on automatic control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Keroglou, Christoforos</au><au>Lafortune, Stephane</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Embedded Insertion Functions for Opacity Enforcement</atitle><jtitle>IEEE transactions on automatic control</jtitle><stitle>TAC</stitle><date>2021-09-01</date><risdate>2021</risdate><volume>66</volume><issue>9</issue><spage>4184</spage><epage>4191</epage><pages>4184-4191</pages><issn>0018-9286</issn><eissn>1558-2523</eissn><coden>IETAA9</coden><abstract>We investigate the enforcement of opacity, an information-flow privacy property, using insertion sequences that modify the output of the system by event insertions. Previous work considered the problem of enforcing the opacity under the assumption that the insertion functions were based on the observed system strings. Now, we investigate the more powerful method of insertion sequences based on the exact system states and events. In this case, the insertion function would be embedded into the system itself, rather than being an output interface. In this article, we develop methods that verify if a valid insertion function exists in this setting; if one exists, synthesize one using a computationally effective algorithm; and investigate a special case where it is possible to verify and synthesize a valid embedded insertion function with polynomial complexity in the size of the system.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TAC.2020.3037891</doi><tpages>8</tpages><orcidid>https://orcid.org/0000-0002-6461-439X</orcidid><orcidid>https://orcid.org/0000-0002-7526-6642</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0018-9286
ispartof IEEE transactions on automatic control, 2021-09, Vol.66 (9), p.4184-4191
issn 0018-9286
1558-2523
language eng
recordid cdi_ieee_primary_9259077
source IEEE Electronic Library (IEL) Journals
subjects Algorithms
Automata
Discrete event systems
finite automata
Information flow
Insertion
Monitoring
Observers
Opacity
Polynomials
Prediction algorithms
Privacy
Runtime
Sequences
Servers
Synthesis
title Embedded Insertion Functions for Opacity Enforcement
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-21T19%3A41%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Embedded%20Insertion%20Functions%20for%20Opacity%20Enforcement&rft.jtitle=IEEE%20transactions%20on%20automatic%20control&rft.au=Keroglou,%20Christoforos&rft.date=2021-09-01&rft.volume=66&rft.issue=9&rft.spage=4184&rft.epage=4191&rft.pages=4184-4191&rft.issn=0018-9286&rft.eissn=1558-2523&rft.coden=IETAA9&rft_id=info:doi/10.1109/TAC.2020.3037891&rft_dat=%3Cproquest_ieee_%3E2565239389%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-a3e3a9fb38b0dfe607271dd073fefcad2857bb8c5c71bfe5e3fb10d9edd973753%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2565239389&rft_id=info:pmid/&rft_ieee_id=9259077&rfr_iscdi=true