Poliseek: A Fast XACML Policy Evaluation Engine Using Dimensionality Reduction and Characterized Search

Fan Deng, Zhenhua Yu (), Xinrui Zhan, Chongyu Wang, Xiaolin Zhang, Yangyang Zhang and Zilu Qin
Additional contact information
Fan Deng: Institute of Systems Security and Control, School of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an 710054, China
Zhenhua Yu: Institute of Systems Security and Control, School of Computer Science and Technology, Xi’an University of Science and Technology, Xi’an 710054, China
Xinrui Zhan: School of Computer Science and Technology, Xidian University, Xi’an 710071, China
Chongyu Wang: School of Computer Science and Technology, Xidian University, Xi’an 710071, China
Xiaolin Zhang: School of Cyber Engineering, Xidian University, Xi’an 710071, China
Yangyang Zhang: School of Computer Science and Technology, Xidian University, Xi’an 710071, China
Zilu Qin: School of Computer Science and Technology, Xidian University, Xi’an 710071, China

Mathematics, 2022, vol. 10, issue 23, 1-25

Abstract: Due to evaluation performance limits and compatibility problems with PDP (Policy Decision Point) in practical information systems, some established schemes have limits in handling massive complex requests. To address the existing challenges of fast rule match on interval values, we propose a novel policy evaluation engine, namely Poliseek with three desired modules. A preprocessing module of Poliseek is equipped with a static encoding strategy and converts the XACML rules and requests into four-dimensional numeric vectors in an attribute space. Owing to a novel optimization object of minimizing interval collisions, a dimensionality reducer and diffuser module can generate candidate values related to each rule vector in the identification space. These values and requests are handled by a fast policy evaluation module using well-constructed hash buckets and a characterized search algorithm. The experimental results show that if the number of requests reaches 10,000, Poliseek can find the target rule approximately 1090, 15, and 15 times faster than the Sun PDP, XEngine, and SBA-XACML, respectively. Poliseek also offers a fast evaluation progress of handling 10,000 complex policy rules with interval attribute values in 275.9 ms, which shows its strong robustness and practicality.

Keywords: dimensionality reduction; interval match; policy evaluation engine; policy decision point; XACML (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/23/4530/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/23/4530/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:23:p:4530-:d:989293

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().