Probabilistic opacity for Markov decision processes

@article{Brard2015ProbabilisticOF,
  title={Probabilistic opacity for Markov decision processes},
  author={B{\'e}atrice B{\'e}rard and Krishnendu Chatterjee and Nathalie Sznajder},
  journal={Inf. Process. Lett.},
  year={2015},
  volume={115},
  pages={52-59}
}
  • Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder
  • Published 2015
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • Opacity is a security property that guarantees that no information leaks in a system.We study opacity in systems modeled by Markov decision processes.For classical MDP, the value of the probabilistic disclosure is computable.In POMDP, most of the problems are undecidable.However, with natural restrictions, one can recover decidability of almost sure disclosure. Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with… CONTINUE READING

    Figures and Topics from this paper.

    Preserving opacity on Interval Markov Chains under simulation
    2
    Probabilistic Opacity in Refinement-Based Modeling
    1
    Infinite-step opacity of stochastic discrete-event systems
    4
    Optimal Information Release for Mixed Opacity in Discrete-Event Systems
    Opacity for linear constraint Markov chains
    1
    The Opacity of Real-Time Automata
    3
    Synthesis of Probabilistic Privacy Enforcement
    10
    Infinite-step opacity and K-step opacity of stochastic discrete-event systems
    16

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 52 REFERENCES
    Current-State Opacity Formulations in Probabilistic Finite Automata
    64
    Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme
    17
    Verification of $K$-Step Opacity and Analysis of Its Complexity
    64
    Qualitative Analysis of Partially-Observable Markov Decision Processes
    42
    Decidability of Opacity with Non-Atomic Keys
    19
    Towards Quantitative Analysis of Opacity
    17
    What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives
    27
    Quantitative Information Flow, with a View
    20
    Verification of K-step opacity and analysis of its complexity
    56
    Probabilistic ω-automata
    372