A (2, 2) and (n, n)-threshold random grid-based visual secret sharing using chaos theory

R. Koikara, A. S. Hidayat, A. Paul, K. Y. Yoo

Research output: Contribution to journalArticlepeer-review

Abstract

Secret sharing schemes may be of different types depending on the decryption process. In this paper we deal with visual cryptography, which is a unique type of secret sharing and is sometimes referred to as Visual Secret Sharing (VSS). Here, we propose a novel VSS scheme that uses random grids in which a secret image can be extracted using two different techniques: one which is OR-based and one that is XOR-based. In this scheme we strive to improve the randomness of the random-grids used and also the quality of the secret image reconstructed. The quality of the secret image obtained can be considered as lossless. We have performed the randomness test of the random-grids obtained using the Diehard test suite. This test has shown that there is an improvement in the randomness of the random-grids. Also, the quality of the reconstructed secret image is much better. We also formulate the idea for a (n,n)-threshold VSS scheme using Chaos Theory.

Original languageEnglish
Pages (from-to)2527-2531
Number of pages5
JournalAdvanced Science Letters
Volume22
Issue number9
DOIs
StatePublished - Sep 2016

Keywords

  • Chaos theory
  • Random-Grid
  • Visual cryptography
  • Visual secret sharing

Fingerprint

Dive into the research topics of 'A (2, 2) and (n, n)-threshold random grid-based visual secret sharing using chaos theory'. Together they form a unique fingerprint.

Cite this