DocumentCode :
2943531
Title :
Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme
Author :
Koga, Hiroki ; Ueda, Etsuyo
Author_Institution :
Graduate Sch. of Syst. & Inf. Eng., Tsukuba Univ.
fYear :
2006
fDate :
9-14 July 2006
Firstpage :
912
Lastpage :
916
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 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 = 2, 3,4, 5 we can prove the existence of basis matrices of the (t, n)-VSSS that almost perfectly reproduces a secret image when all the n shares are stacked if n is sufficiently large
Keywords :
cryptography; image recognition; matrix algebra; secret image recognition; shares; threshold visual secret sharing scheme; Cryptography; Image recognition; Information security; Pixel; Proposals; Stacking; Systems engineering and theory; Terminology; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
Type :
conf
DOI :
10.1109/ISIT.2006.261792
Filename :
4036097
Link To Document :
بازگشت