Beacon-Based Firing Control for Authorization Security in Workflows

被引:3
作者
Zhong, Wenjing [1 ,2 ]
Zhao, Jinjing [2 ]
Hu, Hesuan [1 ,3 ,4 ]
机构
[1] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China
[2] Natl Key Lab Sci & Technol Informat Syst Secur, Beijing 100101, Peoples R China
[3] Nanyang Technol Univ, Sch Comp Sci & Engn, Coll Engn, Singapore 639798, Singapore
[4] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710054, Peoples R China
基金
中国国家自然科学基金;
关键词
Authorization-related security; beacon-extended Petri nets (BEPNs); beacon-based firing control; workflows; PETRI NETS; SEPARATION; SATISFIABILITY; REQUIREMENTS; CONSTRAINTS; MODEL; DUTY; SPECIFICATION; ENVIRONMENTS;
D O I
10.1109/TR.2023.3235785
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the noteworthy investigations in workflows is the implementation of authorization-related security requirements. There are two typical security requirements, i.e., separation of duty (SoD) and binding of duty (BoD). However, most of the previous works are only focused on SoD while ignoring BoD. In this article, we consider both of them by proposing an extended-structural implementation approach, namely beacon-based firing control, to enforce security requirements. Thanks to the flexibility of beacon-based firing control, both BoD and SoD can be enforced in a straightforward way with no sophisticated operations for their implementation, although they are a pair of security requirements in conflict. As a preparation of beacon-based firing control, we define the beacon-extended Petri nets (PNs) by introducing a new object, namely beacon, to PNs so as to lay the foundation. In addition, we present the firing-based linear equations and inequalities for BoD and SoD to provide the standardized descriptions for their implementation. For the sake of expansibility, the applicability analysis is provided for the more general security requirements. Ultimately, the comparative experiments and discussions are presented to show the effiectiveness and efficiency of the proposed approach.
引用
收藏
页码:1594 / 1609
页数:16
相关论文
共 55 条
[1]  
Ahn G.-J., 2000, ACM Transactions on Information and Systems Security, V3, P207, DOI 10.1145/382912.382913
[2]   SATMC: a SAT-based model checker for security protocols, business processes, and security APIs [J].
Armando, Alessandro ;
Carbone, Roberto ;
Compagna, Luca .
INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (02) :187-204
[3]   Model checking authorization requirements in business processes [J].
Armando, Alessandro ;
Ponta, Serena Elisa .
COMPUTERS & SECURITY, 2014, 40 :1-22
[4]   Dynamic Enforcement of Abstract Separation of Duty Constraints [J].
Basin, David ;
Burri, Samuel J. ;
Karjoth, Guenter .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2012, 15 (03)
[5]   A comprehensive modeling framework for role-based access control policies [J].
Ben Fadhel, Ameni ;
Bianculli, Domenico ;
Briand, Lionel .
JOURNAL OF SYSTEMS AND SOFTWARE, 2015, 107 :110-126
[6]   The Authorization Policy Existence Problem [J].
Berge, Pierre ;
Crampton, Jason ;
Gutin, Gregory ;
Watrigant, Remi .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2020, 17 (06) :1333-1344
[7]  
Bertolissi C., 2015, P 10 ACM S INF COMP, P297
[8]   Solving Multi-Objective Workflow Satisfiability Problems with Optimization Modulo Theories Techniques [J].
Bertolissi, Clara ;
dos Santos, Daniel R. ;
Ranise, Silvio .
SACMAT'18: PROCEEDINGS OF THE 23RD ACM SYMPOSIUM ON ACCESS CONTROL MODELS & TECHNOLOGIES, 2018, :117-128
[9]   On the satisfiability of authorization requirements in business process [J].
Bo, Yang ;
Xia, Chunhe ;
Zhang, Zhigang ;
Lu, Xinzheng .
FRONTIERS OF COMPUTER SCIENCE, 2017, 11 (03) :528-540
[10]   A Workflow Criticality-Based Approach to Bypass the Workflow Satisfiability Problem [J].
Boughrous, Monsef ;
El Bakkali, Hanan .
SECURITY AND COMMUNICATION NETWORKS, 2021, 2021