scholarly journals (3, 3) Visual Cryptography for Online Certificate Authentication

2020 ◽  
Vol 9 (6) ◽  
pp. 152-156
Keyword(s):  
Academic Achievement ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Message ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Job Interview ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme ◽  
Full Proof

Today organizations face a challenge while recruiting candidates, who provide forged mark sheets in order to get a job. To prevent wrong hiring a detailed and thorough approach is needed to verify the authentication of both the candidate and the marks obtained by him/her. There are so many modern cryptographic protocols available which can be used for authenticating individual’s academic achievement certificates. Visual Cryptography is a simple and secure way to allow the secret sharing of images without any cryptographic computations or the use of encryption or decryption keys. The novelty of the visual secret sharing scheme is in its decryption process where human visual system (HVS) is employed for decryption of secret shares. In this paper we have discussed (3, 3) visual cryptography scheme which can be used to generate shares and distributes them among three parties, i.e. the Job Seeker, Certificate Issuance Authority and the Organization conducting Job interview. Secret message can be decrypted only if all the three shares are available. Every certificate carries a unique number which is encrypted using visual cryptography and without handshaking of all the parties it is impossible to decrypt, thus ensuring full proof authentication.

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.

scholarly journals A Survey on Secrete Communication through QR Code Steganography for Military Application

2022 ◽  
Vol 10 (1) ◽  
pp. 728-731
Author(s):  
Nikita Bhoskar
Keyword(s):  
Secret Sharing ◽  
Secret Message ◽  
Qr Code ◽  
Secret Sharing Scheme ◽  
Quick Response ◽  
Visual Secret Sharing ◽  
Qr Codes ◽  
Response Code ◽  
Sharing Scheme ◽  
Quick Response Code

Abstract: The quick response code (QR) has become most popular barcode because of its larger data capacity and increased damage resistance. Barcode scanners can easily extract information hidden in the QR code when scanning data forms. However, some confidential data stored directly in QR codes are not secure in real world QR apps. To proposed approach to visual secret sharing scheme to encode a secret QR code into distinct shares. In assessment with other techniques, the shares in proposed scheme are valid QR codes that may be decoded with some unique that means of a trendy QR code reader, so that escaping increases suspicious attackers. An existing sharing technique is subjected to loss of security. On this premise, consider the strategy for (k, n) get to structures by using the (k, k) sharing occurrence on each k-member subset dependent on specific relationship. In addition, the secret message is recovered with the aid of XOR-ing the qualified shares. This operation which can effortlessly be achieved the use of smartphones or different QR scanning gadgets. Contribution work is, working on optimal partitioning methods and compare original message with shared message using hashing techniques. Keywords: Hashing, partitioning algorithm, error correction capacity, high security, Quick Response code, visual secret sharing scheme

scholarly journals Meaningful Share Generation for Increased Number of Secrets in Visual Secret-Sharing Scheme

2010 ◽  
Vol 2010 ◽  
pp. 1-18 ◽  
Author(s):  
Mustafa Ulutas
Keyword(s):  
Secret Sharing ◽  
Contrast Ratio ◽  
Visual Cryptography ◽  
The Other ◽  
Cover Image ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Meaningful Shares ◽  
Sharing Scheme ◽  
Meaningful Share

This paper presents a new scheme for hiding two halftone secret images into two meaningful shares created from halftone cover images. Meaningful shares are more desirable than noise-like (meaningless) shares in Visual Secret Sharing because they look natural and do not attract eavesdroppers' attention. Previous works in the field focus on either increasing number of secrets or creating meaningful shares for one secret image. The method outlined in this paper both increases the number of secrets and creates meaningful shares at the same time. While the contrast ratio of shares is equal to that of Extended Visual Cryptography, two secrets are encoded into two shares as opposed to one secret in the Extended Visual Cryptography. Any two natural-looking images can be used as cover unlike the Halftone Visual Cryptography method where one cover should be the negative of the other cover image and can only encode one secret. Effectiveness of the proposed method is verified by an experiment.

scholarly journals Implementation of QR Code for Sharing Files

2019 ◽  
Vol 8 (2) ◽  
pp. 4284-4288
Keyword(s):  
Secret Sharing ◽  
Computational Cost ◽  
Secret Message ◽  
Qr Code ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Response Code ◽  
Sharing Scheme ◽  
Quick Response Code ◽  
Private Data

QR code is a quick response code which is used to store information. In QR code, the information is stored in encoded form. To access information present in QR code , we need to decode information with the help of scanner. The information which is present in QR code is accessible to anybody. Private data is not safe in such scenario. This paper presents a visual secret sharing scheme to encode a secret QR code into distinct shares. Visual secret sharing scheme is a method of distributing secrete amongst a group of participants. The secret message is recovered by XOR-ing the shares. Secret message can be generated only when enough number of shares are combined. This provides security for private message using visual secret sharing scheme. Proposed system provides higher security to messages and it also provides more flexible access structure. Computational cost of proposed scheme is low

scholarly journals A New Bi-Level Encoding and Decoding Scheme for Pixel Expansion Based Visual Cryptography

2019 ◽  
Vol 6 (1) ◽  
pp. 18-42
Author(s):  
Ram Chandra Barik ◽  
Suvamoy Changder ◽  
Sitanshu Sekhar Sahu
Keyword(s):  
Information Security ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Normal Vision ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Host Image ◽  
Sharing Scheme

Mapping of image-based object textures to ASCII characters can be a new modification towards visual cryptography. Naor and Shamir proposed a new dimension of Information security as visual cryptography which is a secret sharing scheme among N number of participants with pixel expansion. Later on, many researchers extended the visual secret sharing scheme with no expansion of pixel regions in binary and color images. By stacking k shares the secret can be decoded using normal vision. In this paper the authors have proposed a modification towards visual cryptography by converting the message in the form of printable ASCII character-based numerical encoding patterns in a binary host image. The encoding of the message is represented as ASCII numeric and a texture of those numeric are arranged to form a binary host image. Then, N numbers of shares are built up but after stacking all the shares the decoding of the message is achieved by converting ASCII numeric to the secret.

Sign in / Sign up

Export Citation Format

Share Document