Multilevel Threshold Secret Sharing Scheme to Secure MapReduce Computations in Cloud Computing Environment

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.

Download Full-text

Comments on ‘Fair (t, n) threshold secret sharing scheme’

IET Information Security ◽

10.1049/iet-ifs.2013.0302 ◽

2014 ◽

Vol 8 (6) ◽

pp. 303-304 ◽

Cited By ~ 8

Author(s):

Lein Harn

Keyword(s):

Secret Sharing ◽

Secret Sharing Scheme ◽

Threshold Secret Sharing ◽

Sharing Scheme

Download Full-text

(t,k,n) Multi-Blind Proxy Signature Scheme on Elliptic Curve

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.130-134.291 ◽

2011 ◽

Vol 130-134 ◽

pp. 291-294

Author(s):

Guang Liang Liu ◽

Sheng Xian Xie ◽

Wei Fu

Keyword(s):

Elliptic Curve ◽

Secret Sharing ◽

Proxy Signature ◽

Elliptic Curve Cryptosystem ◽

Secret Sharing Scheme ◽

Signature Scheme ◽

Forgery Attack ◽

Threshold Secret Sharing ◽

Sharing Scheme ◽

Security Properties

On the elliptic curve cryptosystem proposed a new multi-proxy signature scheme - (t, k, n) threshold blind proxy signature scheme.In new program blind proxy signature and (t,k,n) threshold secret sharing scheme will be combined, and will not over-concentration of the rights of the blind proxy signer .Computation of the program is small, security is high, the achieve efficiency and the utility is better .can prevent a malicious user's forgery attack and have the security properties of proxy signature.

Download Full-text

Secret sharing scheme for cloud computing using IDs

2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE) ◽

10.1109/gcce.2013.6664911 ◽

2013 ◽

Cited By ~ 3

Author(s):

Satoshi Takahashi ◽

Shiro Kobayashi ◽

Hyunho Kang ◽

Keiichi Iwamura

Keyword(s):

Cloud Computing ◽

Secret Sharing ◽

Secret Sharing Scheme ◽

Sharing Scheme

Download Full-text

Towards Attack and Defense Views to (t, n)-threshold Secret Sharing Scheme Using Information Theory

10.1109/nana53684.2021.00017 ◽

2021 ◽

Author(s):

Ze Yang ◽

Youliang Tian

Keyword(s):

Information Theory ◽

Secret Sharing ◽

Secret Sharing Scheme ◽

Threshold Secret Sharing ◽

Sharing Scheme ◽

Attack And Defense

Download Full-text

A New Protocol for Secure Distributed Multiplication of Two Polynomial Shared Values

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.1042.110 ◽

2014 ◽

Vol 1042 ◽

pp. 110-116

Author(s):

Xiang Ning Hao ◽

Xue Min Wang ◽

Li Qiong Deng

Keyword(s):

Secret Sharing ◽

Shared Values ◽

Secret Sharing Scheme ◽

Threshold Secret Sharing ◽

Practical Applications ◽

Classic Problem ◽

Sharing Scheme ◽

Better Than

In view of practical applications, it is a high priority to optimize the efficiency of methods for secure multi-party computations. A classic problem is described as following: there are two secrets, α and β, shared among n players using Shamir (t+1,n)-threshold secret sharing scheme, and how to make their product αβshared among n players using the same way. The protocol of Gennaro, Rabin and Rabin (1998) is a well known and efficient protocol for this purpose. It requires one round of communication and O(n2klog2n+nk2) bit-operations per player, where k is the bit size of the computing field and n is the number of players. In a previous paper (2007), the author presented a modification of this protocol, which reduced its complexity toOn2k+nk2. In 2009, Peter Lory reduced its complexity to On2k. A new protocol is presented in our paper, which reduces this complexity further to Onklog2k. It is better than Gennaro protocol unconditionally. And as to Peter Lory protocol, the reduction is profitable in situation where log2k is smaller than n.

Download Full-text