scholarly journals Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Kenan Kingsley Phiri ◽  
Hyunsung Kim
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Cheating Detection ◽  
Linear Scheme ◽  
Elgamal Cryptosystem ◽  
Important Branch

Threshold secret sharing is concerned with the splitting of a secret into n shares and distributing them to some persons without revealing its information. Any t ≤ n persons possessing the shares have the ability to reconstruct the secret, but any persons less than t cannot do the reconstruction. Linear secret sharing scheme is an important branch of secret sharing. The purpose of this paper is to propose a new polynomial based linear (t, n) secret sharing scheme, which is based on Shamir’s secret sharing scheme and ElGamal cryptosystem. Firstly, we withdraw some required properties of secret sharing scheme after reviewing the related schemes and ElGamal cryptosystem. The designed scheme provides the properties of security for the secret, recoverability of the secret, privacy of the secret, and cheating detection of the forged shares. It has half computation overhead than the previous linear scheme.

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

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.

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

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.

Sign in / Sign up

Export Citation Format

Share Document