Results 21 to 30 of about 899 (216)
Some Multisecret-Sharing Schemes over Finite Fields
A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot.
Selda Çalkavur, Patrick Solé
doaj +1 more source
An ideal hierarchical secret sharing scheme
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only predefined subsets of participants can recover the secret after collaborating with their secret shares. The construction of
Ghanem Meriem, Bouroubi Sadek
openaire +2 more sources
Characterisations of Ideal Threshold Schemes [PDF]
We characterise ideal threshold schemes from different approaches. Since the characteristic properties are independent to particular descriptions of threshold schemes all ideal threshold schemes can be examined by new points of view and new results on ...
Josef Pieprzyk, Xian-Mo Zhang
doaj +1 more source
Constructions of some secret sharing schemes based on linear codes [PDF]
There are perfect and ideal threshold secret sharing schemes, for example, Shamir’s secret sharing scheme. For the case of general secret sharing schemes with an arbitrary access structure, it is possible to construct a perfect scheme for any
Ratseev, Sergey Mihailovich
doaj +1 more source
Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes.
Csirmaz Laszlo
doaj +1 more source
On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constantin Catalin Dragan +1 more
openaire +3 more sources
An n-player -secure robust secret sharing scheme is a (t,n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least , from the set of all shares even if up to t players provide incorrect ...
Jhanwar Mahabir P. +1 more
doaj +1 more source
On Ideal Secret-Sharing Schemes for $k$-homogeneous access structures
19 ...
Younjin Kim, Jihye Kwon, Hyang-Sook Lee
openaire +2 more sources
Secret Sharing Limitations Over Boolean Circuits [PDF]
This paper offers a gentle introduction into the realm of monotone span programs and their connection with linear secret sharing schemes and attribute-based encryption while emphasizing the cryptographic importance of finding efficient MSPs for ...
Iulian Oleniuc, Alexandru Ioniță
doaj +1 more source
Some Ideal Secret Sharing Schemes [PDF]
Summary: In a secret sharing scheme, a dealer has a secret. The dealer gives each participant in the scheme a share of the secret. There is a set \(\Gamma\) of subsets of the participants with the property that any subset of participants that is in \(\Gamma\) can determine the secret.
openaire +2 more sources

