A New Secret Sharing Scheme Based on Polynomials over Finite Fields

Çalkavur, Selda; Solé, Patrick; Bonnecaze, Alexis

doi:10.3390/math8081200

Cited by 6 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Li et al 26 obtained efficient multi-secret sharing schemes using Room squares based on irreducible BIBD. Çalkavur et al 27 proposed a secret sharing scheme based on polynomials over finite fields.…”

Section: Related Workmentioning

confidence: 99%

Perfect secret sharing schemes from combinatorial squares

Saurabh

Sinha

2022

Security and Privacy

View full text Add to dashboard Cite

Chaudhry et al. proposed perfect secret sharing schemes from combinatorial squares called Room squares based on certain balanced incomplete block designs. Their protocol is efficient and secure but it is based on a Room square of order r which exists if and only if r is odd and r ≠ 3, 5. Here, we have proposed the schemes from Room squares based on group divisible designs which are a broader class of designs.

show abstract

Section: Related Workmentioning

confidence: 99%

Perfect secret sharing schemes from combinatorial squares

Saurabh

Sinha

2022

Security and Privacy

View full text Add to dashboard Cite

show abstract

“…The reader is referred to [3] for an introduction to secret sharing. See also survey [4] and papers [5] - [12] for some secret sharing schemes.…”

Section: Introductionmentioning

confidence: 99%

Multiparty secret sharing based on hidden multipliers

Roman'kov

2021

Preprint

View full text Add to dashboard Cite

Secret sharing schemes based on the idea of hidden multipliers in encryption are proposed. As a platform, one can use both multiplicative groups of finite fields and groups of invertible elements of commutative rings, in particular, multiplicative groups of residue rings. We propose two versions of the secret sharing scheme and a version of (k, n)-thrested scheme. For a given n, the dealer can choose any k. The main feature of the proposed schemes is that the shares of secrets are distributed once and can be used multiple times. This property distinguishes the proposed schemes from the secret sharing schemes known in the literature. The proposed schemes are semantically secure. The same message can be transmitted in different forms. From the transferred secret c it is impossible to determine which of the two given secrets m 1 or m 2 was transferred. For concreteness, we give some numerical examples.

show abstract