Ideal Perfect Multilevel Threshold Secret Sharing Scheme

Lin, Changlu; Harn, Lein; Ye, Dingfeng

doi:10.1109/ias.2009.279

Cited by 23 publications

(13 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shamir's secret sharing scheme is called a perfect scheme simply because the size of the produced shares is exactly the same regardless of the number of the participant servers [1]. This perfect scheme has been used extensively by many researchers to produce various security approaches [2][3][4]. As a matter of fact, Kurihara et.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Persistent Data Security in Public Clouds

Ahrache¹,

Badir²,

Sbihi³

2016

IJCA

View full text Add to dashboard Cite

Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user's convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k,n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. However, a limitation of these methods is that first they do not consider long term data storage and second they assume that data tempering only occurs at retrieval time, after the distribution of the shares has been correctly done. In this paper these two problems are addressed by presenting a novel scheme to ensure a perpetual secure data storage and retrieval.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Lin, C et. al [4] made two modifications to Shamir's scheme; the first adjustments consists of allowing the servers to store their share as well as the (x,y) coordinates, while the second adjustment consists of using a polynomial of degree higher than the threshold to generate data shares. Ito, M. et.…”

Section: Related Workmentioning

confidence: 99%

Persistent Data Security in Public Clouds

Ahrache¹,

Badir²,

Sbihi³

2016

IJCA

View full text Add to dashboard Cite

show abstract

“…Tassa and Lin et al . proposed their hierarchical secret‐sharing schemes with conjunctive access structure. In their schemes, if the SKR starts from any lower l th level of the hierarchical structure, at least one participant from each upper level must participate in the SKR process.…”

Section: Related Workmentioning

confidence: 99%

“…The existing hierarchical secret‐sharing schemes (e.g. ) have been proposed efficiently. Though these schemes are unconditionally secured, they cannot prevent cheating or malicious attacks from different types of adversaries particularly when the shares are transmitted through wireless unsecured medium.…”

Section: Introductionmentioning

confidence: 99%

Secured hierarchical secret sharing using ECC based signcryption

Basu

Sengupta

Sing

2011

Security Comm Networks

View full text Add to dashboard Cite

Most of the existing hierarchical secret-sharing schemes are unconditionally (non-cryptographically) secured, and they cannot survive from various types of attacks especially when the participants use resource-constrained wireless mobile devices. In our proposed secured hierarchical secret-sharing scheme, the participants are partitioned into different levels according to their ranks in any organization. In this hierarchy-based secret-sharing scheme, the trusted dealer distributes the delegated secret keys as shares to the participants through our proposed signcryption scheme that reduces computational cost and communication overhead. Again, the participants submit the signcrypted shares to the trusted dealer for reconstruction of the secret key. The proposed scheme distinguishes each level of hierarchy qualitatively, and any type of active or passive adversary or colluding participants cannot reconstruct the secret key. The novelty of our scheme is that it is conditionally (cryptographically) as well as unconditionally secured, and the participants may use resource-constrained wireless mobile devices. The access structure chosen for our scheme increases the resilience of our scheme. Our proposed scheme is perfect and ideal.

show abstract

“…In hierarchical threshold secret sharing schemes , the secret is shared among a set of participants

scriptU = {P_{1}, P_{2}, \dots, P_{n}}

who are divided into m hierarchical non‐overlapping subsets (i.e.,

scriptU = \cup_{i = 1}^{m} {scriptU}_{i}

and

{scriptU}_{i} \cap {scriptU}_{j} = \emptyset

where i ≠ j ) in such a way that the players in

{scriptU}_{i}

have more authority to recover the secret than those in

{scriptU}_{j}

for 1⩽ j < i ⩽ m . Disjunctive hierarchical threshold secret sharing is one of the important types of hierarchical threshold secret sharing in which the access structure is determined by a strictly decreasing sequence of threshold parameters t 1 > t 2 > ⋯ > t m . In a disjunctive hierarchical threshold secret sharing scheme, a subset of participants A is authorized if there exists some 0⩽ j ⩽ m − 1 such that

(||, A \cap ((), \cup_{i = 0}^{j} {scriptU}_{m - i})) ⩾ t_{m - j}

.…”

Section: Introductionmentioning

confidence: 99%

Ideal social secret sharing using Birkhoff interpolation method

Eslami

Pakniat

Nojoumian

2016

Security Comm Networks

View full text Add to dashboard Cite

The concept of social secret sharing was introduced in 2010 by Nojoumian et al. In the scheme of Nojoumian et al. (called SSS), the number of shares allocated to each party depends on the player's reputation and the way he interacts with other parties. In other words, weights of the players are periodically adjusted such that cooperative participants receive more shares compared with non‐cooperative parties. As our contribution, we propose an ideal social secret sharing in which the size of each player's share is equal to the size of the secret. This property will be achieved using hierarchical threshold secret sharing. We show that the proposed scheme is secure in a passive adversary model. Compared with SSS, our proposed scheme is more efficient in terms of the share size, communication complexity, and computational complexity of the “sharing” protocol. However, the “social tuning” and “reconstruction” protocols of SSS are computationally more efficient than those of the proposed scheme. Depending on the number of execution of social tuning protocol, this might be a reasonable compromise because the reconstruction protocol is executed only once throughout the secret's lifetime. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Ideal Perfect Multilevel Threshold Secret Sharing Scheme

Cited by 23 publications

References 8 publications

Persistent Data Security in Public Clouds

Persistent Data Security in Public Clouds

Secured hierarchical secret sharing using ECC based signcryption

Ideal social secret sharing using Birkhoff interpolation method

Contact Info

Product

Resources

About