Improved scheme and evaluation method for progressive visual cryptography

被引:0
|
作者
Thai, Binh Le Thanh [1 ]
Tanaka, Hidema [1 ]
Watanabe, Kohtaro [1 ]
机构
[1] Natl Def Acad Japan, Dept Comp Sci, Yokosuka, Japan
关键词
Visual cryptography; Progressive visual cryptography; Information-theoretic evaluation method; Shannon-Hartley theorem; SECRET SHARING SCHEMES;
D O I
10.1186/s13635-022-00136-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Visual cryptography (VC) is a powerful technique with high security and requires no PC or device to reconstruct the secret information. Progressive visual cryptography (PVC) is a variation of the VC scheme in which the quality of the reconstructed image is improved by increasing the number of shared images. The previous study focused directly on maximizing the value of the quality in the completely reconstructed image; thus, there is a difference in the quality of the shared images. In this paper, we focus on the aforementioned issue and propose a new approach based on inductive reasoning. Our basic idea is to maximize the quality of the reconstructed images each time the number of shared images increases. We call this method the bottom-up approach. Moreover, hitherto, PVC has been evaluated based on the value of relative difference or by sight. Such evaluation methods are only subjective or difficult to execute without the knowledge of basis matrices. In addition, PVC users cannot easily confirm the effectiveness of their shared images. In this paper, we propose a new information-theoretic evaluation method for PVC, which only uses shared images, to solve the aforementioned problems. Our proposed method can objectively and quantitatively evaluate PVC based on the numerical value, and PVC users can easily confirm the effectiveness of their shared images.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] On (k, n)*-visual cryptography scheme
    S. Arumugam
    R. Lakshmanan
    Atulya K. Nagar
    Designs, Codes and Cryptography, 2014, 71 : 153 - 162
  • [32] On (k, n)*-visual cryptography scheme
    Arumugam, S.
    Lakshmanan, R.
    Nagar, Atulya K.
    DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (01) : 153 - 162
  • [33] PROGRESSIVE VISUAL CRYPTOGRAPHY WITH WATERMARKING FOR MEANINGFUL SHARES
    Jithi, P., V
    Nair, Anitha T.
    2013 IEEE INTERNATIONAL MULTI CONFERENCE ON AUTOMATION, COMPUTING, COMMUNICATION, CONTROL AND COMPRESSED SENSING (IMAC4S), 2013, : 394 - 401
  • [34] Progressive Visual Cryptography with Unexpanded Meaningful Shares
    Shivani, Shivendra
    Agarwal, Suneeta
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2016, 12 (04)
  • [35] HOW TO CONSTRUCT PROGRESSIVE VISUAL CRYPTOGRAPHY SCHEMES
    Wang, Wenjuan
    Fujita, Hachiro
    2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP), 2015, : 1772 - 1776
  • [36] An Improved Visual Cryptography with Cheating Prevention
    Chen, Yu-Chi
    Lu, Kunhan
    Tso, Raylin
    Wu, Mu-En
    DIGITAL-FORENSICS AND WATERMARKING, IWDW 2014, 2015, 9023 : 444 - 454
  • [37] A New Copyright Protection Scheme with Visual Cryptography
    Park, Geum-Dal
    Yoon, Eun-Jun
    Yoo, Kee-Young
    2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING SYMPOSIA, VOLS 1-5, PROCEEDINGS, 2008, : 156 - +
  • [38] Flexible visual cryptography scheme and its application
    Liu, Feng
    Guo, Teng
    Wu, Chuankun
    Yang, Ching-Nung
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8363 : 110 - 130
  • [39] Construction of a (k, n)-visual cryptography scheme
    R. Lakshmanan
    S. Arumugam
    Designs, Codes and Cryptography, 2017, 82 : 629 - 645
  • [40] On the security of a visual cryptography scheme for color images
    Leung, Bert W.
    Ng, Felix Y.
    Wong, Duncan S.
    PATTERN RECOGNITION, 2009, 42 (05) : 929 - 940