Sequential Secret Sharing Scheme Based on Level Ordered Access Structure (original) (raw)
Related papers
Sequential (t,n) multi secret sharing scheme for level-ordered access structure
International Journal of Information Technology, 2018
A new access structure called the Level ordered Access Structure (LoAS) is introduced in Pattipati et al. (IJ Netw Secur 18(5):874-881, 2016) and proposed a sequential secret sharing scheme that realises this access structure. This is similar to multilevel access structure but enforces ordering among levels while reconstructing the secret. In this paper, we extended a secret sharing scheme for multiple secrets to realise LoAS. The construction uses public key primitives with Lagrange interpolation. In this scheme, multiple secrets are distributed one each among the levels. The scheme uses the concepts of quadratic residues and discrete logarithm problem. Reconstruction of the secrets is such that participants of different levels find their respective level secrets only after they get their immediate higher level permission. The novelty of the scheme is that, it achieves ordering concept. Performance and security analysis of the scheme is also discussed.
Multi-stage Multi-secret Sharing Scheme for Hierarchical Access Structure
—Hierarchical threshold secret sharing (HTSS) schemes can be thought as a generalization of classical threshold secret sharing schemes, and they have been extensively in the literature. In an HTSS, participants are classified into different security levels, and the threshold value of a higher level is smaller than that of a lower level. Participants in each level can recover the secrets, if the number of shares is equal to or more than the corresponding threshold value. Share of a higher level participant can be used to reconstruct the secret at lower level. In this paper, we proposed first hierarchical threshold multi-secret sharing scheme based on polynomial interpolation. Proposed scheme is a variation to HTSS schemes based on the CRT suggested by Singh et al. and Harn et al. Novelty of the proposed scheme is that each participant requires to keep only one secret share and multiple secrets can be shared separately without refreshing the secret share. Also, secrets are recovered in stage by stage. Our scheme which is unconditionally secure, is based on Lagrange interpolation polynomial and one-way function.
An Explication of Secret Sharing Schemes with General Access Structure
2013
The basic idea in secret sharing is to divide the secret key into pieces, also called as ‘shares ’ and distribute the pieces to different persons so that certain subsets of the persons can get together to recover the key. In the outline of threshold schemes, we wanted k out of n participants to be able to determine the key. In practice, it is often needed that only certain specified subsets of the participants should be able to recover the secret. A more general situation is to specify exactly which subsets of participants should be able to determine the key and those that should not. The Access structure describes all the authorized subsets to design the access structure with required capabilities. The goal of the general access structure secret sharing scheme is to provide the flexibility to decide which specified subsets of participants will able to reconstruct the original secret and which subsets cannot. The intent of this paper is to provide an analysis of some existing Genera...
An ideal hierarchical secret sharing scheme
ArXiv, 2020
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only predefined subsets of participants can recover the secret after collaborating with their secret shares. The construction of secret sharing schemes has received a considerable attention of many searchers whose main goal was to improve the information rate. In this paper, we propose a novel construction of a secret sharing scheme which is based on the hierarchical concept of companies illustrated through its organization chart and represented by a tree. We proof that the proposed scheme is ideal by showing that the information rate equals 1. In order to show the efficiency of the proposed scheme, we discuss all possible kinds of attacks and proof that the security in ensured. Finally, we include a detailed didactic example for a small company organization ch...
Redistributing secret shares to new access structures and its applications
1997
Abstract Proactive secret sharing deals with refreshing secret shares, ie, redistributing the shares of a secret to the original access structure. In this paper we focus on the general problem of redistributing shares of a secret key. Shares of a secret have been distributed such that access sets speci ed in the access structure?(eg, t-out-of-l) can access (or use) the secret. The problem is how to redistribute the secret, without recovering it, in such a way that those speci ed in the new access structure? 0 will be able to recover the secret.
IET Information Security, 2021
Multilevel and compartmented access structures are two important classes of access structures where participants are grouped into levels/compartments with different degrees of trust and privileges. The construction of secret sharing schemes for such access structures has been the attention of researchers for a long time. Two main approaches have been taken so far, one of them is based on polynomial interpolation and the other one is based on the Chinese Remainder Theorem (CRT). In this article the first asymptotically ideal CRT-based secret sharing schemes for (disjunctive, conjunctive) multilevel and compartmented access structures are proposed. Our approach is compositional and it is based on a variant of the Asmuth-Bloom secret sharing scheme where some participants may have public shares. Based on this, the proposed secret sharing schemes for multilevel and compartmented access structures are asymptotically ideal if and only if they are based on 1-compact sequences of co-primes. Possible applications for secret image and multi-secret sharing are pointed-out. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.
Sequential Secret Sharing Scheme Based on Chinese Remainder Theorem
Multilevel Sequential secret sharing scheme is a composition of multilevel threshold secret sharing and multistage multi-secrets sharing scheme. In this scheme, shareholders are partitioned into multiple subsets. Each subset will have multi-secrets. Shareholders in each subset could reconstruct many secrets in the consecutive stage if t or more number of shares are available. In addition, a lower level subset can use higher level subset shares to reconstruct the secret. Verification is provided to detect cheating in the proposed scheme.This scheme is unconditionally secure and it is efficient. keywords: Asmuth Bloom's sequence, Chinese remainder Theorem, Multilevel threshold secret sharing, Multi-stage multi-secret sharing scheme.
On construction of cumulative secret sharing schemes
Lecture Notes in Computer Science, 1998
Secret sharing schemes are one of the most important primitives in distributed systems. Cumulative secret sharing schemes provide a method to share a secret with arbitrary access structures. This paper presents two di erent methods for constructing cumulative secret sharing schemes. First method produces a simple and e cient cumulative scheme. The second method, however, provides a cheater identi able cumulative scheme. The both proposed schemes are perfect.
On Key Assignment for Hierarchical Access Control
19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006
A key assignment scheme is a cryptographic technique for implementing an information flow policy, sometimes known as hierarchical access control. All the research to date on key assignment schemes has focused on particular encryption techniques rather than an analysis of what features are required of such a scheme. To remedy this we propose a family of generic key assignment schemes and compare their respective advantages. We note that every scheme in the literature is simply an instance of one of our generic schemes. We then conduct an analysis of the Akl-Taylor scheme and propose a number of improvements. We also demonstrate that many of the criticisms that have been made of this scheme in respect of key udpates are unfounded. Finally, exploiting the deeper understanding we have acquired of key assignment schemes, we introduce a technique for exploiting the respective advantages of different schemes.