Results 201 to 210 of about 904 (216)

A Novel Encoding Method for Ideal Contrast Visual Secret Sharing Schemes with Reversing

2008 International Conference on Computer Science and Software Engineering, 2008
In visual secret sharing (VSS) schemes, a secret image can be visually revealed by overlapping shares. But the contrast of reconstructed image is much lost. A useful way to improve this situation is to employ reversing, a non-cryptographic operation supported by most copy machines, to reverse black and white pixels.
Haibo Zhang, Xiaofei Wang, Youpeng Huang
openaire   +1 more source

Ideal secret sharing schemes with multipartite access structures

IEE Proceedings - Communications, 2006
The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have
openaire   +1 more source

Ideal Secure Multi-Secret Visual Cryptography Scheme with Ring Shares

2014
With visual cryptography in mind, the security property of a new scheme is always one of main concerns. However, the ideal security is not taken into account in some visual cryptography schemes sharing multiple secrets. In this paper, the security of a multi-secret visual cryptography scheme proposed by Feng et al. is analyzed.
Zhengxin Fu, Bin Yu 0003
openaire   +1 more source

A new ideal secret sharing scheme based on a tree

Journal of Discrete Mathematical Sciences and Cryptography, 2021
Ghanem Meriem, Sadek Bouroubi
openaire   +1 more source

AN IDEAL MULTI-SECRET SHARING SCHEME BASED ON MSP

Quantitative Logic and Soft Computing, 2012
Zan Hei, Zhi-Hui Li 0006, Xingxing Wu
openaire   +1 more source

Ideal Hierarchical Secret Sharing Schemes

IEEE Transactions on Information Theory, 2012
Oriol Farras, Carles Padró
exaly  

Ideal Multipartite Secret Sharing Schemes

Journal of Cryptology, 2011
Jaume Martí-Farré, Oriol Farras, Carles Padró   +2 more
exaly  

Ways to merge two secret sharing schemes

IET Information Security, 2020
Arkadii Slinko
exaly  

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets

Designs, Codes, and Cryptography, 2005
Jaume Martí-Farré, Carles Padró, Padró Carles   +2 more
exaly  

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Designs, Codes, and Cryptography, 2009
Jaume Martí-Farré, Carles Padró, Padró Carles   +2 more
exaly