Skip to main content
Springer Nature Link
Log in

Just process me, without knowing me: a secure encrypted domain processing based on Shamir secret sharing and POB number system

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

High end computational and storage resources provided by the cloud based paradigm are attracting the global infrastructure. However, the wide attacking surface of the public cloud may pose threat to security if outsourcing of the multimedia content is done without obscuring. Employing the traditional encryption schemes may serve as a feasible solution. However, processing in the encrypted domain to fetch the same services as plaintext domain may not be possible due to limitations of the encryption schemes. In this article, a secured scheme based on Shamir’s secret sharing and permutation ordered binary (POB) number system for processing of image in encrypted domain itself over the cloud severs has been proposed. Obfuscated shares are obtained by distributing the image information into multiple shares that can be sent and processed in frequency domain over the cloud servers. The performance of various image operations such as denoising, dehazing, edge sharpening, unsharp masking, contrast enhancement, etc has been validated on these encrypted shares in the frequency domain along with the comparative results in the plaintext domain. The processed image can be obtained from these processed shares only by the authentic entity possessing the secret keys.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Alharthi SS, Atrey PK (2010) An improved scheme for secret image sharing. In: IEEE International conference on multimedia and expo (ICME), IEEE, pp 1661–1666

    Google Scholar 

  2. Alharthi SS, Atrey PK (2010) Further improvements on secret image sharing scheme. In: Proceedings of the 2nd ACM workshop on multimedia in forensics, security and intelligence (ACM), pp 53–58

    Google Scholar 

  3. Ali M, Khan SU, Vasilakos AV (2015) Security in cloud computing: opportunities and challenges. Inform Sci 305:357–383

    Article  MathSciNet  Google Scholar 

  4. Asmuth C, Bloom J (1983) A modular approach to key safeguarding. IEEE Trans Inf Theory 30(2):208

    Article  MathSciNet  Google Scholar 

  5. Benaloh JC (1986) Secret sharing homomorphisms: keeping shares of a secret secret Conference on the theory and application of cryptographic techniques. Springer, pp 251–260

    Google Scholar 

  6. Bhatnagar G, Wu QMJ, Raman B (2012) Robust gray-scale logo watermarking in wavelet domain. Comput Electr Eng 38(5):1164. Special issue on recent advances in security and privacy in distributed communications and image processing. ISSN 0045–7906. doi:10.1016/j.compeleceng.2012.02.002

    Article  Google Scholar 

  7. Bogdanov D (2007) Foundations and properties of Shamir’s secret sharing scheme research seminar in cryptography. University of Tartu, Institute of Computer Science

  8. Brakerski Z, Gentry C, Vaikuntanathan V (Leveled) Fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd innovations in theoretical computer science conference ITCS ’12. ACM, New York, pp 309–325. doi:10.1145/2090236.2090262.

  9. Buyya R, Broberg J, Goscinski A M (2010) Cloud computing: principles and paradigms, vol 87. Wiley

  10. Damgård I, Jurik M (2001) A generalisation, a simplification and some applications of paillier’s probabilistic public-key system. In: Proceedings of the 4th international workshop on practice and theory in public key cryptography: public key cryptography PKC ’01. ISBN 3-540-41658-7. Springer-Verlag, London, pp 119–136

    Google Scholar 

  11. Deepika M, Sreekumar A (2016) A novel secret sharing scheme using POB number system and CRT. Int J Appl Eng Res 11(3):2049–2054

    Google Scholar 

  12. El Gamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. In: Proceedings of CRYPTO 84 on advances in cryptology. ISBN 0-387-15658-5, vol 9. Springer-Verlag New York Inc., New York, pp 10–18

  13. Fontaine C, Galand F (2007) A survey of homomorphic encryption for nonspecialists. EURASIP J Inf Secur 2007(15):1. ISSN 1687–4161. doi:10.1155/2007/13801

    Google Scholar 

  14. Lathey A, Atrey PK (2015) Image enhancement in encrypted domain over cloud. ACM Trans Multimedia Comput Commun Appl 11(3):38:1. doi:10.1145/2656205

    Article  Google Scholar 

  15. Melchor CA, Fau S, Fontaine C, Gogniat G, Sirdey R (2013) Recent advances in homomorphic encryption: a possible future for signal processing in the encrypted domain. IEEE Signal Process Mag 30(2):108

    Article  Google Scholar 

  16. Mignotte M (1982) How to share a secret. In: Workshop on cryptography. Springer, pp 371–375

    Google Scholar 

  17. Mohanty M, Atrey P K, Ooi WT (2012) Secure cloud-based medical data visualization. In: Proceedings of the 20th ACM international conference on multimedia. ACM, pp 1105–1108

    Google Scholar 

  18. Mohanty M, Ooi WT, Atrey PK (2013) Scale me, crop me, knowme not: supporting scaling and cropping in secret image sharing. In: ICME. IEEE Computer Society, pp 1–6

    Google Scholar 

  19. Mohanty M, Ooi WT, Atrey PK (2013) Scale me, crop me, knowme not: supporting scaling and cropping in secret image sharing. In: IEEE international conference on multimedia and expo (ICME). IEEE, pp 1–6

    Google Scholar 

  20. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) International conference on the theory and application of cryptographic techniques prague, Czech Republic, May 2–6, 1999 proceedings. Advances in cryptology — EUROCRYPT ’99. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 223–238. doi:10.1007/3-540-48910-X-16 ISBN 978-3-540-48910-8

  21. Rawat S, Raman B (2011) A chaotic system based fragile watermarking scheme for image tamper detection. AEU - Int J Electr Commun 65(10):840–847. doi:10.1016/j.aeue.2011.01.016. Cited By 0

  22. SaghaianNejadEsfahani SM, Luo Y, Sen-ching SC (2012) Privacy protected image denoising with secret shares. In: 2012 19th IEEE international conference on image processing. IEEE, pp 253–256

    Google Scholar 

  23. Shamir A (1979) How to share a secret. Commun ACM 22(11):612

    Article  MathSciNet  MATH  Google Scholar 

  24. Sheikh LCHR, Wang Z, Bovik A. http://live.ece.utexas.edu/research/quality

  25. Sreekumar A, Sundar SB (2009) An efficient secret sharing scheme for n out of n scheme using POB-number system. Hack 2009:33

    Google Scholar 

  26. Thien CC, Lin JC (2002) Secret image sharing. Comput Graph 26(5):765

    Article  Google Scholar 

  27. Upmanyu M, Namboodiri AM, Srinathan K, Jawahar CV (2009) Efficient privacy preserving video surveillance. In: ICCV. IEEE Computer Society, pp 1639–1646

    Google Scholar 

  28. van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 24–43. doi:10.1007/978-3-642-13190-5-2

  29. Zhao B, Delp EJ (2011) Secret sharing in the encrypted domain with secure comparison. In: Global telecommunications conference (GLOBECOM 2011). IEEE, pp 1–5

    Google Scholar 

Download references

Acknowledgements

This work was supported by Information Security Education and Awareness (ISEA) Project (phase II) MIT-867-CSE, DeitY, New Delhi, INDIA.

Author information

Authors and Affiliations

  1. Indian Institute of Technology Roorkee, Roorkee, India

    Priyanka Singh, Balasubramanian Raman & Manoj Misra

Authors
  1. Priyanka Singh
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Balasubramanian Raman
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Manoj Misra
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Priyanka Singh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, P., Raman, B. & Misra, M. Just process me, without knowing me: a secure encrypted domain processing based on Shamir secret sharing and POB number system. Multimed Tools Appl 77, 12581–12605 (2018). https://doi.org/10.1007/s11042-017-4906-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-017-4906-4

Keywords