Evidence map›Paper›PMID 35538203›Full record

ArticleScientific reports2022

A QR code-based user-friendly visual cryptography scheme.

Lijing Ren, Denghui Zhang

Abstract read
In one paragraph

Article in Scientific reports, 2022. 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. A New Data Model for the Privacy Protection of Medical Images.Computational intelligence and neuroscience · 2022
    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

2 authors.

Lijing RenCyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510006, People's Republic of China.
Denghui ZhangCyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510006, People's Republic of China. zhang.denghui@foxmail.com.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Benefiting from the development of the Internet and smart devices, it is now convenient to transmit images anywhere and anytime, which poses a new challenge for image security. The Visual Cryptography Scheme (VCS) is a secret sharing method for protecting an image without a key, the merit of VCS is the human visual system (HVS) can restore the secret image by simply superimposing qualified shares, without any computation. To eliminate noise-like shares in traditional VCS, this paper presents a novel QR code-based expansion-free and meaningful visual cryptography scheme (QEVCS), which generates visually appealing QR codes for transmitting meaningful shares. When distributing on public networks, this scheme does not attract the attention of potential attackers. By limiting the gray-level of a halftoned image, QEVCS both keep the computation-free of visual cryptography and the size of recovery image same as the secret images. The experimental results show the effectiveness of QEVCS when preserving the privacy of images.

Indexed as

AlgorithmsComputer SecurityHumansInternetPrivacyResearch Design

Identifiers

PMID35538203
PMCPMC9090762

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.