Observational determinism for concurrent program security
By Steve Zdancewic, A. Myers. 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., 2003
301 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/da2ee4f05b4d255c35ba0a913ec03c5dd7d28a79
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Michael R. Clarkson
- Danfeng Zhang
- Fred B. Schneider
- Markus Norman Rabe
- Bernd Finkbeiner
- César Sánchez
- Kristopher K. Micinski
- Masoud Koleini
In Computer Networks and Communications
Citations in the corpus
- Hyperproperties (2010, background): “Suppose that an action of the system is to output share i.”
- Temporal Logics for Hyperproperties (2013, background): “A (nondeterministic) program satisfies observational determinism [77] if every pair of traces with the same initial low observation remain indistinguishable for low users.”
- A Hardware Design Language for Timing-Sensitive Information-Flow Security (2015, background): “Our formal definition of information flow security is based on observational determinism [33, 48], a generalization of noninterference [12] that provides a strong end-to-end security guarantee even for nondeterministic systems.”
- Noninterference via Symbolic Execution (2012, background): “The policy has been substantially studied in the language-based security community [16] and typically relies on information flow type systems [15, 21, 22]; however, these are criticized for being conservative and rejecting many secure programs.”