Results 21 to 30 of about 27,687 (204)
Anonymous secret sharing schemes
Discrete Applied Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlo Blundo, Douglas R. Stinson
openaire +2 more sources
On the size of shares for secret sharing schemes [PDF]
Journal of Cryptology, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. M. Capocelli +3 more
openaire +4 more sources
A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme
Complexity, 2020 Secret sharing has been study for many years and has had a number of real-word applications. There are several methods to construct the secret-sharing schemes. One of them is based on coding theory. In this work, we construct a secret-sharing scheme that
Ping Li +5 more
doaj +1 more source
On the classification of ideal secret sharing schemes [PDF]
Journal of Cryptology, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ernest F. Brickell, Daniel M. Davenport
openaire +3 more sources
On the Optimization of Bipartite Secret Sharing Schemes [PDF]
Designs, Codes and Cryptography, 2010 Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartite access structures, in which the set of participants is divided in two parts, and all participants
Oriol Farràs +3 more
openaire +6 more sources
(t,n) multi-secret sharing scheme extended from Harn-Hsu’s scheme
EURASIP Journal on Wireless Communications and Networking, 2018 Multi-secret sharing scheme has been well studied in recent years. In most multi-secret sharing schemes, all secrets must be recovered synchronously; the shares cannot be reused any more.
Tong Zhang, Xizheng Ke, Yanxiao Liu
doaj +1 more source
On polynomial secret sharing schemes.
IACR Cryptol. ePrint Arch., 2019 Nearly all secret sharing schemes studied so far are linear or multi-linear schemes. Although these schemes allow to implement any monotone access structure, the share complexity, SC, may be suboptimal - there are access structures for which the gap between the best known lower bounds and best known multi-linear schemes is exponential. There is growing
Paskin-Cherniavsky, Anat, Artiom, Radune
openaire +4 more sources
On Secret Sharing Schemes, Matroids and Polymatroids [PDF]
Journal of Mathematical Cryptology, 2007 Abstract The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing.
Martí Farré, Jaume +1 more
openaire +7 more sources
Polarization‐Assisted Visual Secret Sharing Encryption in Metasurface Hologram
Advanced Photonics Research, 2021 Secret sharing is an advanced encryption method that distributes the secret information into multiple participants and only the predesigned subsets of authorized participants can recover the secret by gathering their independent subinformation.
Zhenfei Li +7 more
doaj +1 more source
Two-in-One Secret Image Sharing Scheme with Higher Visual Quality of the Previewed Image
Mathematics, 2022 Secret image sharing (SIS) scheme is a secret image encoding and decoding scheme that reconstructs the secret image only if the number of participants is sufficient. In contrast, inadequate participants gain no information about the secret image.
Xin Wang, Peng Li, Zihan Ren
doaj +1 more source