General secret sharing scheme

Tan, K. J.; Zhu, Haojin

doi:10.1016/s0140-3664(99)00041-9

Cited by 13 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A general access secret sharing scheme allows mapping every possible subgroup of shareholders into the access structure. Multiple schemes, like those presented in [5,6,8,10,25] improve the efficiency by reducing the number of shares or the size of each share.…”

Section: General Access Secret Sharing Schemesmentioning

confidence: 99%

Crucial and Redundant Shares and Compartments in Secret Sharing

Schillinger¹,

Schindelhauer²

2019

Preprint

View full text Add to dashboard Cite

Secret sharing is the well-known problem of splitting a secret into multiple shares, which are distributed to shareholders. When enough or the correct combination of shareholders work together the secret can be restored. We introduce two new types of shares to the secret sharing scheme of Shamir. Crucial shares are always needed for the reconstruction of the secret, whereas mutual redundant shares only help once in reconstructing the secret. Further, we extend the idea of crucial and redundant shares to a compartmented secret sharing scheme. The scheme, which is based on Shamir's, allows distributing the secret to different compartments, that hold shareholders themselves. In each compartment, another secret sharing scheme can be applied. Using the modifications the overall complexity of general access structures realized through compartmented secret sharing schemes can be reduced. This improves the computational complexity. Also, the number of shares can be reduced and some complex access structures can be realized with ideal amount and size of shares.

show abstract

Section: General Access Secret Sharing Schemesmentioning

confidence: 99%

Crucial and Redundant Shares and Compartments in Secret Sharing

Schillinger¹,

Schindelhauer²

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…A PSS scheme divides the lifetime of a service into a series of time periods: T (0) , T (1) , T (2) , … , where T is the interval between any two consecutive executions of the share update protocol. Since all servers hold new shares after the execution of share update protocol, the adversary is forced to re-initiate his attack.…”

Section: B Evaluation Model Of Pss Cryptosystemmentioning

confidence: 99%

“…Shamir [1] addressed this problem in 1979 respectively when he introduced the concept of threshold scheme. From then on, many research literatures have been published [2][3][4] in terms of the different kinds of scenario. Instead of storing the secret at one server, a (k, n) secret sharing scheme divides the secret into n shares in such a way that the secret can be reconstructed only from k or more shares, k is called threshold of the scheme.…”

Section: Introductionmentioning

confidence: 99%

Security evaluation of proactive secret sharing cryptosystem

Ting-jun

2009

2009 ISECS International Colloquium on Computing, Communication, Control, and Management

View full text Add to dashboard Cite

The proactive secret sharing (PSS) scheme divides the lifetime of a secret into a series of time periods, in which the shares are periodically updated without changing the secret. This paper proposes a practical method for evaluating and analyzing the security of PSS cryptosystem. Based on the response of server to the mobile attack, we apply the stochastic modeling techniques to depict the state transition of PSS cryptosystem, transferring from secure states to the compromised states. With the relationship of security to the threshold, the time period and the intrusion rate, an evaluation of security is obtained. The simulation figures show that the method is practical and applicable.

show abstract

“…Shamir's approach is based upon the polynomial interpolation in a two-dimensional space, while Blakley's scheme originates from the intersections of some high-dimensional planes in a high-dimensional space. Shamir's scheme is simple and easy to implement so that it has attracted many researchers' attention [3,4,9,11,16]. Consider an r−1 degree polynomial:…”

Section: Introductionmentioning

confidence: 99%

Weighted Threshold Secret Image Sharing

Shyu

Chuang

Chen

et al. 2009

Advances in Image and Video Technology

View full text Add to dashboard Cite

Given a secret image I, a threshold r, and a set of n (≥ r) participants P = {1, 2, … , n} with a set of weights W = {w 1 , w 2 , … , w n } where w i is the weight (which indicates the degree/rank of importance) of participant i and we assume that w 1 ≤ w 2 ≤ … ≤ w n. The idea of weighted threshold secret image sharing encodes I into n shadows S 1 , S 2 , … , S n with sizes |S 1 | ≤ |S 2 | ≤ … ≤ |S n | in which S i is distributed to participant i such that only when a group of r participants can reconstruct I by using their shadows, while any group of less than r participants cannot. We propose a novel weighted threshold secret image sharing scheme based upon Chinese remainder theorem in this paper. As compared to the conventional Shamir's and recent Thien-Lin's schemes, which produce shadows with the same size, our scheme is more flexible due to the reason that the dealer is able to distribute various-sized shadows to participants with different degrees/ranks of importance in terms of practical concerns.

show abstract

General secret sharing scheme

Cited by 13 publications

References 6 publications

Crucial and Redundant Shares and Compartments in Secret Sharing

Crucial and Redundant Shares and Compartments in Secret Sharing

Security evaluation of proactive secret sharing cryptosystem

Weighted Threshold Secret Image Sharing

Contact Info

Product

Resources

About