
An Antiquity to the contemporary of Secret Sharing Scheme
Author(s) -
K. Chitra,
V. Prasanna Venkatesan
Publication year - 2020
Publication title -
journal of innovative image processing
Language(s) - English
Resource type - Journals
ISSN - 2582-4252
DOI - 10.36548/jiip.2020.1.001
Subject(s) - secret sharing , homomorphic secret sharing , image sharing , shamir's secret sharing , scheme (mathematics) , verifiable secret sharing , secure multi party computation , computer science , shadow (psychology) , cryptography , context (archaeology) , image (mathematics) , visual cryptography , access structure , process (computing) , pixel , theoretical computer science , computer security , mathematics , artificial intelligence , set (abstract data type) , geography , psychology , mathematical analysis , psychotherapist , programming language , operating system , archaeology
Secret Sharing (SS) scheme divides a secret image into shadow images (referred to as shares) in a way that requires the shadows in a certain privileged coalition for the secret reconstruction. However, the secret image cannot be revealed if they are not combined in a prescribed way. In this paper, the evolution of the traditional secret sharing scheme to the contemporary of secret sharing scheme has been presented based on its technology adoption. The basic comparison between the traditional secret sharing scheme and Visual cryptography is presented. The image-based share generation process has been explained in the context of pixel sharing patterns and its process. The reconstruction image is obtained by the XOR /OR Boolean operation. The threshold-based share generation schemes are explained mathematically and the comparative analysis of these schemes also presented.