Skip to main content
SpringerLink
Log in

Using r-indiscernibility Relations to Hide the Presence of Information for the Least Significant Bit Steganography Technique

  • Conference paper
  • First Online:
Information and Software Technologies (ICIST 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1078))

Included in the following conference series:

Abstract

The paper presents some preliminary results concerning modification of the least significant bit steganography method. Using r - indiscernibility relations one can embed some information in the container in a semi-random way, whereas it can be reconstructed in a deterministic way. The combination of bits of RGB Bytes allows the bits of information to be hidden by means of a fixed mask. Each Byte of a pixel that contains a fixed combination of bits indiscernible in the fixed ratio with the mask may store the bit of information in the least significant bit. The bits indiscernible in other ratios form random gaps that leads to hiding the presence of information. In the paper we have implemented some steganography systems to test our approach by hiding the image in a cover picture.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Artiemjew, L.: “Lost in time” - wooden bas-relief from the collection of Lech Artiemjew artistic activity. https://www.facebook.com/lech.artiemjew

  2. Baluja, S.: Hiding images within images. IEEE Trans. Pattern Anal. Mach. Intell. (2019)

    Google Scholar 

  3. Guillermito: BMP chi-square attack v0.1

    Google Scholar 

  4. Morkel, T., Eloff, J.H., Olivier, M.S.: An overview of image steganography. In: ISSA, pp. 1–11 (2005)

    Google Scholar 

  5. Krenn, R.: Steganography and steganalysis. http://www.krenn.nl/univ/cry/steg/article.pdf

  6. Johnson, N.F., Jajodia, S.: Exploring steganography: seeing the unseen. Computer 31(2), 26–34 (1998)

    Article  Google Scholar 

  7. Wang, H., Wang, S.: Cyber warfare: steganography vs. steganalysis. Commun. ACM 47(10), 76–82 (2004)

    Article  Google Scholar 

  8. Silman, J.: Steganography and steganalysis: an overview, Sans Institute. https://www.researchgate.net/publication/242743284_Steganography_and_Steganalysis_An_Overview

  9. Neeta, D., Snehal, K., Jacobs, D.: Implementation of LSB steganography and its evaluation for various bits. In: 1st International Conference on Digital Information Management, Portugal, pp. 173–178, 19–21 September 2006

    Google Scholar 

  10. Partow, A.: C++ Bitmap Library. http://partow.net/programming/bitmap/index.html

  11. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  Google Scholar 

  12. Polkowski, L.: Rough Sets: Mathematical Foundations. Physica Verlag, Heidelberg (2002)

    Book  Google Scholar 

  13. Polkowski, L.: Formal granular calculi based on rough inclusions. In: Proceedings of IEEE 2005 Conference on Granular Computing, GrC 2005, Beijing, China, pp. 57–62. IEEE Press (2005)

    Google Scholar 

  14. Polkowski, L.: Granulation of knowledge in decision systems: the approach based on rough inclusions. The method and its applications. In: Kryszkiewicz, M., Peters, J.F., Rybinski, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 69–79. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73451-2_9

    Chapter  Google Scholar 

  15. Polkowski, L.: A unified approach to granulation of knowledge and granular computing based on rough mereology: a survey. In: Pedrycz, W., Skowron, A., Kreinovich, V. (eds.) Handbook of Granular Computing, pp. 375–400. Wiley, Chichester (2008)

    Chapter  Google Scholar 

  16. Polkowski, L.: Approximate Reasoning by Parts: An Introduction to Rough Mereology. Intelligent Systems Reference Library. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22279-5

    Book  Google Scholar 

  17. Polkowski, L., Artiemjew, P.: Granular Computing in Decision Approximation - An Application of Rough Mereology. ISRL. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-12880-1

    Book  Google Scholar 

  18. Westfeld, A., Pfitzmann, A.: Attacks on steganographic systems. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 61–76. Springer, Heidelberg (2000). https://doi.org/10.1007/10719724_5

    Chapter  Google Scholar 

  19. Wozniak, M., Polap, D.: Object detection and recognition via clustered features. Neurocomputing 320, 76–84 (2018)

    Article  Google Scholar 

  20. Zadeh, L.A.: Fuzzy sets and information granularity. In: Gupta, M., Ragade, R., Yager, R.R. (eds.) Advances in Fuzzy Set Theory and Applications, pp. 3–18. North-Holland, Amsterdam (1979)

    Google Scholar 

  21. BeFunky’s all-in-one online Creative Platform - Photo Editing and Graphic Design Made for Everyone. https://www.befunky.com/

Download references

Acknowledgements

The research has been supported by grant 23.610.007-300 from Ministry of Science and Higher Education of the Republic of Poland.

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Warmia and Mazury in Olsztyn, Olsztyn, Poland

    Piotr Artiemjew & Aleksandra Kislak-Malinowska

Authors
  1. Piotr Artiemjew
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksandra Kislak-Malinowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piotr Artiemjew .

Editor information

Editors and Affiliations

  1. Kaunas University of Technology, Kaunas, Lithuania

    Robertas Damaševičius

  2. Kaunas University of Technology, Kaunas, Lithuania

    Giedrė Vasiljevienė

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Artiemjew, P., Kislak-Malinowska, A. (2019). Using r-indiscernibility Relations to Hide the Presence of Information for the Least Significant Bit Steganography Technique. In: Damaševičius, R., Vasiljevienė, G. (eds) Information and Software Technologies. ICIST 2019. Communications in Computer and Information Science, vol 1078. Springer, Cham. https://doi.org/10.1007/978-3-030-30275-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30275-7_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30274-0

  • Online ISBN: 978-3-030-30275-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation