Shankar, DD, Gireeshkumar T, Nath HV.
2011.
Steganalysis for Calibrated and Lower Embedded Uncalibrated Images, 2011. Swarm, Evolutionary, and Memetic Computing. (
Panigrahi, Bijaya Ketan, Suganthan, Ponnuthurai Nagaratnam, Das, Swagatam, Satapathy, Suresh Chandra, Eds.).:294-301., Berlin, Heidelberg: Springer Berlin Heidelberg
AbstractThe objective of steganalysis is to detect messages hidden in a cover images, such as digital images. The ultimate goal of a steganalyst is to extract and decipher the secret message. In this paper, we present a powerful new blind steganalytic scheme that can reliably detect hidden data with a relatively small embedding rate in JPEG images as well as using a technique known as calibration. This would increase the success rate of steganalysis by detecting data in transform domain. This scheme is feature based in the sense that features that are sensitive to embedding changes are being employed as means of steganalysis. The features are extracted in DCT domain. DCT domain features have extended DCT features and Markovian features merged together in calibration technique to eliminate the drawbacks of both(inter and intra block dependency) respectively. For the lesser embedding rate, the features are considered separately to evolve a better classification rate. The blind steganalytic technique has a broad spectrum of analyzing different embedding techniques The feature set contains 274 features by merging both DCT features and Markovian features. The extracted features are being fed to a classifier which helps to distinguish between a cover and stego image. Support Vector Machine is used as classifier here.
Nath, HV.
2011.
Vulnerability Assessment Methods – A Review, 2011. Advances in Network Security and Applications. (
Wyld, David C., Wozniak, Michal, Chaki, Nabendu, Meghanathan, Natarajan, Nagamalai, Dhinaharan, Eds.).:1-10., Berlin, Heidelberg: Springer Berlin Heidelberg
AbstractThis paper reviews the major contributions in the field of Vulnerability Assessment from 1990 onwards. Even well administered networks are vulnerable to attack .Vulnerabilities are weaknesses in the requirements, design, and implementation, which attackers exploit to compromise the system. Researchers have proposed a variety of methods like graph-based algorithms to generate attack trees (or graphs), “black-box” and “whitebox” analysis, using Mobile Ambients, using Honepots, different Vulnerability tools and their Scoring System’s, and so on. After surveying lot of research papers in the field, the amount of existing works for each method is identified and classified. Especially, the graph-based algorithms itself is a major area for researchers. The paper concludes with some inferences and results obtained in each method so can be used as a guideline for researchers.