Results 231 to 240 of about 4,019 (261)

On constructing secret sharing schemes

Proceedings of INFOCOM '94 Conference on Computer Communications, 2002
A secret sharing scheme is a method which allows a secret to be shared among a finite set of participants in such a way that only qualified subsets of participants can recover it. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information about the secret.
Shiuh-Pyng Shieh, Hung-Min Sun
openaire   +1 more source

A compression scheme of secret sharing

2013 International Symposium on Intelligent Signal Processing and Communication Systems, 2013
A secret sharing is a scheme to protect the data for security, in which the source data is divided into n shares and the source data is reconstructed from any k shares but no knowledge of the source data is not revealed from k - 1 shares. This algorithm is called (k, n) threshold scheme. In this study, we propose a scheme to compress the data of the (2,
Shoichiro Yamasaki, Tomoko K. Matsushima
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

Ideal Secret Sharing Schemes with Multiple Secrets

Journal of Cryptology, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jackson, W.A., Martin, K., O'Keefe, C.
openaire   +3 more sources

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

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

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

Ideal Secret Sharing Schemes with Share Selectability

2011
In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret.
Keita Emura, Atsuko Miyaji, Akito Nomura, Mohammad Shahriar Rahman, Masakazu Soshi   +4 more
openaire   +1 more source

Partial Secret Sharing Schemes

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