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 条
  • [21] XOR-Based Visual Cryptographic Schemes With Monotonously Increasing and Flawless Reconstruction Properties
    Shyu, Shyong Jian
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2018, 28 (09) : 2397 - 2401
  • [22] XOR-based unexpanded meaningful visual secret sharing scheme
    Kannojia S.P.
    Kumar J.
    International Journal of Security and Networks, 2019, 14 (01) : 1 - 9
  • [23] An efficient XOR-based verifiable visual cryptographic scheme
    Jia, Xingxing
    Wang, Daoshun
    Chu, Qimeng
    Chen, Zhenhua
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (07) : 8207 - 8223
  • [24] An efficient XOR-based verifiable visual cryptographic scheme
    Xingxing Jia
    Daoshun Wang
    Qimeng Chu
    Zhenhua Chen
    Multimedia Tools and Applications, 2019, 78 : 8207 - 8223
  • [25] On the contrast in visual cryptography schemes
    Blundo, C
    De Santis, A
    Stinson, DR
    JOURNAL OF CRYPTOLOGY, 1999, 12 (04) : 261 - 289
  • [26] XOR-Based Meaningful (n, n) Visual Multi-Secrets Sharing Schemes
    Huang, Sheng-Yao
    Lo, An-hui
    Juan, Justie Su-Tzu
    APPLIED SCIENCES-BASEL, 2022, 12 (20):
  • [27] A contrast improved OR and XOR based (k, n) visual cryptography scheme without pixel expansion
    Zhao, Yongkang
    Fu, Fang-Wei
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2022, 82
  • [28] On the extension of XOR step construction for optimal contrast grey level visual cryptography
    Praveen, K.
    Sethumadhavan, M.
    2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2017, : 219 - 222
  • [29] XOR-based visual secret sharing scheme using pixel vectorization
    Kannojia, Suresh Prasad
    Kumar, Jasvant
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (10) : 14609 - 14635
  • [30] Bounds for visual cryptography schemes
    Hajiabolhassan, Hossein
    Cheraghi, Abbas
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (06) : 659 - 665