Skip to main content

Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels

  • Conference paper
  • First Online:
Digital Forensics and Watermarking (IWDW 2020)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12617))

Included in the following conference series:

  • 692 Accesses

Abstract

This paper presents a type of variable rate syndrome-trellis codes (VR-STC) for bursty channels. It can embed message bits with two different embedding rates. In the embedding, a cover vector is sliced into segments, and the embedding rates for each segment depend on the local channel distribution. The parities of stego segments are exploited to indicate the selected embedding rates according to a mapping function between parities and embedding rates. The core of the VR-STC is the parity-aware encoder, which can simultaneously output two candidate stego segments with different embedding rates and opposite parities, either of which can be used to constitute the final stego vector. A Viterbi algorithm is also suggested to find the closed stego segments. Besides, the mapping function between parities and embedding rates is designed by minimizing the embedding costs on a down sampled version of the cover vector. It can further improve the undetectability of the VR-STC. Experimental results on artificial signals and binary images suggest that the proposed VR-STC can provide high success rate of embedding and reduce the embedding cost on bursty channels.

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

Access this chapter

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. Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49380-8_21

    Chapter  Google Scholar 

  2. Fridrich, J., Goljan, M., Lisonek, P., Soukal, D.: Writing on wet paper. IEEE Trans. Sig. Process. 53(10), 3923–3935 (2005)

    Article  MathSciNet  Google Scholar 

  3. Filler, T., Judas, J., Fridrich, J.: Minimizing additive distortion in steganography using syndrome-trellis codes. IEEE Trans. Inf. Forensics Secur. 6(3), 920–935 (2011)

    Article  Google Scholar 

  4. Li, W., Zhang, W., Li, L., Zhou, H., Yu, N.: Designing near-optimal steganographic codes in practice based on polar codes. IEEE Trans. Commun. 68(7), 3948–3962 (2020)

    Article  Google Scholar 

  5. Sedighi, V., Cogranne, R., Fridrich, J.: Content-adaptive steganography by minimizing statistical detectability. IEEE Trans. Inf. Forensics Secur. 11(2), 221–234 (2015)

    Article  Google Scholar 

  6. Denemark, T., Fridrich, J.: Model based steganography with precover. Electron. Imaging 2017(7), 56–66 (2017)

    Article  Google Scholar 

  7. Köhler, O.M., Pasquini, C., Böhme, R.: On the statistical properties of syndrome trellis coding. In: Kraetzer, C., Shi, Y.-Q., Dittmann, J., Kim, H.J. (eds.) IWDW 2017. LNCS, vol. 10431, pp. 331–346. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64185-0_25

    Chapter  Google Scholar 

  8. Dirfaux, F.: Key frame selection to represent a video. In: Proceedings 2000 International Conference on Image Processing (Cat. No. 00CH37101), Volume 2, pp. 275–278. IEEE (2000)

    Google Scholar 

  9. Kobayashi, M., Okabe, T., Sato, Y.: Detecting forgery from static-scene video based on inconsistency in noise level functions. IEEE Trans. Inf. Forensics Secur. 5(4), 883–892 (2010)

    Article  Google Scholar 

  10. Oh, S.M., Cho, S., Kim, J.H., Kwun, J.: VoIP scheduling algorithm for AMR speech codec in IEEE 802.16 e/m system. IEEE Commun. Lett. 12(5), 374–376 (2008)

    Google Scholar 

  11. Forney, G.: Burst-correcting codes for the classic bursty channel. IEEE Trans. Commun. Technol. 19(5), 772–781 (1971)

    Article  Google Scholar 

  12. Park, J., Park, J., Bhunia, S.: VL-ECC: variable data-length error correction code for embedded memory in DSP applications. IEEE Trans. Circuits Syst. II: Express Briefs 61(2), 120–124 (2013)

    Article  Google Scholar 

  13. Namba, K., Lombardi, F.: Parallel decodable two-level unequal burst error correcting codes. IEEE Trans. Comput. 64(10), 2902–2911 (2014)

    Article  MathSciNet  Google Scholar 

  14. Demirci, M., Reviriego, P., Maestro, J.A.: Unequal error protection codes derived from double error correction orthogonal Latin square codes. IEEE Trans. Comput. 65(9), 2932–2938 (2015)

    Article  MathSciNet  Google Scholar 

  15. Shin, D., Park, J., Park, J., Paul, S., Bhunia, S.: Adaptive ECC for tailored protection of nanoscale memory. IEEE Des. Test 34(6), 84–93 (2016)

    Article  Google Scholar 

  16. Ker, A.D.: On the relationship between embedding costs and steganographic capacity. In: Proceedings of the 6th ACM Workshop on Information Hiding and Multimedia Security, pp. 115–120 (2018)

    Google Scholar 

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

    Article  Google Scholar 

  18. Yeung, Y., Lu, W., Xue, Y., Huang, J., Shi, Y.Q.: Secure binary image steganography with distortion measurement based on prediction. IEEE Trans. Circuits Syst. Video Technol. 30(5), 1423–1434 (2020)

    Article  Google Scholar 

  19. Lu, H., Kot, A.C., Shi, Y.Q.: Distance-reciprocal distortion measure for binary document images. IEEE Sig. Process. Lett. 11(2), 228–231 (2004)

    Article  Google Scholar 

  20. Cheng, J., Kot, A.C.: Objective distortion measure for binary text image based on edge line segment similarity. IEEE Trans. Image Process. 16(6), 1691–1695 (2007)

    Article  MathSciNet  Google Scholar 

  21. Ker, A.D., Pevny, T.: Batch steganography in the real world. In: Proceedings of the on Multimedia and Security, pp. 1–10 (2012)

    Google Scholar 

  22. Wang, Z., Zhang, X., Qian, Z.: Practical cover selection for steganography. IEEE Sig. Process. Lett. 27, 71–75 (2020)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Key R&D Program of Guangdong Province (Grant No. 2019B010136003), National Natural Science Foundation of China (Grant No. 61802145), Natural Science Foundation of Guangdong Province, China (Grant No. 2019B010137005, 2017A030313390, 2018A030313387), Science and Technology Program of Guangzhou, China (Grant No. 201804010428), the Fundamental Research Funds for the Central Universities, the Opening Project of State Key Laboratory of Information Security, the Opening Project of Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bingwen Feng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Feng, B., Liu, Z., Wei, K., Lu, W., Lin, Y. (2021). Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels. In: Zhao, X., Shi, YQ., Piva, A., Kim, H.J. (eds) Digital Forensics and Watermarking. IWDW 2020. Lecture Notes in Computer Science(), vol 12617. Springer, Cham. https://doi.org/10.1007/978-3-030-69449-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69449-4_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69448-7

  • Online ISBN: 978-3-030-69449-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics