An Efficient Visual Multi-Secret Sharing Scheme

Authors

1 Associate Professor, Imam Hossein University, Tehran, Iran

2 Researcher, Imam Hossein University, Tehran, Iran

Abstract

Protecting valuable data along the Cyber Security is the one of the strategic issues of cyber defense. The
secret sharing scheme is an attractive branch of advanced cryptography that has extremely
important role in cyber defense and for the preservation of documents and confidential information against threats such
as robbery and unauthorized accesses.In the secret sharing schemes, for increasing security shareholders present
a shadow image instead of the genuine share while they are recovering secret images. Thus each shareholder
is able to share several images with others by having only one portion of image.
In this paper, we define and design a new generating function that by replacing with the Hou Zheng
Feng and et.al's generating function, can improved it. Since the new generating function is one-way and
hard problem, hence increased the security of improved scheme. Also, with implementation and performing
the new scheme again, our revised scheme will be more efficient respect to previous scheme according to
the analysis and speed of computations.

Keywords

References

[1] A. Shamir, “How to Share a Secret,” Journal of Communication, ACM, vol. 24, no. 11, pp. 612-613, 1979.
[2] G. R. Blakley, “Safeguarding Cryptographic Keys[C],” Proc. of AFIPS 1979 National Computer Conference, pp. 313-317, 1979.
[3] E. D. Karnin, J. W. Greene, and M. E. Hellman, “On Sharing Secret Systems[J],” IEEE Transactions on Information Theory, vol. 29, no. 1, pp. 35-41, 1983.
[4] M. Naor and A. Shamir, “Visual Cryptography[C],” Advances in Cryptology-Eurocrypt, vol. 94, pp. 1-12, 1994.
[5] M. Naor and A. Shamir, “Visual Cryptography II: Improving the Contras Via the Cover Base[C],” Lecture Notes in Computer Science, Springer Berlin vol. 1189, pp. 197-202, 1997.
[6] H. Zheng Feng and G. Hanjun, “A Compressible Threshold Image Sharing Scheme Based on Matrix Multiplication[J],” Geomatics and Information Science of Wuhan University, vol. 33, no. 10, pp. 1003-1006, 2008.
[7] Ch. Chin-Chen, L. Chia-Chen, L. Chia-Hsuan, and Ch. Yi-Hui, “A Novel Secret Image Sharing Scheme in Color Images Using Small Shadow Images [J],” Information Sciences, vol. 178, pp. 2433–2447, 2008.
[8] H. Zheng Feng and G. Hanjun, “Multi Secret Image Sharing Based on Matrix Multiplication,” IEEE International Conference on Networks Security, vol.1, pp. 184-187, 2009.
[9] D. J. Bernstein, “Salsa 20 Specification,” Department of Mathematics, Statistics, and Computer Science (M/C 249), The University of Illinois at Chicago, 2007.
9 مجله علمی - پژوهشی ” پدافند الکترونیکی و سایبری “ ، سال سوم، شماره 4، زمستان 4934
[10] A. Martin, D. Rey, and D. Avila, “A Matrix-Based Secret Sharing Scheme for Images,” Lecture Notes in Computer Science, vol. 5197, PP. 235-242, 2008.
[11] T.-H. Chen, C-S Wu, and W. Chang, “Efficient Multi-Secret Image Sharing Based on Boolean Operations,” Department of Computer Science and Information Engineering, National Chiayi University, 300 University Rd., Chia-Yi City, Taiwan 600, 2011.
[12] Z. H. Wang, Ch. Ch. Chang, H. Ngoc Tu, and M. Ch. Li, “Sharing a Secret Image in Binary Images with Verification,” Journal of Information Hiding andMultimedia Signal Processing, vol. 2, no. 1, 2011.
[13] J. Daniel, “Bernstein The Salsa20 Family of Stream Ciphers,” Department of Mathematics, Statistics, and Computer Science (M/C 249), The University of Illinois at Chicago, IL 60607–7045.
[14] D. Wang, L. Zhang, N. Ma, and X. Li, “Two Secret Sharing Schemes Based on Boolean Operations,” vol. 40, no. 10, pp. 2776–2785, 2007.
[15] F. Sheikh Sangtajan and M. Hadyan Dehkordi, “Analysis of several Visual Secret Sharing Schemes and Improvement One of Them,” Ph.D. Thesis, Imam Hussein University, Sep. 2013.

Files

History

  • Receive Date: 03 June 2014
  • Revise Date: 21 June 2023
  • Accept Date: 19 September 2018
  • Publish Date: 20 February 2016

Share

How to cite

Statistics