Results 1 to 10 of about 899 (216)

Ideal composite modular secret sharing schemes

Automatic Control and Computer Sciences, 2015
The paper deals with modular secret sharing schemes for certain non-threshold access structures. It is shown that based on compositions of ideal threshold modular schemes it is possible to build an ideal scheme for compartment access structures, as well as some of the more common structures, which were called composite.
openaire   +1 more source

Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes

2019 IEEE International Symposium on Information Theory (ISIT), 2019
A multiple assignment scheme (MAS) is a method to construct secret sharing schemes (SSSs) for general access structures. There are MASs using threshold and ramp SSSs. The paper proposes new MASs using ideal SSSs realizing compartmented access structures and those using SSSs realizing multi-level access structures.
Reo Eriguchi, Noboru Kunihiro, Mitsugu Iwamoto   +2 more
openaire   +1 more source

ESEC: An Ideal Secret Sharing Scheme

2014
Secret sharing techniques have been used to ensure data confidentiality and enable secure reconstruction of data. In this paper, we propose a novel secret sharing scheme called ESEC based on Elliptic Curve Cryptography (ECC). The proposed scheme is to distribute a secret to a non-intersecting group of participants with different privilege levels.
Greeshma Sarath, S. Deepu, Sudharsan Sundararajan, Krishnashree Achuthan   +3 more
openaire   +1 more source

Efficient Ideal Threshold Secret Sharing Schemes Based on EXCLUSIVE-OR Operations

2010 Fourth International Conference on Network and System Security, 2010
Most of secret sharing schemes have to be computed in a Galois field, such as Shamir’s scheme, which have relatively heavy computational cost. Kurihara et al. [1] recently proposed a fast secret sharing scheme using only Exclusive-OR(XOR) operations to make shares and recover the secret.
Chunli Lv, Xiaoqi Jia, Lijun Tian, Jiwu Jing, Mingli Sun   +4 more
openaire   +1 more source

Classification of Universally Ideal Homomorphic Secret Sharing Schemes and Ideal Black-Box Secret Sharing Schemes

2005
A secret sharing scheme (SSS) is homomorphic, if the products of shares of secrets are shares of the product of secrets. For a finite abelian group G, an access structure ${\mathcal A}$ is G-ideal homomorphic, if there exists an ideal homomorphic SSS realizing the access structure ${\mathcal A}$ over the secret domain G.
openaire   +1 more source

On ideal non-perfect secret sharing schemes

1998
This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Kurosawa's lower bound [12] into a more precise information-theoretic characterization of non-perfect secret sharing idealness. We establish that in the light of this generalization. ideal
openaire   +1 more source

Ideal homomorphic secret sharing schemes over cyclic groups

Science in China Series E: Technological Sciences, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Mulan, Zhou, Zhanfei
openaire   +1 more source

A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme

Information Processing Letters, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ţiplea, Ferucio Laurenţiu, Drăgan, Constantin Cătălin   +1 more
openaire   +2 more sources

Not all perfect extrinsic secret sharing schemes are ideal [PDF]

Australas. J Comb., 1990
Summary: We construct a perfect extrinsic secret sharing scheme for any case in which a set of participants can gain access to the secret if and only if the set contains a pair of members from some given list of pairs.
openaire   +1 more source

Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem

2018
Since (t, n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and Bloom presented a (t, n)-threshold SS scheme based on the Chinese Remainder Theorem (CRT) for integers in 1983.
Yu Ning, Fuyou Miao 0001, Wenchao Huang 0001, Keju Meng, Yan Xiong 0001, Xingfu Wang   +5 more
openaire   +2 more sources