Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On observability of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
Decentralized supervisory control of discrete-event systems
Information Sciences: an International Journal - Robotics and Automation/Control Series
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Efficient computation of unique input/output sequences in finite-state machines
IEEE/ACM Transactions on Networking (TON)
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Checking for Language Inclusion Using Simulation Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Applicability of fair simulation
Information and Computation
Discrete Event Dynamic Systems
Opacity generalised to transition systems
International Journal of Information Security
Information Sciences: an International Journal
Modelling Opacity Using Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
On the verification of intransitive noninterference in mulitlevel security
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.07 |
In this paper, we formulate and analyze methodologies for verifying the notion of initial-state opacity in discrete event systems that are modeled as non-deterministic finite automata with partial observation on their transitions. A system is initial-state opaque if the membership of its true initial state to a set of secret states remains opaque (i.e., uncertain) to an intruder who observes system activity through some projection map. Initial-state opacity can be used to characterize security requirements in a variety of applications, including tracking problems in sensor networks. In order to model and analyze the intruder capabilities regarding initial-state opacity, we first address the initial-state estimation problem in a non-deterministic finite automaton via the construction of an initial-state estimator. We analyze the properties and complexity of the initial-state estimator, and show how the complexity of the verification method can be greatly reduced in the special case when the set of secret states is invariant. We also establish that the verification of initial-state opacity is a PSPACE-complete problem.