Skip to main content

Robust Watermarking for Multiple Images and Users Based on Visual Cryptography

  • Conference paper
Genetic and Evolutionary Computing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 238))

Abstract

In this paper, we proposed a robust watermarking worked for multiple images and multiple users. This scheme adopted polynomial-based image secret sharing, DWT transform, and chaos technique. Secret sharing scheme provides better efficient on protecting copyright with multiple users, specifically in some situation, we are not easy to recover watermark by all participants. In order to verify copyright easier, we use polynomial-based image secret sharing scheme to reach a supervised verification. Any two users whose owns capability can recover the watermark with the trust authority. The experimental result shows that this scheme is efficient and robust.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hou, Y.C., Chen, P.M.: An asymmetric watermarking scheme based on visual cryptography. In: Proceedings of WCCC-ICSP, 5th Int. Conf. on Signal Processing, pp. 992–995 (2000)

    Google Scholar 

  2. Hsu, C.S., Hou, Y.C.: Copyright protection scheme for digital images using visual cryptography and sampling methods. Optical Engineering 44(7), 077003.1–077003.10 (2005)

    Google Scholar 

  3. Lou, D.C., Tso, H.K., Liu, J.L.: A copyright protection scheme for digital images using visual cryptography technique. Computer Standards & Interfaces 29(1), 1530–1541 (2006)

    Google Scholar 

  4. Liu, F., Wu, C.K.: Robust visual cryptography-based watermarking scheme for multiple cover images and multiple owners. Information Security (IET) 5(2), 121–128 (2011)

    Article  Google Scholar 

  5. Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tai, G.-C., Chang, L.-W.: Visual cryptography for digital watermarking in still images. In: Aizawa, K., Nakamura, Y., Satoh, S. (eds.) PCM 2004, Part II. LNCS, vol. 3332, pp. 50–57. Springer, Heidelberg (2004)

    Google Scholar 

  7. Voyatzis, G., Pitas, I.: Applications of toralautomorphisms in image watermarking. In: Proceedings of Image Processing, vol. 2, pp. 237–240. Thessaloniki Univ., Greece (1996)

    Google Scholar 

  8. Wang, M.S., Chen, W.C.: A hybrid DWT-SVD copyright protection scheme based on k-means clustering and visual cryptography. Computer Standards & Interfaces 31(4), 757–762 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chang, SS., Lin, CH., Chen, TH., Lin, KS. (2014). Robust Watermarking for Multiple Images and Users Based on Visual Cryptography. In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01796-9_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01795-2

  • Online ISBN: 978-3-319-01796-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics