Skip to main content

A General (k, n) Threshold Secret Image Sharing Construction Based on Matrix Theory

  • Conference paper
  • First Online:
Book cover Data Science (ICPCSEE 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 727))

  • 2513 Accesses

Abstract

Shamir proposed a classic polynomial-based secret sharing (SS) scheme, which is also widely applied in secret image sharing (SIS). However, the following researchers paid more attention to the development of properties, such as lossless recovery, rather than the principle of Shamir’s polynomial-based SS scheme. In this paper, we introduce matrix theory to analyze Shamir’s polynomial-based scheme as well as propose a general (kn) threshold SIS construction based on matrix theory. Besides, it is proved that Shamir’s polynomial-based SS scheme is a special case of our construction method. Both experimental results and analyses are given to demonstrate the effectiveness of the proposed construction method.

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

References

  1. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  2. Thien, C.C., Lin, J.C.: How to share a secret. Comput. Graph. 26(5), 765–770 (2002)

    Article  Google Scholar 

  3. Lin, S.J., Lin, J.C.: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches. Pattern Recogn. 40(12), 3652–3666 (2007)

    Article  MATH  Google Scholar 

  4. Yang, C.N., Ciou, C.B.: Image secret sharing method with two-decoding-options: lossless recovery and previewing capability. Image Vis. Comput. 28(12), 1600–1610 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Wang, Z., Arce, G.R., Di Crescenzo, G.: Halftone visual cryptography via error diffusion. IEEE Trans. Inf. Forensics Secur. 4(3), 383–396 (2009)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  8. Yan, X., Wang, S., Niu, X.: Threshold construction from specific cases in visual cryptography without the pixel expansion. Sig. Process. 105, 389–398 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wanmeng Ding .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Ding, W., Liu, K., Yan, X., Liu, L. (2017). A General (k, n) Threshold Secret Image Sharing Construction Based on Matrix Theory. In: Zou, B., Li, M., Wang, H., Song, X., Xie, W., Lu, Z. (eds) Data Science. ICPCSEE 2017. Communications in Computer and Information Science, vol 727. Springer, Singapore. https://doi.org/10.1007/978-981-10-6385-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6385-5_28

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6384-8

  • Online ISBN: 978-981-10-6385-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics