Abstract

Visual cryptography encodes a secret binary image (SI) keen on share of unsystematic binary sample. If the share is xeroxed against transparencies, the key figure is often visually decrypted by means that of superimposing a skilled subset of transparencies, however no secret data is obtained from the superposition of a forbidden subset. The binary model of the N allocates, although, contain no visual consequence and hinder the objectives of visual cryptography. The perfect security condition of VC scheme needs the strict demand where any t-1 or fewer transparencies cannot extract much knowledge regarding the key. The secret image is at the same time embedded into color halftone shares. Visual cryptography (VC) could be a secret sharing method of decay a secret picture into n transparencies, and consequently the stack of any t out of n transparencies disclose the key content. A HVC generate procedure is projected that can make an option for secret halftone image into color half-tone shares. In [1], authors centre of attention how to securely distribute video contents to an assured collection of persons for the period of a testing time period in cloud-based multimedia systems, and propose a cryptographic come within reach of, a provably secure time domain attribute-based access control (TAAC) scheme, to secure the cloud-based video content sharing.

References

• Y. Kan, et al. “Time-domain attribute-based access control for cloud-based video content sharing: A cryptographic approach” IEEE Trans. on Multi. 18.5 (2016): 940-950.
• P. Vilma, et al. “Dynamic visual cryptography for optical assessment of chaotic oscillations” Opt. & Laser Tech. 57 (2014): 129-135.
• Bahrami, Zhila, and Fardin Akhlaghian Tab. “A new robust video watermarking algorithm based on SURF features and block classification” Mult. Tools and App. (2016): 1-19.
• P. Paulius, and M.Ragulskis. “Image communication scheme based on dynamic visual cryptography and computer generated holography” Opt. Comm. 335 (2015): 161-167.
• Pandey, Anjney, and Subhranil Som. “Applications and usage of visual cryptography: A review” Reliability, Infocom Technologies and Optimization (Trends and Future Directions)(ICRITO), 2016 5th International Conference on. IEEE, 2016.
• Yuan, Lifeng, et al. “Secret Image Sharing Scheme with Threshold Changeable Capability” Mathematical Problems in Engineering 2016 (2016).
• Ma, Zhaofeng, et al. “A Novel Image Digital Rights Management Scheme with High-Level Security, Usage Control and Traceability” Chinese Journal of Electronics 25.3 (2016): 481-494.
• Chai, Xiuli, Kang Yang, and Zhihua Gan. “A new chaos-based image encryption algorithm with dynamic key selection mechanisms” Multimedia Tools and Applications (2016): 1-21.
• Hofmeister T., Krause M., and Simon H. U. “Contrast-optimal out of secret sharing schemes in visual cryptography” Comput. Sci., vol. 240, no. 2, pp. 471–485, Jun. 2000.
• P. A. Eisen and D. R. Stinson “Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels” Designs Cryptography, vol. 25, no. 1, pp. 15–61, 2002.
• M. Nakajima and Y. Yamaguchi, “Extended visual cryptography for natural images” WSCG J., vol. 10, no. 2, pp. 303–310, 2002.
• H. Koga “A general formula of the -threshold visual secret sharing scheme” in Proc. Int. Theory and Application of Cryptology and Information Security: Advances in Cryptology, Dec. 2002, pp. 328–345.
• S. Cimato, R. De Prisco, and A. De Santis, “Probabilistic visual cryptography schemes” Computer J., vol. 49, no. 1, pp. 97–107, Jan. 2006.
• G. B. Horng, T. G. Chen, and D. S. Tsai, “Cheating in visual cryptography” Designs, Codes, Cryptography, vol. 38, no. 2, pp. 219–236, Feb. 2006.
• N. Macon and A. Spitzbart, “Inverses of Vandermonde matrices” Amer. Math. Monthly, vol. 65, no. 2, pp. 95–100, Feb. 1958.
• O. Kafri and E. Kerens, “Encryption of pictures and shapes by random grids” Letter of , vol. 12, no. 6, pp. 377–379, Jun. 1987.
• M. Naor and Shamir A. “Visual cryptography” in Advances Proc. in Cryptography 1995, vol. 950, LNCS, pp. 1–12.
• Ateniese G. Blundo C. A. De Santis, and D. R. Stinson, “Visual cryptography for general access structures” Inf. Computat., vol. 129, no. 2, pp. 86–106, Sep. 1996.
• E. R. Verheul and H. C. A. Van Tilborg, “Constructions and properties of out of visual secret sharing schemes” Designs Cryptography, vol. 11, no. 2, pp. 179–196, May 1997.
• C.C. Wu, L.H. Chen, “A Study on Visual Cryptography” National Chiao Tung University, Taiwan, R.O.C., 1998.
• C. Blundo, A. De Santis, and D. R. Stinson, “On the contrast in visual cryptography schemes” J. Cryptology, vol. 12, no. 4, pp. 261–289, 1999.
• R. Ito, H. Kuwakado, and H. Tanaka, “Image size invariant visual cryptography” IEICE Trans. Fundam. Electron. Commun. & Comput. Sci., vol. 82, pp. 2172–2177, Oct. 1999.
• Weir, Jonathan, and WeiQi Yan. "Sharing multiple secrets using visual cryptography." Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on. IEEE, 2009.
• Lee, Kai-Hui, and Pei-Ling Chiu. "An extended visual cryptography algorithm for general access structures." ieee transactions on information forensics and security 7.1 (2012): 219-229.
• Yan, Xuehu, et al. "Halftone visual cryptography with minimum auxiliary black pixels and uniform image quality." Digital Signal Processing 38 (2015): 53-65.