Results 271 to 280 of about 5,063 (296)

Secret Sharing Scheme with Fairness

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, 2011
In the setting of secret sharing, one desirable property is fairness, which guarantees that if there is a player getting the secret in the recovery phase, then each player participating to the reconstruction process does too. In this paper we study the fairness problem of secret reconstruction in a secret sharing scheme.
Youliang Tian, Jianfeng Ma 0001, Changgen Peng, Jianming Zhu 0002   +3 more
openaire   +1 more source

A nonlinear secret sharing scheme

1996
In this paper, we have described a nonlinear secret-sharing scheme for n parties such that any set of k−1 or more shares can determine the secret, any set of less than k−1 shares might give information about the secret, but it is computationally hard to extract information about the secret.
Renvall, A., Ding, Cunsheng
openaire   +1 more source

Nonperfect secret sharing schemes

1993
A nonperfect secret sharing scheme (NSS) consists of a family of access subsets Γ1, a family of semi-access subsets Γ2 and a family of non-access subsets Γ3. In an NSS, it is possible that ¦Vi¦
Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii   +2 more
openaire   +1 more source

On Multiplicative Secret Sharing Schemes

2000
As known, multiplicative secret sharing schemes over Abelian groups play an important role in threshold cryptography, such as in threshold RSA signature schemes. In this paper we present a new approach for constructing multiplicative threshold schemes over finite Abelian groups, which generalises a scheme proposed by Blackburn, Burmester, Desmedt and ...
Huaxiong Wang, Kwok-Yan Lam, Guozhen Xiao, Huanhui Zhao   +3 more
openaire   +1 more source

An explication of secret sharing schemes

Designs, Codes and Cryptography, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Secret sharing schemes on graphs

Studia Scientiarum Mathematicarum Hungarica, 2007
Given a graph G , a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G , the participants , so that a subset of participants can recover the secret if they contain an edge of G , otherwise they can obtain no information regarding the key.
openaire   +2 more sources

Secret sharing schemes with veto capabilities

1994
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secret.
BLUNDO, Carlo, DE SANTIS, Alfredo, GARGANO, Luisa, VACCARO, Ugo   +3 more
openaire   +2 more sources

Partial Secret Sharing Schemes

IEEE Transactions on Information Theory, 2023
Amir Jafari, Shahram Khazaei
openaire   +2 more sources

A Linear Construction of Secret Sharing Schemes

Designs, Codes and Cryptography, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

General secret sharing scheme

Computer Communications, 1999
Kaijun Tan, Hongwen Zhu
openaire   +1 more source