A Novel Way of Protecting the Shared Key by Using Secret Sharing and Embedding Using Pseudo Random Numbers
This work is modified work of Anil kumar and Navin Rajgopal, where they have considered that dealer encrypts the secret and share the secret with 2 participants. Only the dealer can encrypt and decrypt the secret. Even the sharing and reconstruction of secret is performed by only the dealer. Due to this no other user will be able to reconstruct the secret. There are few drawbacks in this method. This works with only 2 participants as the second image is dependent on the first share and the image. For reconstruction both the shares are must. The dealer encrypts and decrypts the secret which takes more time. No other participants can reconstruct the secret even though they have the secret.
We have considered this work and made some changes so that no encryption decryptions are performed. The secret can be shared among any number of participants, and a few shares are sufficient to reconstruct the secret. The reconstruction can be done by any participant unlike the work mentioned above, where only the dealer can reconstruct the secret. We are also considering the images to cover the secret shares based on the pseudo random numbers, but this is different from the way the numbers are used in the above method.
KeywordsCover image Secret key/password Secret Sharing Embedding Pseudo Random Sequence
Unable to display preview. Download preview PDF.
- 1.Kumar, A., Rajgopal, N.: Secret Image Sharing Using Pseudo Random Sequence. IJCSNS 6(2B) (February 2006)Google Scholar
- 3.Tang, S.: Simple Secret Sharing and Threshold RSA Signature Schemes. Journal of Information and Computational Science 1, 259–262 (2004)Google Scholar
- 4.Cryptography and network security by William stallings, 3rd edn. Pearson education Google Scholar
- 5.Blakley, G.: Safeguarding Cryptographic Keys. In: AFIPS Conference Proceedings, vol. 48 (1979)Google Scholar
- 7.Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)Google Scholar
- 8.Beimel, A., Chor, B.: Interaction in Key Distribution Schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 444–455. Springer, Heidelberg (1994)Google Scholar
- 9.Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: Proc. 26th Annual Symposium on Foundations of Computer Science, Portland, OR, October 21-23, pp. 383–395 (1985)Google Scholar
- 10.Charnes, C., Pieprzyk, J., Safavi-Naini, R.: Families of Threshold Schemes. In: Proc. IEEE International Symposium on Information Theory, Trondheim, Norway, p. 499 (July 1994)Google Scholar
- 12.Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979, National Computer Conference, vol. 48, pp. 313–137 (1979)Google Scholar