MbrlCatalogueTitleDetail

Do you wish to reserve the book?
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability
Journal Article

(k, n) threshold secret image sharing scheme based on Chinese remainder theorem with authenticability

2024
Request Book From Autostore and Choose the Collection Method
Overview
In the traditional secret image sharing (SIS) scheme, the secret image is divided into several noise-like shares, which lack authentication and may attract the attention of malicious users. Therefore, the authenticability of shadow images may play an important role and is worthy of investigation. Traditional shadow authentication research requires additional image or additional bits for authentication, which may lead to high complexity. In this paper, we propose a novel ( k ,  n ) threshold SIS scheme that is based on the Chinese remainder theorem (CRT) with shadow authenticability. Our contribution is that the secret grayscale image is distributed into n shadows, while each shadow image contains authentication information with QR code embedding. Our scheme can realize the 100% detection rate of fake participants when a credible control center is involved. The experimental results confirm that the proposed scheme has low shadow generation, authentication complexity, and the lossless recovery of secret image.