Results 291 to 300 of about 112,314 (333)

On secret sharing schemes

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo, DE SANTIS, Alfredo, VACCARO, Ugo   +2 more
openaire   +2 more sources

Proactive secret sharing scheme suitable for asymmetric secret sharing scheme

2016 IEEE 5th Global Conference on Consumer Electronics, 2016
An asymmetric secret sharing scheme (A-SSS) can set the number of servers at less than k, because it makes up to k-1 shares from one key of the owner of the secret. Therefore, the secret is not revealed even if all the servers are attacked. However, when the owner's key is stolen and attacked, shares may be leaked. Therefore, in this paper we propose a
Naoto Kaneko, Keiichi Iwamura
openaire   +1 more source

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

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

A Molecular Secret Sharing Scheme

Angewandte Chemie, 2018
AbstractA method for implementing a secret sharing scheme at the molecular level is presented. By creating molecular code generators that are self‐assembled from several molecular components, we established a means for distributing distinct code‐activating elements among several participants.
Omer Lustgarten, Raanan Carmieli, Leila Motiei, David Margulies   +3 more
openaire   +2 more sources

Secret Sharing Schemes

2015
Suppose you have a secret s which you wish to share amongst a set P of n parties. You would like certain subsets of the n parties to recover the secret but not others. The classic scenario might be that s is a nuclear launch code and you have four people, the president, the vice-president, the secretary of state and a general in a missile silo.
openaire   +1 more source

New Colored Visual Secret Sharing Schemes

Designs, Codes and Cryptography, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Ching-Nung, Laih, Chi-Sung
openaire   +1 more source

Efficient Secret Sharing Schemes

2011
We propose a new XOR-based (k,n) threshold secret SSS, where the secret is a binary string and only XOR operations are used to make shares and recover the secret. Moreover, it is easy to extend our scheme to a multi-secret sharing scheme. When k is closer to n, the computation costs are much lower than existing XOR-based schemes in both distribution ...
Chunli Lv, Xiaoqi Jia, Jingqiang Lin, Jiwu Jing, Lijun Tian, Mingli Sun   +5 more
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

Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes

2019 IEEE Information Theory Workshop (ITW), 2019
A secret sharing scheme (SSS) is a cryptographic tool to protect a secret from loss and leakage by dividing it into shares. A ramp SSS can improve the efficiency in terms of the sizes of shares by allowing partial information about the secret to leak out.
Reo Eriguchi, Noboru Kunihiro
openaire   +1 more source