Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme

@article{Koga2006ProposalOA,
  title={Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme},
  author={Hiroki Koga and Etsuyo Ueda},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={912-916}
}
This paper is concerned with a variation of the (t, n)-threshold visual secret sharing scheme ((t, n)-VSSS for short). In the (t, n)-VSSS a secret image is encrypted to n images called shares. While we can reproduce the secret image by stacking arbitrary t shares, no information is revealed from less than t shares. We consider a new (t, n)-VSSS in which stacking more than t shares enables us to recognize a secret image more clearly than stacking just t shares. In particular, for the cases of t… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

A construction of the progressive (3, n)-threshold visual cryptography using a BIBD and analysis of its optimality

  • 2017 IEEE Information Theory Workshop (ITW)
  • 2017
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Construction of the (4, n)-Threshold Visual Cryptography Scheme Using a 3-Design

  • 2018 International Symposium on Information Theory and Its Applications (ISITA)
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

Similar Papers