Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Identifying the most critical trajectory of the spread of a social engineering attack between two users. / Хлобыстова, Анастасия Олеговна; Абрамов, Максим Викторович; Тулупьев, Александр Львович.
The Second International Scientific and Practical Conference “Fuzzy Technologies in the Industry – FTI 2018”. CEUR Workshop Proceedings.. Vol. 2258 2018. p. 38-43 (CEUR Workshop Proceedings).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Identifying the most critical trajectory of the spread of a social engineering attack between two users
AU - Хлобыстова, Анастасия Олеговна
AU - Абрамов, Максим Викторович
AU - Тулупьев, Александр Львович
PY - 2018
Y1 - 2018
N2 - In this paper, estimates of the probability of success of a multi-pass social engineering attack are considered. The purpose of the article is to identify the most critical path for the spread of a multi-way socio-engineering attack between two users. An approach is proposed for finding the most critical trajectories, an estimate of the probability of success of the passage of an attack on which will be the highest. Formally, the problem reduces to finding a path in the graph, in which the product of the weights of all edges entering the given path is maximal. The use of known algorithms in the solution of the problem was complicated by the fact that the weights of edges of the social graph are estimates of probability. This problem was solved by means of identical mathematical transformations.
AB - In this paper, estimates of the probability of success of a multi-pass social engineering attack are considered. The purpose of the article is to identify the most critical path for the spread of a multi-way socio-engineering attack between two users. An approach is proposed for finding the most critical trajectories, an estimate of the probability of success of the passage of an attack on which will be the highest. Formally, the problem reduces to finding a path in the graph, in which the product of the weights of all edges entering the given path is maximal. The use of known algorithms in the solution of the problem was complicated by the fact that the weights of edges of the social graph are estimates of probability. This problem was solved by means of identical mathematical transformations.
UR - http://www.scopus.com/inward/record.url?scp=85058163966&partnerID=8YFLogxK
M3 - Conference contribution
VL - 2258
T3 - CEUR Workshop Proceedings
SP - 38
EP - 43
BT - The Second International Scientific and Practical Conference “Fuzzy Technologies in the Industry – FTI 2018”. CEUR Workshop Proceedings.
T2 - 2nd International Scientific and Practical Conference "Fuzzy Technologies in the Industry - FTI", FTI 2018
Y2 - 23 October 2018 through 25 October 2018
ER -
ID: 36791819