
Number of Journals | 34 |
Number of Issues | 1,306 |
Number of Articles | 9,428 |
Article View | 9,191,877 |
PDF Download | 5,622,550 |
An Efficient Visual Multi-Secret Sharing Scheme | ||
پدافند الکترونیکی و سایبری | ||
Article 1, Volume 3, Issue 4, April 2020, Pages 1-9 PDF (1.46 M) | ||
Authors | ||
Abdolrasoul Mirqadri* 1; Fereshteh Sheikh2 | ||
1Associate Professor, Imam Hossein University, Tehran, Iran | ||
2Researcher, Imam Hossein University, Tehran, Iran | ||
Receive Date: 03 June 2014, Revise Date: 21 June 2023, Accept Date: 19 September 2018 | ||
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 | ||
Secret image; Generating Function; Visual Multiple-Secret Sharing Scheme; Shadow Image; Doubleround(x) Function | ||
References | ||
[1] A. Shamir, “How to Share a Secret,” Journal of Communication, ACM, vol. 24, no. 11, pp. 612-613, 1979. | ||
Statistics Article View: 704 PDF Download: 266 |