Toward Improving Secret Sharing Scheme Based on Encryption in Cloud Computing Environment

2020 ◽  
Vol 17 (6) ◽  
pp. 2669-2673
Author(s):  
Minakshi Kamboj ◽  
Sanjeev Rana
Keyword(s):  
Cloud Computing ◽  
Secret Sharing ◽  
Threshold Scheme ◽  
Secret Message ◽  
Secret Sharing Scheme ◽  
Cloud Computing Environment ◽  
Sharing Scheme ◽  
Key Issues ◽  
Varying Length ◽  
Dictionary Attacks

Flexibility, acceptance of hire of Cloud Computing, control facilities originates a number of challenges. In precise, safety has been widely conveyed to create the key issues which stop movement to the cloud. Shamir’s Secret Sharing Scheme splits the secret message into n shares with threshold k and distribution of shares to n participants and each participant has unique share of secret message. For reconstructing the secret message, minimum k fragments are required. Threshold scheme which requires only k shares to re-construct the secret message is implemented, as collection of shares from all the n participants to reconstruct the secret message may be unfeasible. AES encryption turns out to be totally inappropriate if a password is used as an alternative of providing the key. The attacker finds file, downloads Ax crypt, and brute force/dictionary attacks it until it’s cracked. An additional security can provided to user password which of varying length by splitting the password into n shares. Advance Encryption Standard (AES) procedure is implemented to encipher the produced shares. AES with 256-bit key is applied to encode the share for every member. Covering arrangement alternative to Boolean masking established on Shamir’s Secret Sharing arrangement is suggested.

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 (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 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 Combining the Pre-Distribution Key Protocol with the Threshold Scheme

2021 ◽  
Vol 2096 (1) ◽  
pp. 012008
Author(s):  
S V Belim ◽  
S Y Belim
Keyword(s):  
Secret Sharing ◽  
Threshold Scheme ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Distribution Scheme ◽  
Shamir Secret Sharing Scheme ◽  
Shamir Secret Sharing

Abstract In the article, the protocol for key pre-distribution using a threshold scheme is proposed. The Blom pre-distribution scheme is used as the basis. Shamir secret sharing scheme is used for threshold scheme. A polynomial of three variables is used to form key materials. Messaging between users is required to generate a key. The threshold scheme (3,4) is used to calculate the encryption key.

Sign in / Sign up

Export Citation Format

Share Document