Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share

Meghrajani, Yogesh K.; Desai, Laxmi S.; Mazumdar, H. S.

doi:10.1016/j.jisa.2019.05.010

Cited by 4 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…en, let the secret data S be a constant term of the polynomial. From the polynomial, n values can be calculated as n shares, where any k shares can recover S. Later, this idea was followed by many research scholars, such as these schemes [5,[28][29][30]. e approach in [5] proposes a SIS scheme based on Shamir's threshold secret sharing method.…”

Section: Preliminariesmentioning

confidence: 99%

Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Zhang

Dang

Feng

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Zhang

Dang

Feng

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…From the polynomial, n values can be calculated as n shares, where any k shares can recover s. Later, this idea was followed by many research scholars, such as these schemes. 19,[38][39][40] The approach in Reference 19 proposes a SIS scheme based on Shamir's threshold secret sharing method. The difference between References 19 and 27 is that Thien and Lin group image pixels, each group of pixels is used as polynomial coefficients (including constant term).…”

Section: Preliminariesmentioning

confidence: 99%

“…From the polynomial, n values can be calculated as n shares, where any k shares can recover s . Later, this idea was followed by many research scholars, such as these schemes 19,38‐40 . The approach in Reference 19 proposes a SIS scheme based on Shamir's threshold secret sharing method.…”

Section: Preliminariesmentioning

confidence: 99%

Modular‐based secret image sharing in Internet of Things: A global progressive‐enabled approach

Zhang

Zheng

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Summary Due to the continuous development and progress of information technology, the Internet has also entered the era of big data based on the Internet of Things (IoT). How to protect the security of data stored and transmitted in the IoT is one of the urgent problems to be solved. This article focuses on the security issues of storage and transmission of image data in the IoT. Secret image sharing (SIS) is a kind of image protection mechanism by dividing an image into n shares, and different shares are given to different participants separately for preservation. Only when the number of shares reaches the threshold can the original image be recovered. From the perspective of image reconstruction mode, there are two types of SIS schemes: one is the traditional (k, n) threshold scheme, which provides an all‐or‐nothing reconstruction mode, the other is the progressive scheme, which can gradually restore the original image. In this article, a novel (k, k2) progressive secret image sharing based on modular operations is proposed, this method can divide the important images stored in the IoT into many parts and then transmit them to people in different places. It takes the whole as a unit in terms of the progressive recovery form. When the share reaches the threshold, certain blocks of the original image can be seen. As the share increases, the image will be clearer. When all shares participate in the reconstruction together, the original image can be restored without loss. Compared with other schemes, our scheme has the same smoothness, shadow size and satisfies the security, and is fine‐grained progressive.

show abstract

Border Collie Shuffled Shepherd optimization-based image reconstruction using visual cryptography

A S,

Sridevi Sathya Priya,

V S

2023

The Imaging Science Journal

View full text Add to dashboard Cite

Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share

Cited by 4 publications

References 17 publications

Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Modular‐based secret image sharing in Internet of Things: A global progressive‐enabled approach

Border Collie Shuffled Shepherd optimization-based image reconstruction using visual cryptography

Contact Info

Product

Resources

About