The lecture will discuss the following:
Let P be a set on n elements, called participants. Consider a secret image which consists of black and white pixels. A (k,n) - Visual Crptography Scheme is a method of constructing n shares of the secret image, one for each participant, in such a way that the secret image can be reconstructed from k or more shares but not from less than k shares. The process of reconstruction is purely visual in the sense that if each share is xeroxed on a transparency, the recovering of the image is just by stacking the respective transparency sheets. In this talk we give a brief survey of Visual Crptography Scheme and its applications.
Read more | Register