Abstract
Opacity is an information flow property for dynamic systems describing plausible deniability, that is whether an eavesdropper can deduce that "secret" behavior has occurred. In particular, K-step opacity considers secret actions that have occurred within the last K-steps in the past. We consider the problem of K-step opacity enforcement over automata using obfuscation. We present a general framework for K-step opacity enforcement and transform the problem of enforcing K-step opacity to enforcing current-state opacity. We can then apply existing obfuscation synthesis methods for current-state opacity to K-step opacity. We demonstrate this approach by enforcing privacy in the context of a novel contact tracing model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
