Tseng, C.-IC.-ITsengYEONG-SUNG LINTsang, P.-H.P.-H.Tsang2020-02-112020-02-112007https://scholars.lib.ntu.edu.tw/handle/123456789/457555With the prevalence and varied applications of the Internet, new cyber-crimes are mushrooming all over cyberspace. The crimes are characterized by their "silent" attack behavior, which enables an attacker to exploit the vulnerabilities of a system and steal information, without actually crashing the system. Information theft is a relatively new cyber-crime that not only causes property damage and monetary loss to its victims, but can also ruin their reputations. To detect and analyze the serious impact of information theft, we model it as a mathematical programming problem, defined by the AS model. In the model, an attacker applies his limited attack power intelligently to the targeted network in order to steal as much valuable information as possible. A Lagrangean relaxation-based algorithm is adopted to solve the AS problem, and the "susceptibility" metric is used to evaluate the effect of the attack.Information Theft; Lagrangean Relaxation; Network Attack; Optimization Problem; Resource Allocation; Scale-free Networks[SDGs]SDG16Information thefts; Lagrangean Relaxation; Network attack; Optimization problems; Scale free networks; Crime; Cybernetics; Economics; Information science; Information systems; Management information systems; Mathematical programming; Problem solving; Resource allocation; Systems analysis; Computer crimeNear optimal attack strategies for the maximization of information theftconference paper2-s2.0-84869824121https://www.scopus.com/inward/record.uri?eid=2-s2.0-84869824121&partnerID=40&md5=0f9d5f67a9e2ac2ae6db2e5763e861a9