Abstract
Actual randomness of the shares in the binary random visual cryptography protocol was tested with the NIST statistical test suite. Lack of randomness was noticed for a large secret image (shares 10K by 10K) in that the OverlappingTemplate test failed. The symptom of failure was much weaker for a twice smaller image and absent for a four times smaller one. The failure rate nonmonotonically depended on the period of the pseudorandom number generator, but was the largest for the worst generator. Four generators were used with periods from \(2^{64}\) to \(2^{19937}\). Hence, the reason for the nonrandomness seemed not to be the excessively large image size versus generator period, provided that the generator is reasonably good. Using the battery of tests made it possible to detect a gap in the randomness (not in the security) of the random visual cryptography protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brewer, C.A.: www.colorbrewer.org (2018). Accessed 9 May 2020
Chmielewski, L.J., Gawdzik, G., Orłowski, A.: Towards color visual cryptography with completely random shares. In: Proceedings of the Conference PP-RAI 2019 - Konf. Polskiego Porozumienia na rzecz Rozwoju Sztucznej Inteligencji, pp. 150–155. Wrocław University of Science and Technology, Wrocław, Poland, 16–18 October 2019. http://pp-rai.pwr.edu.pl/PPRAI19_proceedings.pdf
Cimato, S., Yang, C.N.: Visual Cryptography and Secret Image Sharing, 1st edn. CRC Press Inc., Boca Raton (2017). https://www.crcpress.com/Visual-Cryptography-and-Secret-Image-Sharing/Cimato-Yang/p/book/9781138076044
Dhiman, K., Kasana, S.S.: Extended visual cryptography techniques for true color images. Comput. Electr. Eng. 70, 647–658 (2018). https://doi.org/10.1016/j.compeleceng.2017.09.017
Kafri, O., Keren, E.: Encryption of pictures and shapes by random grids. Opt. Lett. 12(6), 377–379 (1987). https://doi.org/10.1364/OL.12.000377
Lin, C.C., Tsai, W.H.: Visual cryptography for gray-level images by dithering techniques. Pattern Recogn. Lett. 24(1), 349–358 (2003). https://doi.org/10.1016/S0167-8655(02)00259-3
Liu, F., Wu, C.K., Lin, X.J.: Colour visual cryptography schemes. IET Inf. Secur. 2(4), 151–165 (2008). https://doi.org/10.1049/iet-ifs:20080066
Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 1–12. Springer, Heidelberg (1995). https://doi.org/10.1007/BFb0053419
Naor, M., Shamir, A.: Visual cryptography II: improving the contrast via the cover base. In: Lomas, M. (ed.) Security Protocols. LNCS, vol. 1189, pp. 197–202. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-62494-5_18
Orłowski, A., Chmielewski, L.J.: Color visual cryptography with completely randomly coded colors. In: Vento, M., Percannella, G. (eds.) CAIP 2019. LNCS, vol. 11678, pp. 589–599. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-030-29888-3_48
Orłowski, A., Chmielewski, L.J.: Generalized visual cryptography scheme with completely random shares. In: Petkov, N., Strisciuglio, N., Travieso, C.M. (eds.) Proc. 2nd International Conference Applications of Intelligent Systems APPIS 2019, pp. 33:1–33:6. Association for Computing Machinery, Las Palmas de Gran Canaria (2019). https://doi.org/10.1145/3309772.3309805
Orłowski, A., Chmielewski, L.J.: Randomness of shares versus quality of secret reconstruction in black-and-white visual cryptography. In: Rutkowski, L., et al. (eds.) ICAISC 2019. LNAI, vol. 11509, pp. 58–69. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-20915-5_6
Rukhin, A., Soto, J., Nechvatal, J., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. Technical report 800–22 Rev 1a, National Institute of Standards and Technology, 16 September 2010. http://www.nist.gov/manuscript-publication-search.cfm?pub_id=906762, series: Special Publication (NIST SP)
Sharma, R.G., Dimri, P., Garg, H.: Visual cryptographic techniques for secret image sharing: a review. Inf. Secur. J.: A Glob. Perspect. 27(5–6), 241–259 (2018). https://doi.org/10.1080/19393555.2019.1567872
The MathWorks Inc: MATLAB. Natick, MA, USA (2020). https://www.mathworks.com
The MathWorks Inc: MATLAB documentation: Creating and Controlling a Random Number Stream. Natick, MA, USA (2020). https://www.mathworks.com/help/matlab/math/creating-and-controlling-a-random-number-stream.html. Accessed 04 Jan 2020
Tufte, E.R.: The Visual Display of Quantitative Information. Graphic Press, Cheshire (1983)
Wang, R.Z., Lan, Y.C., Lee, Y.K., et al.: Incrementing visual cryptography using random grids. Opt. Commun. 283(21), 4242–4249 (2010). https://doi.org/10.1016/j.optcom.2010.06.042
Wu, H., Wang, H., Yu, R.: Color visual cryptography scheme using meaningful shares. In: Proceedings of the 8th International Conference Intelligent Systems Design and Applications ISDA 2008, vol. 3, pp. 173–178. Kaohsiung, Taiwan, November 2008. https://doi.org/10.1109/ISDA.2008.130
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Chmielewski, L.J., Orłowski, A. (2020). Does Randomness in the Random Visual Cryptography Protocol Depend on the Period of Pseudorandom Number Generators?. In: Chmielewski, L.J., Kozera, R., Orłowski, A. (eds) Computer Vision and Graphics. ICCVG 2020. Lecture Notes in Computer Science(), vol 12334. Springer, Cham. https://doi.org/10.1007/978-3-030-59006-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-59006-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-59005-5
Online ISBN: 978-3-030-59006-2
eBook Packages: Computer ScienceComputer Science (R0)