Soft-SCS: Improving the Security and Robustness of the Scalar-Costa-Scheme by Optimal Distribution Matching

  • Patrick Bas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6958)


In this paper we propose an extension of the Scalar-Costa-Scheme (SCS), called Soft-SCS, which offers better or equal achievable rates than SCS for the AWGN channel. After recalling the principle of SCS we highlight its secure implementations regarding the Watermarked contents Only Attack, and we also describe the relations between the alphabet size and the secure embedding parameters. Since the gap between the achievable rates of secure-SCS and SCS is important for low Watermark to Noise Ratios (WNR) regimes, we introduce Soft-SCS, a scheme which enables to achieve security by matching a given distribution of watermarked content while minimizing the embedding distortion. The embedding is given by the optimal transport and the distortion is computed using the transportation theory. Contrary to SCS, the distribution of watermarked contents is not piecewise uniform of width \(\text{(1-\ensuremath{\alpha})\ensuremath{\Delta}}\), but contains affine portions parametrized by a new embedding parameter β used to maximize the robusness of Soft-SCS. As a consequence, the achievable rates of Soft-SCS for low WNR regimes for both its secure and robust implementations are higher than for SCS. Our conclusions are that (1) the loss of performance between the secure and robust implementations of Soft-SCS for WNR regimes smaller than 0 dB is negligible and (2) the robust implementation of Soft-SCS is equal to SCS for WNR regimes over 0 dB.


Watermark Scheme Achievable Rate Optimal Transport Host Signal Alphabet Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bas, P., Doërr, G.: Evaluation of an optimal watermark tampering attack against dirty paper trellis schemes. In: ACM Multimedia and Security Workshop, Oxford, UK (September 2008)Google Scholar
  2. 2.
    Bas, P., Hurri, J.: Vulnerability of dm watermarking of non-iid host signals to attacks utilising the statistics of independent components. IEE Proceeding of Transaction on Information Security 153, 127–139 (2006)CrossRefGoogle Scholar
  3. 3.
    Bas, P., Westfeld, A.: Two key estimation techniques for the Broken Arrows watermarking scheme. In: MM&Sec 2009: Proceedings of the 11th ACM Workshop on Multimedia and Security, pp. 1–8. ACM, New York (2009)Google Scholar
  4. 4.
    Cayre, F., Bas, P.: Kerckhoffs-based embedding security classes for WOA data-hiding. IEEE Transactions on Information Forensics and Security 3(1) (March 2008)Google Scholar
  5. 5.
    Cayre, F., Fontaine, C., Furon, T.: Watermarking security: Theory and practice. IEEE Transactions on Signal Processing Special Issue “Supplement on Secure Media II” (2005)Google Scholar
  6. 6.
    Costa, M.: Writing on dirty paper. IEEE Trans. on Information Theory 29(3), 439–441 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Doërr, G.J., Dugelay, J.L.: Danger of low-dimensional watermarking subspaces. In: ICASSP 2004, 29th IEEE International Conference on Acoustics, Speech, and Signal Processing, Montreal, Canada, May 17-21 (May 2004)Google Scholar
  8. 8.
    Eggers, J., Su, J., Girod, B.: A blind watermarking scheme based on structured codebooks. In: IEE Colloquium Secure Images and Image Authentication, London, UK, pp. 4/1–4/6 (April 2000)Google Scholar
  9. 9.
    Eggers, J.J., Buml, R., Tzschoppe, R., Girod, B.: Scalar costa scheme for information embedding. IEEE Trans. on Signal Processing 51(4), 1003–1019 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Guillon, P., Furon, T., Duhamel, P.: Applied public-key steganography. In: Proceedings of SPIE: Electronic Imaging 2002, Security and Watermarking of Multimedia Contents IV, San Jose, CA, USA, vol. 4675 (January 2002)Google Scholar
  11. 11.
    Mathon, B., Bas, P., Cayre, F., Macq, B.: Optimization of natural watermarking using transportation theory. In: MM&Sec 2009: Proceedings of the 11th ACM Workshop on Multimedia and Security, pp. 33–38. ACM, New York (2009)Google Scholar
  12. 12.
    Pérez-Freire, L., Pérez-González, F., Furon, T., Comesaña, P.: Security of lattice-based data hiding against the Known Message Attack. IEEE Transactions on Information Forensics and Security 1(4), 421–439 (2006)CrossRefGoogle Scholar
  13. 13.
    Pérez-Freire, L., Pérez-González, F., Voloshynovskiy, S.: Revealing the true achievable rates of scalar costa scheme. In: 2004 IEEE 6th Workshop on Multimedia Signal Processing, pp. 203–206. IEEE, Los Alamitos (2004)CrossRefGoogle Scholar
  14. 14.
    Pérez-Freire, L., Pérez-González, F.: Spread spectrum watermarking security. IEEE Transactions on Information Forensics and Security 4(1), 2–24 (2009)CrossRefGoogle Scholar
  15. 15.
    Villani, C.: Topics in Optimal Transportation. American Mathematical Society, Providence (2003)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Patrick Bas
    • 1
  1. 1.CNRS - LAGIS, Ecole centrale de LilleVilleneuve D’ascq CedexFrance

Personalised recommendations