Skip to main content

Near-Optimal Time Function for Secure Dynamic Visual Cryptography

  • Conference paper
Advances in Visual Computing (ISVC 2011)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 6939))

Included in the following conference series:

  • 2690 Accesses

Abstract

The strategy for the selection of an optimal time function for dynamic visual cryptography is presented in this paper. Evolutionary algorithms are used to obtain the symmetric piece-wise uniform density function. The fitness function of each chromosome is associated with the derivative of the standard of the time-averaged moiré image. The reconstructed near-optimal time function represents the smallest interval of amplitudes where an interpretable moiré pattern is generated in the time-averaged image. Such time functions can be effectively exploited in computational implementation of secure dynamic visual cryptography.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  2. Shyu, S.: Efficient visual secret sharing scheme for color images. Pattern Recognit. 39, 866–880 (2006)

    Article  MATH  Google Scholar 

  3. Zhou, Z., Arce, G., Crescenzo, D.: Halftone visual cryptography. IEEE Trans. Image Process. 15, 2441–2453 (2006)

    Article  Google Scholar 

  4. Shyu, S.: Image encryption by random grids. Pattern Recognit. 40, 1014–1031 (2007)

    Article  MATH  Google Scholar 

  5. Hu, C., Tseng, W.: Cheating prevention in visual cryptography. IEEE Trans. Image Process 16, 36–45 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cimato, S., De Prisco, R., De Santis, A.: Colored visual cryptography without color darkening. Theor. Comput. Sci. 374, 261–276 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Yang, C.N., Chen, T.S.: Extended visual secret sharing schemes: improving the shadow image quality. Int. J. Pattern Recognit. Artificial Intelligence 21, 879–898 (2007)

    Article  Google Scholar 

  8. Kobayashi, A.S.: Handbook on Experimental Mechanics, 2nd edn. SEM, Bethel (1993)

    Google Scholar 

  9. Patorski, K., Kujawinska, M.: Handbook of the moiré fringe technique. Elsevier, Amsterdam (1993)

    Google Scholar 

  10. Post, D., Han, B., Ifju, P.: High sensitivity moiré: experimental analysis for mechanics and materials. Springer, Berlin (1997)

    Google Scholar 

  11. Dai, F.L., Wang, Z.Y.: Geometric micron moiré. Opt. Laser Eng. 31, 191–208 (1999)

    Article  Google Scholar 

  12. Desmedt, Y., Van Le, T.: Moiré cryptography. In: 7th ACM Conf. on Computer and Communications Security, pp. 116–124 (2000)

    Google Scholar 

  13. Ragulskis, M., Aleksa, A.: Image hiding based on time-averaging moiré. Optics Communications 282, 2752–2759 (2009)

    Article  Google Scholar 

  14. Ragulskis, M., Aleksa, A., Navickas, Z.: Image hiding based on time-averaged fringes produced by non-harmonic oscillations. J. Opt. A: Pure Appl. Opt. 11, 125411 (2009)

    Article  Google Scholar 

  15. Ragulskis, M., Navickas, Z.: Hash functions construction based on time average moiré. J. Discrete and Continuous Dynamical Systems-Series B 8, 1007–1020 (2007)

    Article  MATH  Google Scholar 

  16. Ragulskis, M., Aleksa, A., Maskeliunas, R.: Contrast enhancement of time-averaged fringes based on moving average mapping functions. Optics and Lasers in Engineering 47, 768–773 (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

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petrauskiene, V., Ragulskiene, J., Sakyte, E., Ragulskis, M. (2011). Near-Optimal Time Function for Secure Dynamic Visual Cryptography. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2011. Lecture Notes in Computer Science, vol 6939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24031-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24031-7_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24030-0

  • Online ISBN: 978-3-642-24031-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics