Skip to main content
SpringerLink
Log in

Efficient & secure image availability and content protection

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Digital images are among the most communicated multimedia data types. Many of these images include private data that require a high level of security. The traditional image security schemes rely on cryptographic solutions to ensure the confidentiality or the authentication of image contents, and to ensure that the encryption key is not compromised. However, the continuous evolution of the attackers’ capabilities is making it harder than ever to achieve the goal of safeguarding the private data against breaches. Moreover, the centralization aspect of images’ storage makes them prone to availability attacks. In this paper, we propose a distributed and secure storage scheme for images, based on the Modified Information Dispersal Algorithm (MIDA), and taking into consideration the trade-off between the high security level and the associated computational overhead. The proposed solution applies block permutation on the image to ensure data confidentiality and then, divides it into k fragments that are encoded using the proposed parallel modified IDA. The output consists of n encoded fragments, instead of k, to ensure data availability. Next, each encoded fragment is authenticated using a lightweight Message Authentication Algorithm (MAA) to ensure data integrity with source authentication. Finally, the encoded fragments are distributed over n storage nodes (or multi-cloud providers). The resilience degree of such redundancy is (n − k), since only k fragments are required to reconstruct the original images. All the cryptographic steps such as permutation, IDA encoding and MAA consist of simple operations and they are based on a dynamic key. This ensures a high level of security since in each session, a new key is used to produce different cryptographic primitives as well as the update primitives, which are used to update the permutation and selection tables. The implementation results show that the proposed scheme meets the desired cryptographic properties to guard against different attacks. Finally, the performance tests show that the proposed scheme is lightweight with low overhead in terms of computations, communication and storage.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Adi S (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahmadian AM, Amirmazlaghani M (2019) A novel secret image sharing with steganography scheme utilizing optimal asymmetric encryption padding and information dispersal algorithms. Signal Processing, Image Communication 74:78–88

    Article  Google Scholar 

  3. Anonymized (2016) Poster: a keyless efficient algorithm for data protection by means of fragmentation. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, CCS’16. ACM, New York, pp 1745–1747

  4. Bao L, Yi S, Zhou Y (2017) Combination of sharing matrix and image encryption for lossless (k,n)-secret image sharing. IEEE Trans Image Process 26(12):5618–5631

    Article  MathSciNet  MATH  Google Scholar 

  5. Barker EB, Kelsey JM (2011) Recommendation for random number generation using deterministic random bit generators (revised). US Department of Commerce, Technology Administration, National Institute of Standards and Technology, Computer Security Division, Information Technology Laboratory

  6. Blakley GR (1899) Safeguarding cryptographic keys. In: afips. IEEE, p 313

  7. Blundo C, Bonis AD, De Santis A (2001) Improved schemes for visual cryptography . Designs, Codes and Cryptography 24(3):255–278

    Article  MathSciNet  MATH  Google Scholar 

  8. Cimato S, Yang C-N (2017) Visual cryptography and secret image sharing. CRC Press, Boca Raton

    MATH  Google Scholar 

  9. Cincilla P, Boudguiga A, Hadji M, Kaiser A (2015) Light blind: why encrypt if you can share?. In: 2015 12th international joint conference on e-business and telecommunications (ICETE), vol 04, pp 361–368

  10. Daemen J, Rijmen V (2013) The design of Rijndael: AES-the advanced encryption standard. Springer, Berlin

    MATH  Google Scholar 

  11. Dwivedi AD, Morawiecki P, Singh R, Dhar S (2018) Differential-linear and related key cryptanalysis of round-reduced scream. Inf Process Lett 136:5–8

    Article  MathSciNet  MATH  Google Scholar 

  12. Fabre J-C, Deswarte Y, Randell B (1994) Designing secure and reliable applications using fragmentation-redundancy-scattering: an object-oriented approach. Springer, Berlin, pp 21–38

    Google Scholar 

  13. Guo C, Chang C-C, Qin C (2012) A hierarchical threshold secret image sharing. Pattern Recogn Lett 33(1):83–91

    Article  Google Scholar 

  14. Hore A, Ziou D (2010) Image quality metrics: Psnr vs. ssim. In: 2010 20th international conference on pattern recognition (icpr). IEEE, pp 2366–2369

  15. Hou Y-C (2003) Visual cryptography for color images. Pattern Recogn 36 (7):1619–1629

    Article  Google Scholar 

  16. Hugo K (1994) Secret sharing made short. In: Proceedings of the 13th annual international cryptology conference on advances in cryptology, CRYPTO’93. Springer, London, pp 136–146

  17. Kapusta K, Memmi G, Noura H (2016) Poster: a keyless efficient algorithm for data protection by means of fragmentation. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security. ACM, pp 1745–1747

  18. Kapusta K, Memmi G, Noura H (2017) Secure and resilient scheme for data protection in unattended wireless sensor networks. In: Cyber security in networking conference (CSNet), 2017 1st. IEEE, pp 1–8

  19. Kapusta K, Memmi G, Noura H (2017) Secure and resilient scheme for data protection in unattended wireless sensor networks. In: 1st cyber security in networking conference, CSNet 2017, Rio de Janeiro, Brazil, October 18-20, 2017, pp 1–8

  20. Lee K-H, Chiu P-L (2014) Digital image sharing by diverse image media. IEEE Trans Inform Forensics Secur 9(1):88–98

    Article  Google Scholar 

  21. Li M (2012) On the confidentiality of information dispersal algorithms and their erasure codes. CoRR arXiv:1206.4123

  22. Li P, Yang C-N, Wu C-C, Kong Q, Ma Y (2013) Essential secret image sharing scheme with different importance of shadows. J Vis Commun Image Represent 24(7):1106–1114

    Article  Google Scholar 

  23. Lin C-C, Tsai W-H (2003) Visual cryptography for gray-level images by dithering techniques. Pattern Recogn Lett 24(1-3):349–358

    Article  MATH  Google Scholar 

  24. Lukac R, Plataniotis KN (2005) Bit-level based secret sharing for image encryption. Pattern Recogn 38(5):767–772

    Article  MATH  Google Scholar 

  25. Massoudi A, Lefebvre F, De Vleeschouwer C, Macq B, Quisquater J-J (2008) Overview on selective encryption of image and video: challenges and perspectives. Eurasip Journal on Information Security 2008(1):179290

    Google Scholar 

  26. Mostefaoui A, Noura H, Fawaz Z (2015) An integrated multimedia data reduction and content confidentiality approach for limited networked devices. Ad Hoc Netw 32:81–97

    Article  Google Scholar 

  27. Naor M, Shamir A (1994) Visual cryptography. In: Workshop on the theory and application of of cryptographic techniques. Springer, Berlin, pp 1–12

  28. Naor M, Shamir A (2017) Visual cryptography [j/ol]. Lect Notes Comput Sci 950(1):1–12

    MATH  Google Scholar 

  29. Noura H, Chehab A, Noura M, Couturier R, Mansour MM (2018) Lightweight, dynamic and efficient image encryption scheme. Multimed Tools Appl, pp 1–35

  30. Noura H, Chehab A, Sleem L, Noura M, Couturier Rl, Mansour MM (2018) One round cipher algorithm for multimedia iot devices. Multimed Tools Appl, pp 1–31

  31. Noura H, Couroussé D (2015) Lightweight, dynamic, and flexible cipher scheme for wireless and mobile network. In: International conference on ad hoc networks. Springer, pp 225–236

  32. Noura H, Hussein S, Martin S, Boukhatem L, Agha KA (2015) Erdia: an efficient and robust data integrity algorithm for mobile and wireless networks. In: 2015 IEEE wireless communications and networking conference (WCNC). 2103–2108, IEEE

  33. Noura H, Martin S, Agha KA, Chahine K (2014) Erss-rlnc: efficient and robust secure scheme for random linear network coding. Computer Networks 75:Part A:99–112

    Article  Google Scholar 

  34. Noura H, Melki R, Chehab A, Mansour MM, Martin S (2018) Efficient and secure physical encryption scheme for low-power wireless m2m devices. In: 2018 14th international wireless communications & mobile computing conference (IWCMC). IEEE, pp 1267–1272

  35. Noura H, Sleem L, Noura M, Mansour M M, Chehab A, Couturier R (2017) A new efficient lightweight and secure image cipher scheme. Multimed Tools Appl, pp 1–28

  36. Noura HN, Chehab A, Couturier R (2019) Efficient & secure cipher scheme with dynamic key-dependent mode of operation. Signal Process Image Commun 78:448–464

    Article  Google Scholar 

  37. Noura HN, Noura M, Chehab A, Mansour M M, Couturier R (2018) Efficient and secure cipher scheme for multimedia contents. Multimed Tools Appl, pp 1–30

  38. Paar C, Pelzl J (2009) Understanding cryptograph: a textbook for students and practitioners, 1st edn. Springer Publishing Company, Incorporated, Berlin

    MATH  Google Scholar 

  39. Paul G, Maitra S (2011) RC4 stream cipher and its variants. CRC Press, Boca Raton

    Book  MATH  Google Scholar 

  40. Rabi MO (1989) Efficient dispersal of information for security, load balancing, and fault tolerance. J ACM 36(2):335–348

    Article  MathSciNet  Google Scholar 

  41. Resch JK, Plank JS (2011) Aont-rs: blending security and performance in dispersed storage systems. In: Proceedings of the 9th USENIX conference on file and Stroage technologies, FAST’11. USENIX Association, Berkeley, pp 14–14

  42. Rivest RL (1997) All-or-nothing encryption and the package transform. Springer, Berlin, pp 210–218

    MATH  Google Scholar 

  43. Shankar K, Elhoseny M, Satheesh Kumar R, Lakshmanaprabu SK, Yuan X (2018) Secret image sharing scheme with encrypted shadow images using optimal homomorphic encryption technique. Journal of Ambient Intelligence and Humanized Computing, pp 1–13

  44. Shi R, Zhong H, Huang L, Luo Y (2008) A (t, n) secret sharing scheme for image encryption. In: 2008 Congress on image and signal processing, vol 3. IEEE, pp 3–6

  45. Shyu SJ (2006) Efficient visual secret sharing scheme for color images. Pattern Recogn 39(5):866–880

    Article  MATH  Google Scholar 

  46. Stallings W (2017) Cryptography and network security: principles and practice. Pearson Upper Saddle River, NJ

  47. Thien C-C, Lin J-C (2002) Secret image sharing. Computers & Graphics 26 (5):765–770

    Article  Google Scholar 

  48. Ulutas G, Ulutas M, Nabiyev VV (2013) Secret image sharing scheme with adaptive authentication strength. Pattern Recogn Lett 34(3):283–291

    Article  MATH  Google Scholar 

  49. Verheul ER, Van Tilborg HCA (1997) Constructions and properties of k out of n visual secret sharing schemes. Des Codes Crypt 11(2):179–196

    Article  MathSciNet  MATH  Google Scholar 

  50. Wang Z, Bovik A C, Sheikh H R, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Transactions on Image Processing 13(4):600–612

    Article  Google Scholar 

  51. Wei S-C, Hou Y-C, Lu Y-C (2015) A technique for sharing a digital image. Computer Standards & Interfaces 40:53–61

    Article  Google Scholar 

  52. Wu X, Weng J, Yan WQ (2018) Adopting secret sharing for reversible data hiding in encrypted images. Signal Process 143:269–281

    Article  Google Scholar 

  53. Yan X, Wang S, El-Latif AAA, Niu X (2015) Visual secret sharing based on random grids with abilities of and and xor lossless recovery. Multimed Tools Appl 74(9):3231–3252

    Article  Google Scholar 

  54. Yang C-N, Huang S-M (2010) Constructions and properties of k out of n scalable secret image sharing. Opt Commun 283(9):1750–1762

    Article  Google Scholar 

  55. Yang C-N, Laih C-S (2000) New colored visual secret sharing schemes. Designs, Codes and Cryptography 20(3):325–336

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This paper is partially supported with funds from the Maroun Semaan Faculty of Engineering and Architecture at the American University of Beirut and also from the EIPHI Graduate School (contract “ANR-17-EURE-0002”). We also thank the supercomputer facilities of the Mésocentre de calcul de Franche-Comté.

Author information

Authors and Affiliations

  1. Faculty of Computer Studies, Arab Open University, Beirut, Lebanon

    Hassan Noura

  2. Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon

    Hassan Noura, Ola Salman & Ali Chehab

  3. FEMTO-ST Institute, Univ. Bourgogne-Franche-Comté CNRS UMR, 6174, Belfort, France

    Mohamad Noura & Raphaël Couturier

Authors
  1. Hassan Noura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamad Noura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ola Salman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raphaël Couturier
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ali Chehab
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raphaël Couturier.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Noura, H., Noura, M., Salman, O. et al. Efficient & secure image availability and content protection. Multimed Tools Appl 79, 22869–22904 (2020). https://doi.org/10.1007/s11042-020-09057-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-09057-4

Keywords

Search

Navigation