Results 261 to 270 of about 5,063 (296)
Some of the next articles are maybe not open access.
Probability of shares in secret sharing schemes
Information Processing Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +2 more
openaire +2 more sources
Proactive secret sharing scheme suitable for asymmetric secret sharing scheme
2016 IEEE 5th Global Conference on Consumer Electronics, 2016An 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, 2008A 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
On Abelian and Homomorphic Secret Sharing Schemes
Journal of Cryptology, 2021zbMATH 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 +2 more
openaire +2 more sources
A generalized secret sharing scheme
Journal of Systems and Software, 1997In 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, 2018AbstractA 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 +3 more
openaire +2 more sources
A Resistant Secret Sharing Scheme
2009 Fifth International Conference on Information Assurance and Security, 2009In 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 +2 more
openaire +1 more source
A compression scheme of secret sharing
2013 International Symposium on Intelligent Signal Processing and Communication Systems, 2013A 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
2011We 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 +5 more
openaire +1 more source