On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection

Jhanwar, Mahabir Prasad

doi:10.1007/978-3-319-03515-4_12

Cited by 3 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Identification is also good since it helps to recognize who the cheater is and can be removed from the system during the next sharing. Other schemes reconstruct the secret even though there are forged shares called robust secret sharing scheme (RSS) [21][22][23]. RSS prevents cheating by allowing the reconstruction of the correct secret even if some participants submit forged shares.…”

Section: Introductionmentioning

confidence: 99%

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

Phiri

Kim

2019

Security and Communication Networks

View full text Add to dashboard Cite

Threshold secret sharing is concerned with the splitting of a secret into shares and distributing them to some persons without revealing its information. Any ≤ persons possessing the shares have the ability to reconstruct the secret, but any persons less than 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 ( , ) 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.

show abstract

Section: Introductionmentioning

confidence: 99%