Results 21 to 30 of about 3,995 (261)
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
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 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
Hierarchical secret sharing scheme for WSN based on linear homogeneous recurrence relations
International Journal of Distributed Sensor Networks, 2022 Wireless sensor network is a key technology in the sensing layer of the Internet of Things. Data security in wireless sensor network is directly related to the authenticity and validity of data transmitted in the Internet of Things.
Yan Lin +3 more
doaj +1 more source
Robust Secret Image Sharing Scheme Against Noise in Shadow Images
IEEE Access, 2021 The (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image.
Yuyuan Sun +4 more
doaj +1 more source
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
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
Multi-Secret Sharing Schemes [PDF]
, 1994 A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s1,..., sm among a set of participants P. In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures.
Carlo Blundo +4 more
openaire +1 more source
On the Information Rate of Secret Sharing Schemes [PDF]
Theoretical Computer Science, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BLUNDO, Carlo +3 more
openaire +3 more sources
Study of Free‐Space Optical Quantum Network: Review and Prospectives
Advanced Science, EarlyView.Free from the constraints of fiber connections, free‐space quantum network enables longer and more flexible quantum network connections. This review summarizes and comparatively analyzes free‐space quantum network experiments based on ground stations, satellites, and mobile platforms.
Hua‐Ying Liu, Zhenda Xie, Shining Zhu
wiley +1 more source