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

Abstract

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… (More)

Topics

2 Figures and Tables

Cite this paper

@article{Koga2006ProposalOA, title={Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme}, author={Hiroki Koga and Eiichi Ueda}, journal={2006 IEEE International Symposium on Information Theory}, year={2006}, pages={912-916} }