(k,n) secret image sharing scheme capable of cheating detection
Abstract 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 entire image. Cheating problem is an impor...
Main Authors: | Yan-Xiao Liu, Qin-Dong Sun, Ching-Nung Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2018-04-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13638-018-1084-7 |
Similar Items
-
Applying cheating identifiable secret sharing scheme in multimedia security
by: Zheng Ma, et al.
Published: (2020-09-01) -
A Maze Matrix-Based Secret Image Sharing Scheme with Cheater Detection
by: Ching-Chun Chang, et al.
Published: (2020-07-01) -
A Linear Algebraic Threshold Essential Secret Image Sharing Scheme
by: Alazemi, A., et al.
Published: (2022) -
On secret sharing schemes, matroids and polymatroids
by: Martí-Farré Jaume, et al.
Published: (2010-10-01) -
Secret Image Sharing Based on Encrypted Pixels
by: Zhili Zhou, et al.
Published: (2018-01-01)