Skip to Main content Skip to Navigation
Conference papers

Runtime Enforcement of K-step Opacity

Yliès Falcone 1 Hervé Marchand 2
2 SUMO - SUpervision of large MOdular and distributed systems
IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL, Inria Rennes – Bretagne Atlantique
Abstract : We study the enforcement of K-step opacity at runtime. In K-step opacity, the knowledge of the secret is of interest to the attacker within K steps after the secret occurs and becomes obsolete afterwards. We introduce the mechanism of runtime enforcer that is placed between the output of the system and the attacker and enforces opacity using delays. If an output event from the system violates K-step opacity, the enforcer stores the event in the memory, for the minimal number of system steps until the secret is no longer interesting to the attacker (or, K-step opacity holds again).
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00863223
Contributor : Hervé Marchand <>
Submitted on : Wednesday, September 18, 2013 - 2:40:22 PM
Last modification on : Wednesday, June 16, 2021 - 3:41:19 AM
Long-term archiving on: : Friday, December 20, 2013 - 3:03:19 PM

File

cdc2013.pdf
Files produced by the author(s)

Identifiers

Citation

Yliès Falcone, Hervé Marchand. Runtime Enforcement of K-step Opacity. 52nd IEEE Conference on Decision and Control, Dec 2013, Florence, Italy. pp.7271-7278, ⟨10.1109/CDC.2013.6761043⟩. ⟨hal-00863223⟩

Share

Metrics

Record views

705

Files downloads

527