Back close

A Probabilistic Essential Visual Cryptographic Scheme for Plural Secret Images

Publication Type : Book Chapter

Thematic Areas : TIFAC-CORE in Cyber Security

Publisher : Advanced Computing, Networking and Informatics- Volume 2: Wireless Networks and Security Proceedings of the Second International Conference on Advanced Computing, Networking and Informatics (ICACNI-2014)

Source : Advanced Computing, Networking and Informatics- Volume 2: Wireless Networks and Security Proceedings of the Second International Conference on Advanced Computing, Networking and Informatics (ICACNI-2014), Springer International Publishing, Cham, p.225–231 (2014)

Url : http://dx.doi.org/10.1007/978-3-319-07350-7_25

ISBN : 9783319073507

Keywords : Essential Visual Cryptography, multiple secrets, Probabilistic schemes

Campus : Coimbatore

School : Centre for Cybersecurity Systems and Networks, School of Engineering

Center : TIFAC CORE in Cyber Security

Department : Computer Science, cyber Security, Electronics and Communication, Mathematics

Verified : Yes

Year : 2014

Abstract :

In order to reduce the pixel expansion of visual cryptography scheme (VCS), many probabilistic schemes were proposed. Let P = {P 1,P 2,P 3,...,P n } be the set of participants. The minimal qualified set for essential VCS is given by Γ0={AA ⊆ PP 1 ∈ A and |A| = k}. In this paper we propose a construction of probabilistic essential VCS for sharing plural secret images simultaneously.

Cite this Research Publication : K. Praveen and Dr. M. Sethumadhavan, “A Probabilistic Essential Visual Cryptographic Scheme for Plural Secret Images”, in Advanced Computing, Networking and Informatics- Volume 2: Wireless Networks and Security Proceedings of the Second International Conference on Advanced Computing, Networking and Informatics (ICACNI-2014), M. Kumar Kundu, Mohapatra, P. Durga, Konar, A., and Chakraborty, A., Eds. Cham: Springer International Publishing, 2014, pp. 225–231.

Admissions Apply Now