Results 1 to 10 of about 3,477 (259)

Applying cheating identifiable secret sharing scheme in multimedia security

open access: yesEURASIP Journal on Image and Video Processing, 2020
In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect ...
Zheng Ma   +4 more
doaj   +1 more source

Robust Secret Image Sharing Scheme Against Noise in Shadow Images

open access: yesIEEE Access, 2021
The (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image.
Yuyuan Sun   +4 more
doaj   +1 more source

Boolean-Based (k, n, m) Multi-Secret Image Sharing

open access: yesAxioms, 2022
Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property.
Chien-Chang Chen   +2 more
doaj   +1 more source

Data Hiding of Multicompressed Images Based on Shamir Threshold Sharing

open access: yesApplied Sciences, 2022
Image-based data hiding methods have been used in the development of various applications in computer vision. At present, there are two main types of data hiding based on secret sharing, namely dual-image data hiding and multi-image data hiding.
Haoyang Kang, Lu Leng, Byung-Gyu Kim
doaj   +1 more source

Two-in-One Secret Image Sharing Scheme with Higher Visual Quality of the Previewed Image

open access: yesMathematics, 2022
Secret image sharing (SIS) scheme is a secret image encoding and decoding scheme that reconstructs the secret image only if the number of participants is sufficient. In contrast, inadequate participants gain no information about the secret image.
Xin Wang, Peng Li, Zihan Ren
doaj   +1 more source

Threshold Secret Image Sharing [PDF]

open access: yes, 2013
A (k,n) threshold secret image sharing scheme, abbreviated as (k,n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k,n)-TSISS, Thien and Lin reduced the size of each shadow image to $\frac{1}{k}$ of the original secret image.
Teng Guo 0005   +5 more
openaire   +2 more sources

Reversible extended secret image sharing with ability to correct errors based on Chinese remainder theorem

open access: yesHeliyon, 2023
The reversible extended secret image sharing (RESIS) scheme can safely segment the secret image into a shadow image and embed it into the cover image, while ensuring that both the secret image and the cover image are completely restored.
Chaoying Wang   +5 more
doaj   +1 more source

(k,n) secret image sharing scheme capable of cheating detection

open access: yesEURASIP Journal on Wireless Communications and Networking, 2018
In a (k,n) threshold secret image sharing scheme, a secret image is encrypted into n image-shadows that satisfy the following: (1) any less than k image-shadows get no information on the image and (2) any k or more image-shadows can reconstruct the ...
Yan-Xiao Liu   +2 more
doaj   +1 more source

Meaningful Secret Image Sharing with Saliency Detection

open access: yesEntropy, 2022
Secret image sharing (SIS), as one of the applications of information theory in information security protection, has been widely used in many areas, such as blockchain, identity authentication and distributed cloud storage.
Jingwen Cheng   +4 more
doaj   +1 more source

Ramp secret image sharing

open access: yesMathematical Biosciences and Engineering, 2019
Secret image sharing (SIS) belongs to but differs from secret sharing. In general, conventional (k,n) threshold SIS has the shortcoming of "all-or-nothing". In this article, first we introduce ramp SIS definition. Then we propose a (k1,k2,n) ramp SIS based on the Chinese remainder theorem (CRT).
Xuehu Yan   +4 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy