Evidence map›Paper›PMID 38635816›Full record

ArticlePloS one2024

An efficient and compromise-resilient image encryption scheme for resource-constrained environments.

Abdul Nasir Khan, Abid Mehmood, Muhammad Nasir Mumtaz Bhutta, Iftikhar Ahmed Khan, Atta Ur Rehman Khan

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Abdul Nasir KhanCOMSATS University Islamabad, Abbottabad Campus, Khyber Pakhtunkhwa, Pakistan.ORCID 0000-0001-9742-1669
Abid MehmoodDepartment of Computer Science and Information Technology, College of Engineering, Abu Dhabi University, Abu Dhabi, UAE.
Muhammad Nasir Mumtaz BhuttaDepartment of Computer Science and Information Technology, College of Engineering, Abu Dhabi University, Abu Dhabi, UAE.ORCID 0000-0001-5580-4282
Iftikhar Ahmed KhanCOMSATS University Islamabad, Abbottabad Campus, Khyber Pakhtunkhwa, Pakistan.ORCID 0000-0001-6124-1201
Atta Ur Rehman KhanCollege of Engineering and IT, Ajman University, Ajman, UAE.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The secret keys produced by current image cryptosystems, which rely on chaotic sequences, exhibit a direct correlation with the size of the image. As the image dimensions expand, the generation of extensive chaotic sequences in the encryption and decryption procedures becomes more computationally intensive. Secondly, a common problem in existing image encryption schemes is the compromise between privacy and efficiency. Some existing lightweight schemes reveal patterns in encrypted images, while others impose heavy computational burdens during encryption/decryption due to the need for large chaotic sequences. In this study, we introduce a lightweight image encryption scheme that involves partitioning the image into uniformly sized tiles and generating a chaotic sequence accordingly. This approach diminishes the necessity to create extensive chaotic sequences equal to the tile size, which is significantly smaller than the original image. As a result, it alleviates the processing burden associated with generating sequences equivalent to the original image size. The results confirm that our proposed scheme is lightweight and secure compared to the latest state-of-the-art image encryption schemes. Additionally, sensitivity analysis demonstrates that the proposed image encryption technique, with a UACI value of 33.48 and NPRC value of 99.96, affirms its resistance to differential attacks.

Indexed as

PrivacyResilience, Psychological

Identifiers

PMID38635816
PMCPMC11025941

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.