Results 171 to 180 of about 27,687 (204)

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

Probability of shares in secret sharing schemes

Information Processing Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo, DE SANTIS, Alfredo, GIORGIO GAGGIA A.   +2 more
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

Improvement of Communication Traffic and Security of Proactive Secret Sharing Schemes and Combination Proactive Secret Sharing Scheme with an Asymmetric Secret Sharing Scheme

2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA), 2017
An asymmetric secret sharing scheme (A-SSS) can set the number of data servers that hold shares to less than k because it can generate up to k – 1 shares from one key of the secret's owner. Therefore, the secret is not revealed even if all the data servers are attacked.
Naoto Kaneko, Keiichi Iwamura
openaire   +1 more source

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