Skip to main content

A Generalized Secret Image Sharing and Recovery Scheme

  • Conference paper
  • First Online:
Advances in Multimedia Information Processing — PCM 2001 (PCM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2195))

Included in the following conference series:

Abstract

The secret sharing is an important issue in confirming the security of confidential information. This paper proposes a generalized sharing and recovery scheme suitable for secret images. The scheme coalesces vector quantization (VQ) compression technique and conventional generalized secret sharing scheme to produce pseudo codebooks out of the secret codebook used for compressing the secret image. Every pseudo codebook is held by a participant of the generalized access structure for secret sharing. On the other hand, the secret image can be only recovered by all participants, who belong to the same qualified subgroup of the generalized access structure, to work together with their possessed pseudo codebooks

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. Benaloh, J., and Leichter, J.: Generalized Secret Sharing and Monotone Functions. Advances in Cryptology-CRYPTO’ 88, Vol. 403. Springer-Verlag, (1989) 27–35

    MathSciNet  Google Scholar 

  2. Blakey, G. R.: Safeguarding Cryptographic Keys. Proceedings of National Computer Conference, Vol. 48. AFIPS Press, Montvale, New York (1979) 313–317

    Google Scholar 

  3. Ito, M., Saito, A., and Nishizeki, T.: Secret Sharing Scheme Realizing General Access Structure. Proceedings of IEEE Globecom‘87, Tokyo (1987) 88–102

    Google Scholar 

  4. Linde, Y., Buzo, A., and Gray, R. M.: An Algorithm for Vector Quantization. IEEE Transactions on Communications, Vol. 28. (1980) 84–95

    Article  Google Scholar 

  5. Merkle, R. C. and Hellman, M. E.: Hidding Information and Signatures in Knapdoor Knapsacks. IEEE Transactions on Information Theory, Vol. IT-24. (1978) 525–530

    Article  Google Scholar 

  6. Shamir, A.: How to Share a Secret. Communications of the ACM, Vol. 22. No.11 (1997) 612–613

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsai, CS., Chang, CC. (2001). A Generalized Secret Image Sharing and Recovery Scheme. In: Shum, HY., Liao, M., Chang, SF. (eds) Advances in Multimedia Information Processing — PCM 2001. PCM 2001. Lecture Notes in Computer Science, vol 2195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45453-5_129

Download citation

  • DOI: https://doi.org/10.1007/3-540-45453-5_129

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42680-6

  • Online ISBN: 978-3-540-45453-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics