Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
and its generation algorithm. Mathematical analysis is provided to show its potential for secret image sharing. Combining sharing matrix with image encryption, we further propose a lossless (k,n) -secret image sharing scheme (SMIE-SIS). Only with no less than k shares, all the ciphertext information and security key can be reconstructed, which results in a lossless recovery of original information. This can be proved by the correctness and security analysis. Performance evaluation and security analysis demonstrate that the proposed SMIE-SIS with arbitrary settings of k and n has at least five advantages: 1) it is able to fully recover the original image without any distortion; 2) it has much lower pixel expansion than many existing methods; 3) its computation cost is much lower than the polynomial-based secret image sharing methods; 4) it is able to verify and detect a fake share; and 5) even using the same original image with the same initial settings of parameters, every execution of SMIE-SIS is able to generate completely different secret shares that are unpredictable and non-repetitive. This property offers SMIE-SIS a high level of security to withstand many different attacks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 1×
“The key space of the proposed SMIE-SIS is 2192, which is larger than the basic key space requirement of 2100 [29].”
BackgroundA new 1D chaotic system for image encryption
Zhou, Y., Bao, L., & Chen, C. L. P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.10.034 · Cited by 859 · cited 1×
“Shannon Entropy is introduced to measure the uncertainty [47].”
BackgroundSelf-citationOn the cryptanalysis of Fridrich’s chaotic image encryption scheme
Xie, E. Y., Li, C., Yu, S., & Lü, J. (2017) · Signal Processing · doi:10.1016/j.sigpro.2016.10.002 · Cited by 268 · cited 1×
“erty solves the weakness of many existing image encryption methods and makes this encryption part to well defend some cryptanalysis attacks [30]–[33], such as differential attack and known-plaintext attack.”
BackgroundImage encryption using a new parametric switching chaotic system
Zhou, Y., Bao, L., & Chen, C. L. P. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.04.021 · Cited by 265 · cited 1×
“Different from other chaotic systems suffering from the inadequacy problem [44], Tent map shows a good chaotic map across a large parameter range [45], which can be demonstrated by Lyapunov exponent and bifurcation diagram.”
BackgroundSelf-citationCryptanalysis of a chaotic image encryption method
Li, S., & Zheng, X. (2003) · 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353) · doi:10.1109/iscas.2002.1011451 · Cited by 262
Cracking a hierarchical chaotic image encryption algorithm based on permutation
Li, C. (2016) · Signal Processing · doi:10.1016/j.sigpro.2015.07.008 · Cited by 173
Cited by
Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography
Li, C., Lin, D., Lü, J., & Hao, F. (2018) · IEEE MultiMedia · doi:10.1109/mmul.2018.2873472 · Cited by 261
A Faster and Robust Artificial Neural Network Based Image Encryption Technique With Improved SSIM
Panigrahy, A. K., Maniyath, S. R., Sathiyanarayanan, M., Dholvan, M., Ramaswamy, T., Hanumanthakari, S., Vignesh, N. A., Kanithan, S., & Swain, R. (2024) · IEEE Access · doi:10.1109/access.2024.3353294 · Cited by 42
Efficient & secure image availability and content protection
Noura, H., Noura, M., Salman, O., Couturier, R., & Chehab, A. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09057-4 · Cited by 4
Metadata
- Authors
- Bao, L., Yi, S., & Zhou, Y.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2017-12
- Volume
- 26
- Issue
- 12
- Pages
- 5618-5631
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2742894517
- Cited by
- 76
- References
- 7
- FWCI
- 2.92
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing. https://app.cochat.ai/papers/10.1109/tip.2017.2738561
- The paper
- Bao, L., Yi, S., & Zhou, Y. (2017). Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2017.2738561
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.