Abstract
In today’s scenario many secret image files are needed to be transmitted over internet for various important purposes. So protection of these files is an important issue. Efficient cryptographic methods are there to protect data but every thing depends on the protection of encryption key. Various secret sharing schemes are available in the literature but computational complexity is very high in most of the cases that leads to single point failure. To overcome this drawback shared cryptography becomes more popular. Here we are suggesting a novel secret sharing scheme which employs simple graphical masking method, performed by simple ANDing for share generation and reconstruction can be done by performing simple ORing the qualified set of legitimate shares. Here sharing and reconstruction are so simple, then our scheme may be applied in many hand held system with very low end processors. Not only that, the generated shares are compressed and each share contains partial secret information. Again decompression is possible only when qualified set of legitimate shares are available, that leads to added protection to the secret and reduced bandwidth requirement for transmission.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shamir, A.: How to share a secret? Comm. ACM 22(11), 612–613 (1979)
Blakley, G.: Safeguarding cryptographic keys. In: Proc. of AFIPS National Computer Conference (1979)
Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Transaction on Information Theory 29(2), 208–210 (1983)
Desmedt, Y.: Some Recent Research Aspects of Threshold Cryptography. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol. 1396, pp. 158–173. Springer, Heidelberg (1998)
Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Desmedt, Y., Frankel, Y.: Shared Generation of Authenticators and Signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1992)
Desmedt, Y., Frankel, Y.: Homomorphic zero knowledge threshold schemes over any finite abelian group. SIAM Journal on Discrete Mathematics 7(4), 667–675 (1994)
Huang, H.F., Chang, C.C.: A novel efficient (t, n) threshold proxy signature scheme. Information Sciences 176(10), 1338–1349 (2006)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely? In: Proc. of STOC 1994, pp. 522–533 (1994)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
Bozkurt, Kaya, Selcuk, Guloglu: Threshold Cryptography Based on Blakely Secret Sharing. Information Sciences
Kaya, K., Selcuk, A.A.: Threshold Cryptograhy based on Asmuth-Bloom Secret Sharing. Information Sciences 177(19), 4148–4160 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naskar, P.K., Khan, H.N., Roy, U., Chaudhuri, A., Chaudhuri, A. (2011). Secret Image Sharing with Embedded Session Key. In: Chaki, N., Cortesi, A. (eds) Computer Information Systems – Analysis and Technologies. Communications in Computer and Information Science, vol 245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27245-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-27245-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27244-8
Online ISBN: 978-3-642-27245-5
eBook Packages: Computer ScienceComputer Science (R0)