Luring is a social engineering technique used to capture individuals having malicious intent of breaching the information security defense of an organization. Certain conditions(Need, Environment, Masquerading Capability and Unawareness) are necessary for its effective implementation. To the best of our knowledge the necessity of these conditions is not yet proved so far. The proof is essential as it not only facilitates automation of the luring mechanism but also paves way for proof of the completeness of the conditions. The present paper attempts on this aspect by invoking three approaches namely probability, entropy and proof by contra positive. Also, the concept of cost effectiveness is introduced. Luring is acceptable if its cost works out less than cost of data theft. © Springer-Verlag 2012.
CITATION STYLE
Gupta, A., Khurana, P., & Mathur, R. (2012). Luring conditions and their proof of necessity through mathematical modelling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7678 LNCS, pp. 148–157). https://doi.org/10.1007/978-3-642-35542-4_13
Mendeley helps you to discover research relevant for your work.