Testing the randomness of shares in color visual cryptography

Author:

Chmielewski Leszek J.ORCID,Nieniewski MariuszORCID,Orłowski ArkadiuszORCID

Abstract

AbstractThe concept of black-and-white visual cryptography with two truly random shares, previously applied to color images, was improved by mixing the contents of the segments of each coding image and by randomly changing a specified number of black pixels into color ones. This was done in such a way that the changes of the contents of the decoded image were as small as possible. These modifications made the numbers of color pixels in the shares close to balanced, which potentially made it possible for the shares to be truly random. The true randomness was understood as that the data pass the suitably designed randomness tests. The randomness of the shares was tested with the NIST randomness tests. Part of the tests passed successfully, while some failed. The target of coding a color image in truly random shares was approached, but not yet reached. In visual cryptography, the decoding with the unarmed human eye is of primary importance, but besides this, simple numerical processing of the decoded image makes it possible to greatly improve the quality of the reconstructed image, so that it becomes close to that of the dithered original image.

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition

Reference28 articles.

1. Bassham LE, Rukhin AL, Soto J et al (2010) A statistical test suite for random and pseudorandom number generators for cryptographic applications. Technical report, National Institute of Standards and Technology, Gaithersburg, MD, USA. Series: Special Publication (NIST SP), Rep. No. 800-22 Rev 1a https://www.nist.gov/manuscript-publication-search.cfm?pub_id=906762

2. Chmielewski LJ, Gawdzik G, Orłowski A (2019) Towards color visual cryptography with completely random shares. In: Proceedings of conference on PP-RAI 2019—Konf. Polskiego Porozumienia na rzecz Rozwoju Sztucznej Inteligencji, pp 150–155. Wrocław University of Science and Technology, Wrocław, Poland. http://pp-rai.pwr.edu.pl/PPRAI19_proceedings.pdf

3. Chmielewski LJ, Nieniewski, M, Orłowski A (2021) Histograms—supplementary material to: Testing the randomness of shares in color visual cryptography. Submitted as supplementary material together with this paper

4. Chmielewski LJ, Nieniewski M, Orłowski A (2021) Visual cryptography—file repository . http://www.lchmiel.pl/visualcrypto. Accessed Jun 2021

5. Cimato S, Yang CN (2012) Visual cryptography and secret image sharing (digital imaging and computer vision), 1st edn. CRC Press, Inc., Boca Raton. https://doi.org/10.1201/b11068

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Visual Cryptographic Shares Using Color Components;Handbook of Research on Thrust Technologies’ Effect on Image Processing;2023-06-30

2. Error Analysis and Graphical Evidence of Randomness in Two Methods of Color Visual Cryptography;Computer Vision and Graphics;2023

3. Can Color Visual Cryptography Be Truly Random?;Progress in Image Processing, Pattern Recognition and Communication Systems;2021-08-18

4. Testing the randomness of shares in color visual cryptography;Pattern Analysis and Applications;2021-06-24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3