%0 Conference Proceedings
%T Dynamic Workflow Adjustment with Security Constraints
%+ Santa Clara University
%+ University at Albany [SUNY]
%+ Institute for Infocomm Research - I²R [Singapore]
%+ New Jersey Institute of Technology [Newark] (NJIT)
%A Lu, Haibing
%A Hong, Yuan
%A Yang, Yanjiang
%A Fang, Yi
%A Duan, Lian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 28th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Vienna, Austria
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Vijay Atluri
%Y Günther Pernul
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Data and Applications Security and Privacy XXVIII
%V LNCS-8566
%P 211-226
%8 2014-07-14
%D 2014
%R 10.1007/978-3-662-43936-4_14
%K workflow
%K security
%K dynamic
%K satisfiability
%Z Computer Science [cs]Conference papers
%X Dynamic workflow adjustment studies how to minimally adjust existing user-task assignments, when a sudden change occurs, e.g. absence of users, so that all tasks are being attended and no constraint is violated.In particular, we study two key questions: (i) Will the workflow still be satisfiable given a change? (ii) If the answer is yes, how to find a satisfying assignment with the minimum perturbation to the old system? We consider various types of changes, including absence of a user, addition of a separation-of-duty constraint, addition of a binding-of-duty constraint, and revocation of a user-to-task authorization, study their theoretical properties and formulate them into the well-studied Boolean satisfiability problem, which enables a system engineer without much technical background to solve problems by using standard satisfiability solvers. A step further, towards more efficient solutions for our specific problems, we propose customized algorithms by adapting and tailoring the state-of-art algorithms inside standard solvers. Our work would have implications for business process management, staffing, and cost planning.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01284857/document
%2 https://inria.hal.science/hal-01284857/file/978-3-662-43936-4_14_Chapter.pdf
%L hal-01284857
%U https://inria.hal.science/hal-01284857
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-LNCS-8566
%~ IFIP-WG11-3