Maximizing Contrast in XOR-Based Visual Cryptography Schemes

被引:0
作者
Jia, Xingxing [1 ]
Yu, Ting [1 ]
Luo, Xiangyang [2 ]
Wang, Daoshun [3 ]
Zhou, Huiyu [4 ]
机构
[1] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
[2] Zhengzhou Informat Sci & Technol Inst, State Key Lab Math Engn & Adv Comp, Zhengzhou 450001, Henan, Peoples R China
[3] Tsinghua Univ, Sch Comp, Beijing 100084, Peoples R China
[4] Univ Leicester, Sch Comp & Math Sci, Leicester LE1 7RH, England
基金
中国国家自然科学基金;
关键词
Visualization; Linear programming; Image reconstruction; Circuits and systems; Vectors; Encryption; Computational complexity; Visual cryptography; pixel expansion; XOR operation; general access structure; contrast;
D O I
10.1109/TCSVT.2024.3435724
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Visual cryptography (VC) schemes provide a distinguished image encryption technique to protect image security since it can visually decrypt the secret image by superimposing the encrypted shadows. VC schemes for both threshold access structures and general access structures are generally constructed based on the OR operation to minimize the pixel expansion. However, VC schemes with optimal pixel expansion typically have low contrast. Stacking operation OR frequently produces recovered images with poor visual quality and are never able to deliver flawless recovery for secret images. Therefore, we studied XOR-based VC (XVC) schemes that employ linear programming to maximize their contrast. Three schemes for general access structures and three schemes for threshold access structures are designed to maximize their contrast. The proposed schemes' construction is reduced to a linear programming to maximize the contrast by determining the ideal combinations of basis matrices in terms of primary column matrices and unit matrices, respectively. The comparison study and experimental results demonstrate that the contrast of the previous VC and XVC schemes can be further improved.
引用
收藏
页码:12849 / 12861
页数:13
相关论文
共 50 条
  • [31] Improved Schemes for Visual Cryptography
    Carlo Blundo
    Annalisa De Bonis
    Alfredo De Santis
    [J]. Designs, Codes and Cryptography, 2001, 24 : 255 - 278
  • [32] Improved schemes for visual cryptography
    Blundo, C
    Bonis, AD
    Santis, AD
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2001, 24 (03) : 255 - 278
  • [33] Bounds for visual cryptography schemes
    Hajiabolhassan, Hossein
    Cheraghi, Abbas
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (06) : 659 - 665
  • [34] Contrast optimal threshold visual cryptography schemes
    Blundo, C
    D'Arco, P
    De Santis, A
    Stinson, DR
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) : 224 - 261
  • [35] XOR-based progressive visual secret sharing using generalized random grids
    Chao, Her-Chang
    Fan, Tzuo-Yau
    [J]. DISPLAYS, 2017, 49 : 6 - 15
  • [36] Size Invariant Visual Cryptography Schemes With Evolving Threshold Access Structures
    Wu, Xiaotian
    Feng, Xinjie
    [J]. IEEE TRANSACTIONS ON MULTIMEDIA, 2024, 26 : 1488 - 1503
  • [37] An Extensive Review on Visual Cryptography Schemes
    Ramya, J.
    Parvathavarthini, B.
    [J]. 2014 INTERNATIONAL CONFERENCE ON CONTROL, INSTRUMENTATION, COMMUNICATION AND COMPUTATIONAL TECHNOLOGIES (ICCICCT), 2014, : 223 - 228
  • [38] Measure-independent characterization of contrast optimal visual cryptography schemes
    D'Arco, P.
    De Prisco, R.
    De Santis, A.
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2014, 95 : 89 - 99
  • [39] Optimal Contrast Grayscale Visual Cryptography Schemes With Reversing
    Wang, Dao-Shun
    Song, Tao
    Dong, Lin
    Yang, Ching-Nung
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2013, 8 (12) : 2059 - 2072
  • [40] Compatible ideal contrast visual cryptography schemes with reversing
    Hu, CM
    Tzeng, WG
    [J]. INFORMATION SECURITY, PROCEEDINGS, 2005, 3650 : 300 - 313