Color Visual Secret Sharing for QR Code with Perfect Module Reconstruction

被引:9
|
作者
Liu, Tao [1 ]
Yan, Bin [2 ]
Pan, Jeng-Shyang [1 ]
机构
[1] Shandong Univ Sci & Technol, Coll Comp Sci & Engn, Qingdao 266590, Shandong, Peoples R China
[2] Shandong Univ Sci & Technol, Coll Elect & Informat Engn, Qingdao 266590, Shandong, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2019年 / 9卷 / 21期
关键词
visual secret sharing; Quick Response code; color stacking; CRYPTOGRAPHY; ENCRYPTION; EXPANSION;
D O I
10.3390/app9214670
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Visual secret sharing is a secret sharing scheme where the decryption requires no computation. It has found many applications in online transaction security, privacy protection, and bar code security, etc. Recently, researches have indicated that combining visual secret sharing with the widely used Quick Response code may provide additional security mechanism to online transaction. However, current methods are either pixel-based, which requires high computational complexity or module-based, which sacrifices error correction capability of the original Quick Response code. Designing module-based visual secret sharing for the Quick Response code without sacrificing error correction capability is a challenging problem. To solve this problem, this paper proposes a (3, 3)-threshold visual secret sharing for Quick Response code scheme that fully explores the extra freedom provided by color visual secret sharing and color stacking. The binary secret Quick Response code is encoded into color shares. By stacking all the three shares, a binary color Quick Response code can be reconstructed. After the inherent pre-processing steps in a standard Quick Response code decoder, the original binary secret Quick Response code can be completely reconstructed. Thus, the original error correction capability of the Quick Response code is fully preserved. Theoretical analysis shows that the visual secret sharing for Quick Response code is secure under the condition that the computational device available to the attacker is limited to a decoder for standard Quick Response code. Experimental results verify that the secret Quick Response code cannot be reconstructed from just one share or any two shares. However, it can be 100% reconstructed once the three shares are stacked. The proposed visual secret sharing for Quick Response code is module-based, and it does not sacrifice the error correction capability. Furthermore, No extra pre-processing steps other than the standard Quick Response code decoder are required.
引用
下载
收藏
页数:20
相关论文
共 50 条
  • [21] (2,2) Threshold Robust Visual Secret Sharing Scheme for QR Code Based on Pad Codewords
    Tan, Longdan
    Lu, Yuliang
    Yan, Xuehu
    Liu, Lintao
    Chen, Jinrui
    SECURITY WITH INTELLIGENT COMPUTING AND BIG-DATA SERVICES, 2020, 895 : 619 - 628
  • [22] A Novel Three-Layer QR Code Based on Secret Sharing Scheme and Liner Code
    Yu, Bin
    Fu, Zhengxin
    Liu, Sijia
    SECURITY AND COMMUNICATION NETWORKS, 2019, 2019
  • [23] A two-level QR code scheme based on polynomial secret sharing
    Liu, Sijia
    Fu, Zhengxin
    Yu, Bin
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (15) : 21291 - 21308
  • [24] A two-level QR code scheme based on polynomial secret sharing
    Sijia Liu
    Zhengxin Fu
    Bin Yu
    Multimedia Tools and Applications, 2019, 78 : 21291 - 21308
  • [25] Real perfect contrast visual secret sharing schemes with reversing
    Yang, Ching-Nung
    Wang, Chung-Chun
    Chen, Tse-Shih
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2006, 3989 : 433 - 447
  • [26] Basic properties of the (t, n)-threshold visual secret sharing scheme with perfect reconstruction of black pixels
    Koga, Hiroki
    Ueda, Etsuyo
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 40 (01) : 81 - 102
  • [27] Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels
    Hiroki Koga
    Etsuyo Ueda
    Designs, Codes and Cryptography, 2006, 40 : 81 - 102
  • [28] Maximal contrast color visual secret sharing schemes
    Dutta, Sabyasachi
    Adhikari, Avishek
    Ruj, Sushmita
    DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (07) : 1699 - 1711
  • [29] Maximal contrast color visual secret sharing schemes
    Sabyasachi Dutta
    Avishek Adhikari
    Sushmita Ruj
    Designs, Codes and Cryptography, 2019, 87 : 1699 - 1711
  • [30] Friendly Color Visual Secret Sharing by Random Grids
    Chen, Tzung-Her
    Tsao, Kai-Hsiang
    Yang, Yan-Ting
    FUNDAMENTA INFORMATICAE, 2009, 96 (1-2) : 61 - 70