Results 81 to 90 of about 3,153 (99)
Some of the next articles are maybe not open access.
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
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, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Ching-Nung, Laih, Chi-Sung
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
Nonperfect secret sharing schemes
1993A 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 +2 more
openaire +1 more source
Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes
2019 IEEE Information Theory Workshop (ITW), 2019A 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
Strongbox secured secret sharing schemes
2000This paper studies the problem of completion of structures, given partial information, to obtain measures of how closely the behaviour of the secret sharing schemes approaches ideal behaviour in practice. One way in which combinatorial designs can be used to give conditionally perfect secret sharing schemes is presented.
Seberry, J., Street, A. P.
openaire +1 more source
A Quantum Evolving Secret Sharing Scheme
International Journal of Theoretical Physics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Secret sharing schemes with veto capabilities
1994A 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 +3 more
openaire +2 more sources
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Partial Secret Sharing Schemes
IEEE Transactions on Information Theory, 2023Amir Jafari, Shahram Khazaei
openaire +1 more source