Secret sharing - Open Access .click

Results 231 to 240 of about 12,447 (257)

Some of the next articles are maybe not open access.

1995
We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants.
openaire +1 more source

Linear Secret Sharing with Divisible Shares

1999
Shamir secret sharing is being considered in the broader context of linear secret sharing. It is shown that any Shamir scheme built over GF(q v ) can be converted into its linear equivalent defined over GF(q). A notion of uniform perfectness is introduced and it is proved that Shamir schemes built over GF(q v ) are not uniformly perfect.
openaire +1 more source

Strong (n,t,n) verifiable secret sharing scheme

Information Sciences, 2010
Changlu Lin, Lein Harn
exaly

A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing

Applied Mathematics and Computation, 2005
Yu-Min Wang
exaly

On the classification of ideal secret sharing schemes

Journal of Cryptology, 1991
Ernest F Brickell
exaly

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing