CoChat

Improved Beta Chaotic Image Encryption for Multiple Secret Sharing

Open access
Guo, Jing-Ming, Riyono, Dwi, Prasetyo, Heri · 2018 · IEEE Access
Cited by 37

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2018.2863021

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 37

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improved Beta Chaotic Image Encryption for Multiple Secret Sharing. https://app.cochat.ai/papers/10.1109/access.2018.2863021
The paper
Guo, J.-M., Riyono, D., & Prasetyo, H. (2018). Improved Beta Chaotic Image Encryption for Multiple Secret Sharing. IEEE Access. https://doi.org/10.1109/access.2018.2863021

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.