Skip to main content

Advertisement

SpringerLink
Log in

Application of distributed parallel computing for dynamic visual cryptography

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We consider one applied global optimization problem where a set of feasible solutions is discrete and very large. The goal is to find optimal perfect gratings, which can guarantee high quality and security of the visual cryptography method. A priori estimation techniques, such as branch and bound type methods, cannot be applied to exclude an essential part of elements from the feasible set. Thus, a full search is required to solve this global optimization problem exactly, which is very computationally demanding. A library of C++ templates is developed that allows its user to implement parallel master–slave algorithms for his/her application without any knowledge of parallel programming API (application programming interface). Design of the templates allows users to build a parallel solver using MPI (message passing interface) API or distributed computing application using BOINC (Berkeley open infrastructure for network computing) API from the same C/C++ code with implementation of application-specific tasks. We build parallel and distributed computing solvers for the considered optimization problem and present results of computational experiments using a computer cluster and BOINC project for volunteer computing. Heuristic methods are also considered as an alternative to the full search algorithm. Due to complicated conditions defining feasible solutions (perfect gratings), genetic algorithms cannot be used to solve this problem efficiently. We propose two memetic heuristic algorithms, when a basic stochastic or simplified full search algorithm is combined with a local search algorithm. Parallel heuristic algorithms are also proposed and implemented. The efficiency and accuracy of heuristics are investigated and results of experiments are presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Allen B et al (2013) The Einstein@Home search for radio pulsars and PSR J2007+2722 discovery. Astrophys J 773(2):91

    Article  Google Scholar 

  2. Anderson DP (2004) Boinc: a system for public resource computing and storage. In: Proceedings of the 5th IEEE/ACM international workshop on grid computing, pp 1–7

  3. Baravykaite M, Čiegis R (2007) An implementation of a parallel generalized branch and bound template. Math Model Anal 12(3):277–289

    Article  MATH  Google Scholar 

  4. Beberg AL, Ensign DL, Jayachandran G, Khaliq S, Pande VS (2009) Folding@Home: lessons from eight years of volunteer distributed computing. Parallel and Distributed Processing Symposium, International, pp 1–8

  5. Blesa MJ, Hernàndez L, Xhafa F (2002) Parallel processing and applied mathematics: 4th international conference, PPAM 2001, Poland, September 9–12, 2001 Revised Papers, chap Parallel skeletons for Tabu search method based on search strategies and neighborhood partition, pp 185–193

  6. Čiegis R, Starikovičius V, Tumanova N, Ragulskis M, Palivonaite R (2015) Distributed parallel computing for visual cryptography algorithms. In: Proceedings of the second international workshop on sustainable ultrascale computing systems (NESUS 2015), pp 23–28

  7. Davies DW, Price WL (1989) Security for computer networks, 2nd edn. Wiley, New York

    Google Scholar 

  8. Depolli M, Trobec R, Filipič B (2013) Asynchronous master-slave parallelization of differential evolution for multi-objective optimization. Evol Comput 21(2):261–291

    Article  Google Scholar 

  9. Dorta I, Leon C, Rodriguez C, Rojas A (2003) Parallel skeletons for divide-and-conquer and branch-and-bound techniques. In: Proceedings of 11th Euromicro conference on parallel, distributed and network-based processing (Euro-PDP’03), IEEE, pp 292–298

  10. Gerald CF, Wheatley PO (2004) Applied numerical analysis. Addison-Wesley, Boston

    MATH  Google Scholar 

  11. Glover F, Kochenberger GA (2003) Handbook of metaheuristics, international series in operations research and management science. Springer, Berlin

    Book  Google Scholar 

  12. Goldberg D (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  13. Gonzalez-Velez H, Leyton M (2010) A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers. Softw Pract Exp 40(12):1135–1160

    Article  Google Scholar 

  14. Hegde C, Manu S, Shenoy PD, Venugopal K, Patnaik L (2008) Secure authentication using image processing and visual cryptography for banking applications. In: ADCOM 2008. 16th international conference on advanced computing and communications, IEEE, pp 65–72

  15. Horst R, Pardalos PM, Thoai NV (2000) Introduction to global optimization, 2nd edn. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  16. Korpela EJ (2012) SETI@Home, BOINC, and volunteer distributed computing. Annu Rev Earth Planet Sci 40(1):69–87

    Article  Google Scholar 

  17. Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing: design and analysis of algorithms. Benjamin/Cummings, San Francisco

    MATH  Google Scholar 

  18. Lewis A, Mostaghim S, Scriven I (2009) Asynchronous multi-objective optimisation in unreliable distributed environments. In: Lewis A, Mostaghim S, Randall M (eds) Biologically-inspired optimisation methods: parallel algorithms, systems and applications, studies in computational intelligence, vol 210. Springer, Heidelberg, pp 51–78

  19. Menezes AJ, van Oorschot PC, Vanstone SA (1996) Handbook of applied cryptography. CRC Press, Boca Raton

    Book  MATH  Google Scholar 

  20. Message Passing Interface Forum (1995) MPI: a message passing interface standard. http://www.mpi-forum.org

  21. Mostaghim S, Branke J, Lewis A, Schmeck H (2008) Parallel multi-objective optimization using master–slave model on heterogeneous resources. In: Evolutionary computation, 2008. CEC 2008. IEEE world congress on computational intelligence, pp 1981–1987

  22. Naor M, Shamir A (1995) Visual cryptography. In: De Santis A (ed) Advances in cryptology—EUROCRYPT’94, lecture notes in computer science, vol 950. Springer, Berlin, pp 1–12

  23. Palivonaite R, Fedaravicius A, Aleksa A, Ragulskis M (2013) Near-optimal moire grating for chaotic dynamic visual cryptography. In: Zaman H, Robinson P, Olivier P, Shih T, Velastin S (eds) Advances in visual informatics, lecture notes in computer science, vol 8237. Springer International Publishing, Switzerland, pp 48–58

    Chapter  Google Scholar 

  24. Ragulskis M, Aleksa A (2009) Image hiding based on time-averaging moiré. Opt Commun 282(14):2752–2759

    Article  Google Scholar 

  25. Ragulskis M, Aleksa A, Maskeliunas R (2009) Contrast enhancement of time averaged fringes based on moving average mapping functions. Opt Lasers Eng 47(7–8):768–773

    Article  Google Scholar 

  26. Ross A, Othman A (2011) Visual cryptography for biometric privacy. IEEE Trans Inform Forensics Secur 6(1):70–81

    Article  Google Scholar 

  27. Starikovičius V, Čiegis R, Iliev O (2011) A parallel solver for the design of oil filters. Math Model Anal 16(2):326–341

    Article  MATH  Google Scholar 

  28. Talbi EG, Mostaghim S, Okabe T, Ishibuchi H, Rudolph G, Coello Coello CA (2008) Parallel approaches for multiobjective optimization. In: Branke J, Deb K, Miettinen K, Slowinski R (eds) Multiobjective optimization: interactive and evolutionary approaches, lecture notes in computer science, vol 5252. Springer, Heidelberg, pp 349–372

Download references

Acknowledgments

The work presented in this paper has been partially supported by EU under the COST programme Action IC1305, ‘Network for Sustainable Ultrascale Computing (NESUS)’. This research was also funded by a Grant NUMMOD (No. MIP-074/2015) from the Research Council of Lithuania. Computations were performed on resources at the High Performance Computing Center “HPC Sauletekis” in Vilnius University Faculty of Physics. The authors would like to thank the referees for their comments which are helpful and constructive.

Author information

Authors and Affiliations

  1. Department of Mathematical Modeling, Vilnius Gediminas Technical University, Saulėtekio av. 11, 10223, Vilnius, Lithuania

    Raimondas Čiegis & Natalija Tumanova

  2. Laboratory of Parallel Computing, Vilnius Gediminas Technical University, Saulėtekio av. 11, 10223, Vilnius, Lithuania

    Vadimas Starikovičius

  3. Research Group for Mathematical and Numerical Analysis of Dynamical Systems, Kaunas University of Technology, Studentu 50-222, 51368, Kaunas, Lithuania

    Minvydas Ragulskis

Authors
  1. Raimondas Čiegis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadimas Starikovičius
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Natalija Tumanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Minvydas Ragulskis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vadimas Starikovičius.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Čiegis, R., Starikovičius, V., Tumanova, N. et al. Application of distributed parallel computing for dynamic visual cryptography. J Supercomput 72, 4204–4220 (2016). https://doi.org/10.1007/s11227-016-1733-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-016-1733-8

Keywords

Search

Navigation