Results 11 to 20 of about 5,063 (296)
Boolean-Based (k, n, m) Multi-Secret Image Sharing
Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property.
Chien-Chang Chen +2 more
doaj +2 more sources
Comparing Security Notions of Secret Sharing Schemes
Different security notions of secret sharing schemes have been proposed by different information measures. Entropies, such as Shannon entropy and min entropy, are frequently used in the setting security notions for secret sharing schemes.
Songsong Dai, Donghui Guo
doaj +2 more sources
Anonymous secret sharing schemes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlo Blundo, Douglas R. Stinson
openaire +3 more sources
Universally ideal secret-sharing schemes [PDF]
Summary: Given a set of parties \(\{1, \dots, n\}\), an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret-sharing scheme for an access structure is a method for a dealer to distribute shares to the parties.
Amos Beimel, Benny Chor
openaire +4 more sources
Ideal Hierarchical Secret Sharing Schemes [PDF]
Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention since the invention of secret sharing until nowadays. Several constructions of ideal hierarchical secret sharing schemes have been proposed, but it was not known what access structures admit such a scheme.
Oriol Farràs, Carles Padró
openaire +8 more sources
Secret Sharing-Based IoT Text Data Outsourcing: A Secure and Efficient Scheme [PDF]
Secret Sharing has been recently used as an alternative approach to solve privacy-preserving issues in cloud-based data outsourcing, for overcoming the challenges faced when encryption-based methods are adopted.
Zhaohui Tang
doaj +2 more sources
Fully dynamic secret sharing schemes [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlo Blundo +3 more
openaire +3 more sources
Secret sharing schemes for ports of matroids of rank 3 [PDF]
summary:A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid.
Oriol Farràs, Farràs, Oriol
core +1 more source
On Proactive Secret Sharing Schemes [PDF]
This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restriction to the adversary. We first investigate the approach of using commitment to 0 in the renewal phase in order to renew the player’s shares.
Nikov, V.S., Nikova, S.I.
openaire +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

