Enhanced (n, n)-threshold QR code secret sharing scheme based on error correction mechanism

Huang, Peng; Chang, Chin Chen; Li, Yung‐Hui; Liu, Yanjun

doi:10.1016/j.jisa.2020.102719

Cited by 10 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed scheme can encrypt all versions of QR codes. This is a non-pixel-expansible scheme [ 46 ]. It can produce meaningful shares.…”

Section: Methodsmentioning

confidence: 99%

“…It is hard to extend the

-threshold scheme. These schemes are

schemes [ 42 , 45 , 46 ]. However, they cannot restore the secret QR code with errors.…”

Section: Methodsmentioning

confidence: 99%

“…The reconstructed QR code with errors was decoded using the error-correction codeword (ECC). Huang et al designed a high-security VCS for a secret QR code based on the error-correction mechanism [ 46 ].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

Pan

Liu

Yan

et al. 2023

Entropy

View full text Add to dashboard Cite

The visual cryptography scheme (VCS) distributes a secret to several images that can enhance the secure transmission of that secret. Quick response (QR) codes are widespread. VCS can be used to improve their secure transmission. Some schemes recover QR codes with many errors. This paper uses a distribution mechanism to achieve the error-free recovery of QR codes. An error-correction codeword (ECC) is used to divide the QR code into different areas. Every area is a key, and they are distributed to n shares. The loss of any share will make the reconstructed QR code impossible to decode normally. Stacking all shares can recover the secret QR code losslessly. Based on some experiments, the proposed scheme is relatively safe. The proposed scheme can restore a secret QR code without errors, and it is effective and feasible.

show abstract

“…The proposed scheme can encrypt all versions of QR codes. This is a non-pixel-expansible scheme [ 46 ]. It can produce meaningful shares.…”

Section: Methodsmentioning

confidence: 99%

“…It is hard to extend the

-threshold scheme. These schemes are

schemes [ 42 , 45 , 46 ]. However, they cannot restore the secret QR code with errors.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

Pan

Liu

Yan

et al. 2023

Entropy

View full text Add to dashboard Cite

show abstract

“…Second, QR codes are closely related to some issues of information security, such as secret sharing via QR codes 25 , 35 , QR security in mobile payments 34 and QR detection against a malicious URL 26 .…”

Section: Comparisons Between This Work and Related Onesmentioning

confidence: 99%

A novel approach for audible acoustic quick response codes

Zhu

Gao

Wang

2022

Sci Rep

View full text Add to dashboard Cite

Compared to image-based quick response (QR) codes, acoustic QR codes have some advantages. However, an acoustic QR scanner cannot recognize an acoustic QR code at a distance of more than two meters from an acoustic QR announcer. To this end, we propose a new sort of acoustic QR code, called an audible acoustic QR code (AAQRC), which employs humanly audible sound to carry users’ information directly. First, a user’s string of characters is translated into a string of pitches. Then, the related algorithms convert the string of pitches into a playable audio file. As a result, an AAQRC is generated, consisting of the audio itself. AAQRC recognition is the opposite process of AAQRC generation. Compared with the existing approach for acoustic QR codes, the new method can recognize acoustic QR codes at a longer distance, even if there are obstacles between the AAQRC announcer and AAQRC scanner.

show abstract

“…However, the secret information recovered from the stego image by this method may still be leaked. In the research of Huang et al [20], the secret information is a QR code that is first divided into n blocks, and then each block is encoded into a marketed QR code together with a cover QR code. The recovery of secret QR codes can be obtained by the XOR operation of these marked QR codes.…”

Section: Introductionmentioning

confidence: 99%

Authenticable medical image-sharing scheme based on embedded small shadow QR code and blockchain framework（China MM）

Wen

Jian

Fang

et al. 2022

Preprint

View full text Add to dashboard Cite

In the field of medical image content protection and security sharing, the introduction of blockchain technology has a problem in that the secret key may be lost and cannot be recovered. Therefore, this paper proposes an authenticable medical image-sharing scheme based on an embedded small shadow QR code and a blockchain framework. First, a small shadow image is obtained by employing a secret image-sharing method based on the Chinese remainder theorem. Then, the shadow image is embedded into a QR code with error correction. This not only ensures the security and integrity of the shadow image transmission in the public channel but also avoids the problem where the secret key is lost and cannot be recovered. Compared with some existing excellent schemes, our scheme adopts a hash bit stream for authentication purposes and employs smart contracts to authenticate and restore secret images, thus reducing the local load. In addition, experiments validate that the recovered secret medical image is lossless and that the cover QR code is more robust and secure. This method is suitable for medical image content protection and security sharing.

show abstract

Enhanced (n, n)-threshold QR code secret sharing scheme based on error correction mechanism

Cited by 10 publications

References 17 publications

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

A novel approach for audible acoustic quick response codes

Authenticable medical image-sharing scheme based on embedded small shadow QR code and blockchain framework（China MM）

Contact Info

Product

Resources

About