Preview-Versioned Essential Secret Image Sharing

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

“…Compared to those, the visual cryptography scheme (VCS) [ 22 , 23 , 24 , 25 , 26 ] is suitable to encrypt QR codes.…”

Section: Introductionmentioning

confidence: 99%

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

“…The threshold of essential shareholders is equal to

t

and the general threshold is equal to

k

. Scholarly works on

{\mathrm{ESIS}}

have been published by several authors [4–12]. Peng Li et al.…”

Section: Introductionmentioning

confidence: 99%

“…s shareholders are essential and n − s shareholders are non-essential. The threshold of essential shareholders is equal to t and the general threshold is equal to k. Scholarly works on ESIS have been published by several authors [4][5][6][7][8][9][10][11][12]. Peng Li et al [11] introduced a general (t , s, k, n) -ESISscheme in 2013.…”

mentioning

confidence: 99%

LWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)

Dehkordi,

Farahi,

Mashhadi

2023

IET Image Processing

View full text Add to dashboard Cite

In traditional secret image sharing schemes, shareholders have similar situations, and to recover the secret image, they must be present as many as the threshold. However, in scenarios where the shareholders occupy different positions, essential and non‐essential, the use of essential secret image sharing schemes becomes necessary. This article presents a novel verifiable essential secret image sharing scheme based on LWEs that incorporates Bloom filters and hash functions for verification purposes. The proposed scheme for a secret image does not require any pre‐processing. The shadow images of both essential and non‐essential shareholders are of the same size, eliminating the need for concatenating sub‐shadows. Furthermore, shadow images for essential and non‐essential shareholders are produced simultaneously in a single step. The scheme is also quantum safe thanks to the use of quantum‐resistant primitives. The experimental results confirm the security and efficiency of the proposed scheme.

show abstract

“…Several works on ESIS schemes have been done in Refs. [14,[19][20][21][22][23][24][25][26]. In 2013, Peng Li et al [25] first introduced a general essential secret image sharing (t, s, k, n) scheme.…”

mentioning

confidence: 99%

A verifiable essential secret image sharing scheme based on HLRs (VESIS‐(t, s, k, n))

Hadian Dehkordi,

Farahi,

Mashhadi

2023

CAAI Trans on Intel Tech

View full text Add to dashboard Cite

In traditional secret image sharing schemes, a secret image is shared among shareholders who have the same position. But if the shareholders have two different positions, essential and non‐essential, it is necessary to use essential secret image sharing schemes. In this article, a verifiable essential secret image sharing scheme based on HLRs is proposed. Shareholder's share consists of two parts. The first part is produced by the shareholders, which prevents the fraud of dealers. The second part is a shadow image that is produced by using HLRs and the first part of share. The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps. Also, for verifying shadow images, Bloom Filters are used for the first time. The proposed scheme is more efficient than similar schemes, and for the first part of the shares, has formal security.

show abstract

Preview-Versioned Essential Secret Image Sharing

Cited by 3 publications

References 20 publications

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

A Lossless-Recovery Secret Distribution Scheme Based on QR Codes

LWE‐based verifiable essential secret image sharing scheme ((t,s,k,n)$( {t,s,k,n} )$ ‐ VESIS)

A verifiable essential secret image sharing scheme based on HLRs (VESIS‐(t, s, k, n))

Contact Info

Product

Resources

About