Optimal Synthesis of Insertion Functions for Opacity Enforcement
Yi-Chin Wu, Stephane Lafortune

Citation
Yi-Chin Wu, Stephane Lafortune. "Optimal Synthesis of Insertion Functions for Opacity Enforcement". Talk or presentation, 16, September, 2014; Poster presented at the TerraSwarm 2014 Security and Privacy Workshop, Rochester, NY.

Abstract
Our prior work has studied the enforcement of opacity security properties using insertion functions. Given a system that is not opaque, the so-called All Insertion Structure (AIS) is a finite structure that embeds all valid insertion functions and can be used to synthesize one. In this work, we consider the problem of synthesizing an optimal insertion function. Specifically, we solve two optimal synthesis problems, one with respect to the maximum total cost and the other one with respect to the maximum mean cost. To determine which optimal synthesis problem is more suitable for a given opacity problem, we have also developed a test that determines if a finite total-cost insertion function exists.

Electronic downloads


Internal. This publication has been marked by the author for TerraSwarm-only distribution, so electronic downloads are not available without logging in.
Citation formats  
  • HTML
    Yi-Chin Wu, Stephane Lafortune. <a
    href="http://www.terraswarm.org/pubs/374.html"><i>Optimal
    Synthesis of Insertion Functions for Opacity
    Enforcement</i></a>, Talk or presentation,  16,
    September, 2014; Poster presented at the <a
    href="http://www.terraswarm.org/conferences/14/security/index.htm"
    >TerraSwarm 2014 Security and Privacy Workshop</a>,
    Rochester, NY.
  • Plain text
    Yi-Chin Wu, Stephane Lafortune. "Optimal Synthesis of
    Insertion Functions for Opacity Enforcement". Talk or
    presentation,  16, September, 2014; Poster presented at the
    <a
    href="http://www.terraswarm.org/conferences/14/security/index.htm"
    >TerraSwarm 2014 Security and Privacy Workshop</a>,
    Rochester, NY.
  • BibTeX
    @presentation{WuLafortune14_OptimalSynthesisOfInsertionFunctionsForOpacityEnforcement,
        author = {Yi-Chin Wu and Stephane Lafortune},
        title = {Optimal Synthesis of Insertion Functions for
                  Opacity Enforcement},
        day = {16},
        month = {September},
        year = {2014},
        note = {Poster presented at the <a
                  href="http://www.terraswarm.org/conferences/14/security/index.htm"
                  >TerraSwarm 2014 Security and Privacy
                  Workshop</a>, Rochester, NY.},
        abstract = {Our prior work has studied the enforcement of
                  opacity security properties using insertion
                  functions. Given a system that is not opaque, the
                  so-called All Insertion Structure (AIS) is a
                  finite structure that embeds all valid insertion
                  functions and can be used to synthesize one. In
                  this work, we consider the problem of synthesizing
                  an optimal insertion function. Specifically, we
                  solve two optimal synthesis problems, one with
                  respect to the maximum total cost and the other
                  one with respect to the maximum mean cost. To
                  determine which optimal synthesis problem is more
                  suitable for a given opacity problem, we have also
                  developed a test that determines if a finite
                  total-cost insertion function exists. },
        URL = {http://terraswarm.org/pubs/374.html}
    }
    

Posted by Yi-Chin Wu on 18 Sep 2014.
Groups: tools

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.