Improved Beta Chaotic Image Encryption for Multiple Secret Sharing
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
This paper proposes a new simple image encryption technique using the Beta chaotic map for performing the confusion and diffusion of input plain image. This image encryption is further applied to the multiple secret sharing (MSS). The former existing scheme in MSS employs the Chinese remainder theorem (CRT) and eXclusive-OR (XOR) operations to convert the secret image to become a set of shared images. The former scheme yields a good result while the number of secret images is even. However, it has slight limitation while the number of secret images is odd. This paper aims to overcome this problem by utilizing the proposed image encryption along with three new MSS approaches: 1) incorporating an additional random images; 2) performing k image encryption; and 3) using two different masking coefficients. As documented in the experimental section, the proposed method performs well in the MSS task. It solves the problem in former scheme on dealing with odd number of secret images. In addition, the proposed method is superior compared with the other competing schemes. The proposed image encryption also improves the security level in the MSS system.
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
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722
Image 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
Depreciating motivation and empirical security analysis of chaos-based image and video encryption
Preishuber, M., Hutter, T., Katzenbeisser, S., & Uhl, A. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2812080 · Cited by 256
Cited by
Image encryption using block cipher and chaotic sequences
Artiles, J. A. P., Chaves, D. P. B., & Pimentel, C. (2019) · Signal Processing: Image Communication · doi:10.1016/j.image.2019.08.014 · Cited by 77
Side-Channel Analysis of Chaos-Based Substitution Box Structures
Acikkapi, M. S., Ozkaynak, F., & Ozer, A. B. (2019) · IEEE Access · doi:10.1109/access.2019.2921708 · Cited by 51
Cryptanalysis and Improvement in a Plaintext-Related Image Encryption Scheme Based on Hyper Chaos
Liu, L., Zhang, Z., & Chen, R. (2019) · IEEE Access · doi:10.1109/access.2019.2938181 · Cited by 41
“2 d[1]← C[1, 1], d[2]← C[1, N/2], d[3]← C[1, N], 3 d[4]← C[M/2, 1], d[5]← C[M/2, N/2], d[6]← C[M/2, N], 4 d[7]← C[M, 1], d[8]← C[M, N/2], d[9]← C[M, N] 5 SUM_9← sum(d[:])”
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
Khan, M. F., Ahmed, A., Saleem, K., & Shah, T. (2019) · IEEE Access · doi:10.1109/access.2019.2925081 · Cited by 27
Metadata
- Authors
- Guo, J.-M., Riyono, D., & Prasetyo, H.
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 46297-46321
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2890254225
- Cited by
- 37
- References
- 3
- FWCI
- 3.12
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.