Results 161 to 170 of about 27,687 (204)

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

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

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

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

A Resistant Secret Sharing Scheme

2009 Fifth International Conference on Information Assurance and Security, 2009
In this paper, we proposed a novel (2, 2) secret sharing scheme applied for grayscale images. This scheme can produce two noise-like shared images that help avoid a secret image being grabbed. The construction phase of shared image consists of producing two shared images of the secret image by a (7, 4) Hamming code operation.
Chin-Chen Chang 0001, Yen-Chang Chen, Chia-Chen Lin 0001   +2 more
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

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

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

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 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