Secret sharing scheme Circular Visual Cryptography for Color Images - Survey

Authors

  • Parmar S Computer Engineering Department, Sigma Institute of Engineering, Vadodara, Gujarat, India
  • Degadwala SD Computer Engineering Department, Sigma Institute of Engineering, Vadodara, Gujarat, India
  • Modi N Computer Engineering Department, Sigma Institute of Engineering, Vadodara, Gujarat, India

DOI:

https://doi.org/10.26438/ijcse/v6i11.903906

Keywords:

Visual cryptography, Random grid, Circular girds, Q’tron neural networks traditional visual cryptography, circular visual cryptography, hierarchical visual cryptography

Abstract

Information Security ensures mathematical techniques and related aspects to provide for confidentiality, data security, entity authentication and data origin authentication. Visual cryptography is a new technique which provides information security using simple algorithm unlike the complex, computationally intensive algorithms used in other techniques like traditional cryptography. This technique allows visual information to be encrypted in such a way that their decryption can be performed by the Human Visual System (HVS), without any complex cryptographic algorithms. Circular Random Grids extends the functionality by hiding more data in circular grids to provide confidentiality and secrecy without risking suspicion of an intruder. The proposed scheme complies with the methodology of secret sharing scheme where secret information is divided into various shares in meaningless form and is further recovered on overlapping printed transparencies with the shared information on it. Each of them is then validated for authenticity. An attempt has been made to use circular rings to embed the secret information with certain angular rotation and validation of the individual cipher shared in order to avoid cheating. In this paper we are describe every methods of VCS and presented its comparative study using advantages and disadvantages

References

[1] Sandeep Gurung and Mrinaldeep “ChakravortMultiple Information Hiding in General Access Structure Visual Cryptography Using Q’tron Neural Network”. Springer-2018[1]

[2] Abhishek Mishra & Ashutosh Gupta “ Multi secret sharing scheme using iterative Method”. 12 Apr 2018 Elsevier[2]

[3] Bibhas Chandra Das, Md Kutubuddin Saradr, Avishek Adhikari “Efficient Constructions for t-(k; n)-Randon Grid Visual Cryptographic Schemes”. 2017 IEEE[3]

[4] Tzung-Her Chen , Kuang-Che Li “Multi-image encryption by circular random grids”. 2009 Elsevier[4]

[5] Sandeep Gurung, Mrinaldeep Chakravorty, Abhi Agarwal, M K “Multiple Information Hiding using Circular Random Grids”.2015Elsevier[5]

[6] Sandeep Gurung, Bijoy Chhetri, Mrinal Kanti Ghose “A Novel approach for Circular Random Grid with Share Authentication”. 2015 IEEE[6]

[7] S. D. Degadwala and S. Gaur “Metadata of the chapter that will be visualized in SpringerLink”. Springer-2018[7]

[8] Shyong Jian Shyu “ Visual Cryptograms of Random Grids for General Access Structures”. 2012 IEEE[8]

[9] Sandeep Gurung,Gaurav Ojha,M K Ghose “ Multiple Image Encryption using Random Circular Grids and Recursive Image Hiding”. May 2013 IJETAE[9]

[10] Sandeep Gurung, Mrinaldeep Chakravorty, Abhi Agarwal, M K Ghose “Multiple Information Hiding using CircularRandomGrids”.2015Elsevier[10]

Downloads

Published

2025-11-18
CITATION
DOI: 10.26438/ijcse/v6i11.903906
Published: 2025-11-18

How to Cite

[1]
S. Parmar, S. D. Degadwala, and N. Modi, “Secret sharing scheme Circular Visual Cryptography for Color Images - Survey”, Int. J. Comp. Sci. Eng., vol. 6, no. 11, pp. 903–906, Nov. 2025.