Skip to main content
Log in

Keyless dynamic optimal multi-bit image steganography using energetic pixels

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Steganography plays an important role to hide data in apparently innocuous media (e.g., image, audio, video, text, etc.). Since most of the steganographic algorithms do not consider the image content while locating the message bearing pixels, in most occasions, they are bound to defeat against visual, structural and statistical attacks. We distribute the message bits in selective parts of a cover image, particularly in the ‘busy’ part, i.e., where a perceptible change in the pixel intensity occurs, using a variety of embedding schemes. The energetic pixels, as per our definition, capture this notion of ‘busy’ part of the image and our data hiding schemes keep the energy function invariant between the cover image and its stego version for lossless data extraction. The schemes do not need to share any key/seed or a pass-phrase between the sender and the receiver. We show that our proposed algorithms provide imperceptible visual distortions for embedding data at most 4 bits per pixels with high embedding efficiencies and can withstand popular first order statistical tests.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Bas P, Filler T, Pevny T (2011) Break our steganographic system, the ins and outs of organizing BOSS. Lecture notes in computer science, vol 6958/2011. Information Hiding, Czech Republic, pp 59–70

    Google Scholar 

  2. Cheddad A, Condell J, Curran K, Mc Kevitt P (2010) Digital image steganography: survey and analysis of current methods. Signal Process 90(3):727–752

    Article  MATH  Google Scholar 

  3. Cipra B (1987) An introduction to the Ising model. Am Math Mon 94(10):937–959

    Article  MathSciNet  Google Scholar 

  4. Coremen T, Leiserson C, Rivest R, Stein C (2001) Introduction to algorithm, 2nd edn. McGraw Hill

  5. Das SK, Dhara BC (2015) A new secret image sharing with arithmetic coding. In: Proceedings of 2015 IEEE international conference on research in computational intelligence and networks, Kolkata, pp 395–399

  6. Dagar E, Dagar S (2014) LSB based image steganography using x-box mapping. In: IEEE international conference on advances in computing, communications and informatics (ICACCI), New Delhi , pp 24–27

  7. Deshmukh PU, Pattewar TM (2014) A novel approach for edge adaptive steganography on LSB insertion technique. In: IEEE international conference on information communication and embedded systems (ICICES), Chennai, pp 27–28

  8. Dumitrescu S, Wu X, Memon N (2002) On steganalysis of random LSB embedding in continuous-tone images. In: IEEE ICIP 2002, vol III. (September, New York, pp 641–644

  9. Feng B, Lu W, Sun W (2015) Secure binary image steganography based on minimizing the distortion on the texture. IEEE Trans Inf Forensics Secur 10(2):243–255

    Article  Google Scholar 

  10. Filler T, Fridrich J (2010) Gibbs construction in steganography. IEEE Trans Inf Forensics Secur 5(4):705–720

    Article  Google Scholar 

  11. Fridrich J, Goljan M, Dui R (2001) Reliable detection of LSB steganography in color and grayscale images. In: Proceedings of the ACM workshop on multimedia and security, Ottawa, pp 27–30

  12. Fridrich J, Lisonek P (2007) Grid colorings in steganography. IEEE Trans Inf Theory 53(4):1547–1549

    Article  MathSciNet  MATH  Google Scholar 

  13. Fridrich J, Lisonek P, Soukal D (2008) On steganographic embedding efficiency, information hiding. In: 8th international workshop, vol 4437, Alexandria, pp 282–296

  14. Fridrich J, Kodovsky J (2012) Rich models for steganalysis of digital images. IEEE Trans Inf Forensics Secur 7(3):868–882

    Article  Google Scholar 

  15. Hajizadeh M, Helfroush MS, Dehghani MJ, Tashk A (2010) A robust blind image watermarking method using local maximum amplitude wavelet coefficient quantization. Adv Electr Comput Eng 10(3):96–101

    Article  Google Scholar 

  16. Jain AK (1989) Fundamentals of digital image processing. Prentice Hall

  17. Johnson NF, Jajodia S (1998) Steganalysis of images using current steganography software. In: Proceedings of the 2nd international workshop on information hiding, pp 273–289

  18. Luo W, Huang F, Huang J (2010) Edge adaptive image steganography based on LSB matching revisited. IEEE Trans Inf Forensics Secur 5(2):201–214

    Article  Google Scholar 

  19. Mandal JK, Das D (2012) Colour image steganography based on pixel value differencing in spatial domain. Int J Inf Sci Tech (IJIST) 2(4)

  20. Mukherjee I, Paul G (2013) Efficient multi-bit image steganography in spatial domain. In: Bagchi A et al (eds) Chapter 21. ISBN: 978-3-642-45203-1, vol 8303. LNCS, Springer, pp 270–284

  21. Nakatani H (1992) Boundary value problem of image modification. Opt Eng 31:280–286

    Article  Google Scholar 

  22. Oskoei MA, Hu H (2010) A survey on edge detection methods, technical report: CES-506, School of Computer Science & Electronic Engineering, University of Essex, U.K.

  23. Park Y, Kang H, Shin S, Kwon K (2005) An image steganography using pixel characteristics. In: International conference on computational intelligence and security (CIS 2005). Lecture Notes in Computer Science, vol 3802. Springer, pp 581–588

  24. Paul G, Davidson I, Mukherjee I, Ravi SS (2012) Keyless steganography in spatial domain using energetic pixels. In: Venkatakrishnan V et al (eds) Proceedings of the 8th international conference on information systems security (ICISS). ISBN: 978-3-642-35129-7, vol 7671. LNCS, Springer, Guwahati, pp 134–148

    Google Scholar 

  25. Provos N (2001) Defending against statistical steganalysis. In: 10th USENIX security symposium, pp 325–335

  26. Rai S, Dubey R (2012) A novel keyless algorithm for steganography. In: 2012 students conference on engineering and systems (SCES), pp 1–4. doi:10.1109/SCES.2012.6199069

  27. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MathSciNet  MATH  Google Scholar 

  28. Steganography Software Archive., http://www.jjtc.com/Steganography/tools.html

  29. Tanaka H, Tamura S, Tanaka S (1977) On assembling subimages into a mosaic image. IEEE Trans Syst Man Cybern SMC-7:42–48

  30. Tashk A, Danyali H, Alavianmehr MA (2012) A modified dual watermarking scheme for digital images with tamper localization/detection and recovery capabilities

  31. The Gifshuffle Home Page., http://www.darkside.com.au/gifshuffle

  32. Wayner P (2002) Disappearing cryptography - information hiding, steganography & watermarking, 2nd edn. Morgan Kaufmann Publishers. ISBN: 1-55860-769-2

  33. Westfeld A, Pfitzmann A (1999) Attacks on steganographic systems. In: Proceedings the 3rd international workshop on information hiding, LNCS 1768. Springer-Verlag, pp 61–76

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Goutam Paul.

Additional information

This is a substantially revised and extended version of the paper [24] . This generalizes the single-bit per pixel (least significant bit (LSB)) based embedding of [24] to multi-bit, i.e., up to 4 bits per pixel. Thus, [24] may be considered a very special case of the current work. Sections 4 and 6 are new technical contributions in this paper. Moreover, Section 5 has been thoroughly updated to add analysis for multiple bits instead of only the LSB. Analysis of bitplanes was not performed in [24]. However, this has been done in the current work and the summary of the analysis is presented in the form of a new table, namely, Table 3. Theorem 5 related to the monotonicity of the number of non-zero energetic pixels is a new addition. Analysis of optimal choice of number of bits to be embedded per pixel and optimal capacity are also completely new contributions in the current version. Further, resistance against structural attacks was missing from [24] and has been added here in Section 5.3. We theoretically derive the expressions for embedding efficiency of our schemes and show that it is higher than many other schemes. This was absent in [24].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paul, G., Davidson, I., Mukherjee, I. et al. Keyless dynamic optimal multi-bit image steganography using energetic pixels. Multimed Tools Appl 76, 7445–7471 (2017). https://doi.org/10.1007/s11042-016-3319-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3319-0

Keywords

Navigation