Data-Dependent Confidentiality in DCR Graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Data-Dependent Confidentiality in DCR Graphs. / Geraldo, Eduardo; Seco, João Costa; Hildebrandt, Thomas.
Proceedings of the 25th International Symposium on Principles and Practice of Declarative Programming (PPDP 2023). Association for Computing Machinery, 2023. 7.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Data-Dependent Confidentiality in DCR Graphs
AU - Geraldo, Eduardo
AU - Seco, João Costa
AU - Hildebrandt, Thomas
N1 - Publisher Copyright: © 2023 Owner/Author.
PY - 2023
Y1 - 2023
N2 - We present DCRSec, a confidentially aware declarative process language with data that employs data-dependent security levels and an information flow monitor that prevents the violation of information flow policies. Data-dependent security levels have been used to shape precise information flow policies and properly identify security compartments. We use an illustrative example to show that it also models process instances in a flexible but precise way. The semantics of the language is based on a version of the Dynamic Condition Response Graph language, which allows for declaring data-aware, event-based processes with finitary and infinitary computations subject to liveness properties and dynamically spawned sub-processes. The key technical contribution is to provide a termination-insensitive information flow monitor and prove non-interference, a soundness property, and transparency in all traces of DCRSec processes.
AB - We present DCRSec, a confidentially aware declarative process language with data that employs data-dependent security levels and an information flow monitor that prevents the violation of information flow policies. Data-dependent security levels have been used to shape precise information flow policies and properly identify security compartments. We use an illustrative example to show that it also models process instances in a flexible but precise way. The semantics of the language is based on a version of the Dynamic Condition Response Graph language, which allows for declaring data-aware, event-based processes with finitary and infinitary computations subject to liveness properties and dynamically spawned sub-processes. The key technical contribution is to provide a termination-insensitive information flow monitor and prove non-interference, a soundness property, and transparency in all traces of DCRSec processes.
KW - Business Processes
KW - DCR Graphs
KW - Information Flow Control
KW - Privacy
KW - Security Monitoring
KW - Software Security
U2 - 10.1145/3610612.3610619
DO - 10.1145/3610612.3610619
M3 - Article in proceedings
AN - SCOPUS:85175452733
BT - Proceedings of the 25th International Symposium on Principles and Practice of Declarative Programming (PPDP 2023)
PB - Association for Computing Machinery
T2 - 25th International Symposium on Principles and Practice of Declarative Programming, PPDP 2023 - As part of the ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity, SPLASH 2023, including LOPSTR 2023
Y2 - 22 October 2023 through 23 October 2023
ER -
ID: 390399152