Resolution variant visual cryptography for street view of Google Maps

Weir, Jonathan; Wan, Yan

doi:10.1109/iscas.2010.5537511

Cited by 20 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, various studies about visual cryptography are proposed. Some has proposed a method for splitting the image into two different shares and some proposed on pixel quality enhancement [11][13], original image transmission or secret image transmission [12]. On the other hand, there have been also many reports for productions of meaningful binary halftone share images [14].Fu and Au have dealt with binary or ternary images like text images as secret image [8], while other many researchers have studied about natural gray-scale images like photographs as secret image and image as keys [9], [10].…”

Section: Segment Displaymentioning

confidence: 99%

Segment Based Visual Cryptography For Key Distribution

Indrakanti¹,

Avadhani²

2012

IJCSES

View full text Add to dashboard Cite

Security is playing a vital role in this era of information technology, it has become a prerequisite in the digital world for maintaining the secrecy of the information. Many techniques have been proposed for handling textual data, maintenance of confidentiality of pictographic data is also becoming a priority. The trend of pictographic data hiding is pixel based, here a version of Visual Cryptography is presented which is segment-based instead of pixel based. The key or the secret which is in the form of digits that is to be distributed is converted into segment display and then encrypted .The result of encryption is two random shares. The decryption process involves the stacking of these two shares. It is easier to view the secret with the human eye by stacking the shares.

show abstract

Section: Segment Displaymentioning

confidence: 99%

Segment Based Visual Cryptography For Key Distribution

Indrakanti¹,

Avadhani²

2012

IJCSES

View full text Add to dashboard Cite

show abstract

“…A rather unique way of looking at the multiple secret sharing problem in a practical way is detailed within [11]. The authors take the idea of sharing multiple secrets and apply it to Google's Street View implementation used within Google Maps.…”

Section: Related Workmentioning

confidence: 99%

“…The scheme in [11] uses a recursive secret sharing scheme which caters for the multiple zoom levels which are supported by Google Maps. After the recursive shares have been embedded, superimposing the corresponding share reveals the secret.…”

Section: Related Workmentioning

confidence: 99%

Plane Transform Visual Cryptography

Weir

Wan

2011

Digital Watermarking

Self Cite

View full text Add to dashboard Cite

Abstract. Plane transformation visual cryptography takes a unique approach to some of the current shortcomings of current visual cryptography techniques. Typically, the direction and placement of the encrypted shares is critical when attempting to recover the secret. Many schemes are highly dependant on this stacking order. Within this paper, the scheme presented illustrates a technique whereby this restriction is loosened such that the number of acceptable alignment points is increased by performing a simple plane transform on one of the shares. This results in the same secret being recovered when the shares correctly aligned. The technique has also been extended to encompass multiple secrets, each of which can be recovered depending on the type of transformation performed on the shares.

show abstract

“…The underlying operation of the stacking is the logic OR. Lots of research focused on the novel applications of VCS [2][3][4][5]. Recently, some books covered an extensive range of topics related to VCS [6][7][8].…”

Section: Introductionmentioning

confidence: 99%

ESSVCS: An Enriched Secret Sharing Visual Cryptography

Liu

Yan

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we propose a general method to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k, t, n)-VC scheme. Compared to those existing schemes, our approach could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets.

show abstract

Resolution variant visual cryptography for street view of Google Maps

Cited by 20 publications

References 13 publications

Segment Based Visual Cryptography For Key Distribution

Segment Based Visual Cryptography For Key Distribution

Plane Transform Visual Cryptography

ESSVCS: An Enriched Secret Sharing Visual Cryptography

Contact Info

Product

Resources

About