Results 221 to 230 of about 2,739 (260)

Ideal secret sharing schemes with multiple secrets

Journal of Cryptology, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christine M O'Keefe, Keith M Martin, Wen-Ai Jackson   +2 more
exaly   +4 more sources

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

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

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

On Secret Reconstruction in Secret Sharing Schemes

IEEE Transactions on Information Theory, 2008
A secret sharing scheme typically requires secure communications in each of two distribution phases: (1) a dealer distributes shares to participants (share distribution phase); and later (2) the participants in some authorised subset send their share information to a combiner (secret reconstruction phase).
Huaxiong Wang, Duncan S. Wong
openaire   +1 more source

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

A generalized secret sharing scheme

Journal of Systems and Software, 1997
In this article, we make a cryptanalysis on Lin and Harn's generalized secret sharing scheme. And then based on their scheme, we present another method to improve their security such that the ability of preventing illegal users from reconstructing the secret can still be held, and, moreover, the conspiracy of those legal users to other users' shadows ...
Carl K. Chang, H. Tsai
openaire   +1 more source

On Abelian and Homomorphic Secret Sharing Schemes

Journal of Cryptology, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir Jafari, Shahram Khazaei
openaire   +1 more source

Compounding secret sharing schemes [PDF]

IACR Cryptol. ePrint Arch., 2003
The access structure of a secret sharing scheme on a set \({\mathcal P}\) is a monotone family \(\Gamma \subseteq 2^{\mathcal P} \) of subsets of the set \({\mathcal P}\); a threshold structure \((t,n)\) consists of all at least \(t\)-element subsets of an \(n\)-element set.
Edgar Martínez-Moro, Jorge Mozo-Fernández, Carlos Munuera   +2 more
openaire   +2 more sources

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 0001, Jiwu Jing, Lijun Tian, Mingli Sun   +5 more
openaire   +1 more source