Skip to main content

Luring Conditions and Their Proof of Necessity through Mathematical Modelling

  • Conference paper
  • 4521 Accesses

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7678)

Abstract

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.

Keywords

  • Social Engineering
  • Luring
  • Honeypot
  • Contrapositive
  • Entropy
  • Bayesian Graphs
  • Probability

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-35542-4_13
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-35542-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   72.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Check Point Software Technologies Survey on, The Risk of Social Engineering on Information Security: A survey of IT Professional Dimensional Research (September 2011), http://www.checkpoint.com/surveys/socialeng1509/socialeng.htm

  2. Gupta, S.K., Gupta, A., Damor, R., Goyal, V.: Luring: A framework to induce a suspected user into Context Honeypot. In: Proceedings of the 2nd International Workshop on Digital Forensics and Incident Analysis (WDFIA 2007), Samos, Greece, August 27-28, pp. 55–64. IEEE Computer Society (2007)

    Google Scholar 

  3. Wikipedia; Information about Proof by Contrapositive, http://en.wikipedia.org/wiki/Proof_by_contrapositive

  4. Flores, N.E.: Non-Paternalistic Altruism and Welfare Economics. Journal of Public Economics 83(2), 293–305 (2002)

    CrossRef  Google Scholar 

  5. Nait Abdalla, M.A.: An Extended Framework for Default Reasoning. In: Csirik, J.A., Demetrovics, J. (eds.) FCT 1989. LNCS, vol. 380, pp. 339–348. Springer, Heidelberg (1989)

    CrossRef  Google Scholar 

  6. Shannon, C.E.: Prediction and entropy of printed English. Bell Systems Technical Journal 30, 50–64 (1951)

    MATH  Google Scholar 

  7. Maasoumi, E., Racine, J.: Entropy and predictability of stock market returns. Journal of Econometrics 107(1-2), 291–312 (2002)

    MathSciNet  MATH  CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, A., Khurana, P., Mathur, R. (2012). Luring Conditions and Their Proof of Necessity through Mathematical Modelling. In: Srinivasa, S., Bhatnagar, V. (eds) Big Data Analytics. BDA 2012. Lecture Notes in Computer Science, vol 7678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35542-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35542-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35541-7

  • Online ISBN: 978-3-642-35542-4

  • eBook Packages: Computer ScienceComputer Science (R0)