Title :
A novel visual secret sharing scheme without image size expansion
Author :
Askari, Nazanin ; Moloney, Cecilia ; Heys, Howard M.
Author_Institution :
Electr. & Comput. Eng., Memorial Univ. of Newfoundland, St. John´s, NL, Canada
fDate :
April 29 2012-May 2 2012
Abstract :
Over the past few years, increasing concern about the privacy of information shared in computer systems has increased interest in data security. Visual cryptography is a secure secret sharing scheme that divides secret images into shares which on their own reveal no information of the original secret image. Recovery of the secret image can be performed by superimposing the shares. Hence, the process does not require any special software or hardware for cryptographic computations. However, loss of resolution and contrast, and also the image size expansion which results in the need for storage space, are resulting problems and have been the focus of many researchers. In this paper, we propose a novel visual secret sharing scheme without image size expansion. Compared to other schemes of visual cryptography, our perfectly secure scheme not only does not have pixel expansion, but also provides a high quality recovered image.
Keywords :
Internet; cryptography; data privacy; image coding; Internet; computer systems; data security; information privacy; information resources; secret image encoding; secret image recovery; visual cryptography; visual secret sharing scheme; Computers; Cryptography; Encoding; Gray-scale; Image reconstruction; Stacking; Visualization;
Conference_Titel :
Electrical & Computer Engineering (CCECE), 2012 25th IEEE Canadian Conference on
Conference_Location :
Montreal, QC
Print_ISBN :
978-1-4673-1431-2
Electronic_ISBN :
0840-7789
DOI :
10.1109/CCECE.2012.6334888