Novel Visual Secret Sharing Scheme for the QR Code with Meaningful Shares | Zendy

JengShyang Pan | Zendy; Tao Liu | Zendy; Bin Yan | Zendy; Hong-Mei Yang | Zendy; ShuChuan Chu | Zendy; Mengxi Wang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Novel Visual Secret Sharing Scheme for the QR Code with Meaningful Shares

Author(s) -

JengShyang Pan,

Tao Liu,

Bin Yan,

Hong-Mei Yang,

ShuChuan Chu,

Mengxi Wang

Publication year - 2022

Publication title -

security and communication networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.446

H-Index - 43

eISSN - 1939-0114

pISSN - 1939-0122

DOI - 10.1155/2022/4927239

Subject(s) - computer science , halftone , secret sharing , code (set theory) , decoding methods , scheme (mathematics) , encryption , image (mathematics) , homomorphic secret sharing , computer security , visual cryptography , theoretical computer science , computer vision , algorithm , cryptography , mathematics , set (abstract data type) , programming language , mathematical analysis

Visual secret sharing (VSS) scheme can share the secret image with several shares. Shares are performed by the decoding operation to restore the secret image. VSS scheme is mainly used for the secure transmission of images. Quick response (QR) code is often used by people on the Internet. It can be encrypted by the VSS scheme to enhance the security of its transmission. The share is meaningless that will arouse the suspicion of the attacker. The security of the VSS scheme is decreased. This paper proposes a novel VSS scheme for the QR code with meaningful images to solve this problem. Two continue tone images are converted to halftone images. The halftone image is modified to generate the share. Every share is meaningful, not meaningless. Two shares are performed the decoding operation to restore the secret QR code. The restored QR code can be correctly decoded by the general decoder. Experimental results prove that the proposed scheme is feasible.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research