Algorithm for searching bridges of specified types in the protection graph for Take-Grant protection model
Denis Brechka
TL;DR
This paper presents an algorithm based on breadth-first search for identifying specific bridge types in protection graphs within the Take-Grant security model.
Contribution
It introduces a novel algorithm tailored for efficiently finding particular bridges in protection graphs of the Take-Grant model.
Findings
Algorithm successfully identifies specified bridges in protection graphs.
Efficient search method improves security analysis processes.
Applicable to various types of bridges in security models.
Abstract
The article contains the algorithm for searching a certain kind of bridges in the protection graph of Take-Grant model. The proposed algorithm is based on a classical breadth-first search algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Access Control and Trust · Internet Traffic Analysis and Secure E-voting