Results 231 to 240 of about 2,739 (260)

A Resistant Secret Sharing Scheme

2009 Fifth International Conference on Information Assurance and Security, 2009
In this paper, we proposed a novel (2, 2) secret sharing scheme applied for grayscale images. This scheme can produce two noise-like shared images that help avoid a secret image being grabbed. The construction phase of shared image consists of producing two shared images of the secret image by a (7, 4) Hamming code operation.
Chin-Chen Chang 0001, Yen-Chang Chen, Chia-Chen Lin 0001   +2 more
openaire   +1 more source

Secret Sharing Scheme with Fairness

2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, 2011
In the setting of secret sharing, one desirable property is fairness, which guarantees that if there is a player getting the secret in the recovery phase, then each player participating to the reconstruction process does too. In this paper we study the fairness problem of secret reconstruction in a secret sharing scheme.
Youliang Tian, Jianfeng Ma 0001, Changgen Peng, Jianming Zhu 0002   +3 more
openaire   +1 more source

On Multiplicative Secret Sharing Schemes

2000
As known, multiplicative secret sharing schemes over Abelian groups play an important role in threshold cryptography, such as in threshold RSA signature schemes. In this paper we present a new approach for constructing multiplicative threshold schemes over finite Abelian groups, which generalises a scheme proposed by Blackburn, Burmester, Desmedt and ...
Huaxiong Wang, Kwok-Yan Lam, Guozhen Xiao, Huanhui Zhao   +3 more
openaire   +1 more source

On constructing secret sharing schemes

Proceedings of INFOCOM '94 Conference on Computer Communications, 2002
A secret sharing scheme is a method which allows a secret to be shared among a finite set of participants in such a way that only qualified subsets of participants can recover it. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information about the secret.
Shiuh-Pyng Shieh, Hung-Min Sun
openaire   +1 more source

A compression scheme of secret sharing

2013 International Symposium on Intelligent Signal Processing and Communication Systems, 2013
A secret sharing is a scheme to protect the data for security, in which the source data is divided into n shares and the source data is reconstructed from any k shares but no knowledge of the source data is not revealed from k - 1 shares. This algorithm is called (k, n) threshold scheme. In this study, we propose a scheme to compress the data of the (2,
Shoichiro Yamasaki, Tomoko K. Matsushima
openaire   +1 more source

A nonlinear secret sharing scheme

1996
In this paper, we have described a nonlinear secret-sharing scheme for n parties such that any set of k−1 or more shares can determine the secret, any set of less than k−1 shares might give information about the secret, but it is computationally hard to extract information about the secret.
Renvall, A., Ding, Cunsheng
openaire   +1 more source

An explication of secret sharing schemes

Designs, Codes and Cryptography, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonperfect secret sharing schemes

1993
A nonperfect secret sharing scheme (NSS) consists of a family of access subsets Γ1, a family of semi-access subsets Γ2 and a family of non-access subsets Γ3. In an NSS, it is possible that ¦Vi¦
Wakaha Ogata, Kaoru Kurosawa, Shigeo Tsujii   +2 more
openaire   +1 more source

Secret sharing schemes on graphs

Studia Scientiarum Mathematicarum Hungarica, 2007
Given a graph G , a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G , the participants , so that a subset of participants can recover the secret if they contain an edge of G , otherwise they can obtain no information regarding the key.
openaire   +2 more sources

Secret sharing schemes with veto capabilities

1994
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secret.
BLUNDO, Carlo, DE SANTIS, Alfredo, GARGANO, Luisa, VACCARO, Ugo   +3 more
openaire   +2 more sources