Appala Naidu Tentu

Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes

An ideal conjunctive hierarchical secret sharing scheme, constructed based on the Maximum Distance Separable (MDS) codes, is proposed in this paper. The scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorized set can always reconstruct the secret in polynomial time whereas for an unauthorized set this is computationally hard. Also, in our scheme, the size of the ground field is independent of the parameters of the access structure. Further, it is efficient and requires O(n 3), where n is the number of participants.

Multi-Stage Multi-Secret Sharing Schemes Based on Chinese Remainder Theorem

One secret sharing scheme that uses the Mignottes sequence and another secret sharing scheme that uses the Asmuth-Bloom sequence are proposed in this paper. Both the secret sharing schemes are based on the Chinese Remainder Theorem (CRT). Novelty of the two proposed schemes is that the shares of the participants are reusable i.e. same shares are applicable even with a new secret. Also only one share needs to be kept by each participant even for the muslti-secret sharing scheme. Further, the schemes are capable of verifying the honesty of the participants including the dealer. Correctness of the proposed schemes is discussed and show that the proposed schemes are computationally secure.

Computationally perfect compartmented secret sharing schemes based on MDS codes

Two compartmented secret sharing schemes are proposed in this paper. Constructions of the proposed schemes are based on the maximum distance separable (MDS) codes. One of the proposed schemes is perfect in classical sense and the other scheme, what we call, is computationally perfect. By computationally perfect, we mean, an authorised set can always reconstruct the secret in polynomial time whereas for an unauthorised set this is computationally hard. This is in contrast to some of the existing schemes in the literature, in which an authorised set can recover the secret only with certain probability. Also, in our schemes unlike in some of the existing schemes, the size of the ground field need not be extremely large. One of the proposed schemes is shown to be ideal and the information rate for the other scheme is 1/2. Both the schemes are efficient and require O ( mn 3 ), where n is the number of participants and m is the number of compartments.

Computationally Perfect Secret Sharing Scheme Based on Error-Correcting Codes

In this paper, we propose a secret sharing scheme for compartmented access structure with lower bounds. Construction of the scheme is based on the Maximum Distance Separable (MDS) codes. The proposed scheme is ideal and computationally perfect. By computationally perfect, we mean, an authorized set can always reconstruct the secret in polynomial time whereas for an unauthorized set this is computationally hard. This is in contrast to some of the existing schemes in the literature, in which an authorized set can recover the secret only with certain probability. Also, in our scheme unlike in some of the existing schemes, the size of the ground field need not be extremely large. This scheme is efficient and requires O(mn 3), where n is the number of participants and m is the number of compartments.

Sequential secret sharing scheme based on Chinese remainder theorem

Multilevel Sequential secret sharing scheme is a composition of multilevel threshold secret sharing and multi-stage 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.

Sequential Secret Sharing Scheme Based on Level Ordered Access Structure

In Software Industry an application can be released to production only after it has gone through Unit testing, followed by Integration testing, then System testing and finally Acceptance testing. Note here that without the completion of unit testing, integration testing cannot be started and similarly without the completion of integration testing, system testing cannot be started and so on. That is the ordering is important. To realize this or similar kind of activity we need a hierarchial access structure that has in built ordering among the levels. Existing access structures fail to realize this scenario as they are short of enforcing the required ordering. The purpose of this pa- per is to propose an access structure that caters to this kind of scenarios and come up with schemes that realize this access structure. We call this new access structure as Level Ordered Access Structure (LOAS) and the schemes that realize this access structure as Level Ordered Secret Sharing (LOSS) schemes.

New secret sharing scheme for multipartite access structures with threshold changeability

A secret sharing method that realizes a variation of the multipartite access structure is proposed in this paper. The method indirectly distributes shares of the main secret with one random secret among a set of players. Again the shares of some unknown random secrets are calculated by the players and shared among themselves. At each level, the players can change their threshold to any arbitrary value dynamically. Each subset of the players can only recover the secret corresponding to their own level. The main secret will be retrieved by any level players if and only if all the secrets in other levels are first recovered. The access structure that our scheme realizes is such that the players of different levels calculate secrets individually but to recover the main secret cooperation of players from all the levels are required.

Efficient Verifiable Multi-Secret Sharing Based on Y.C.H Scheme

In this paper, we propose an efficient verifiable multi-secret sharing protocol based on an identity based signature scheme, that uses identities for its participants. The scheme makes use of advantages of identity based signature scheme and hash function for the verifiability which does not require much computation. It checks either dealer or participant(s) honesty, that means a corrupted dealer may provide a fake secret or a participant may provide a fake share to the other participants in the reconstruction phase. In the previous proposed schemes, dealer [15] (or) participants [12,16] could communicate with each other securely before the secret distribution phase for sending secret shadows and they used exponential functions for verification. In our scheme, we do not require pre-secure communication between a dealer and participants, although we use a two-variable way for the distribution purpose but we do not prevent from any exponential functions for the verification phase. Our scheme resist a dealer/participant(s) cheating behaviour efficiently.

Ideal and Computationally Perfect Secret Sharing Schemes for Generalized Access Structures

A secret sharing scheme is proposed in this paper. The scheme is ideal and uses computationally perfect concept. It uses a one way function and realizes generalized access structure. The scheme is useful for non-ideal access structures. For example, Stinson [14] has identified eighteen possible non-isomorphic monotone access structures with four participants. Fourteen of them admit ideal and perfect secret sharing schemes. The remaining four cannot be made both perfect and ideal. By making use of the computationally perfect concept, we propose ideal scheme for those four access structures.

Reasoning for Uncertainty and Rough Set-Based Approach for an Efficient Biometric Identification: An Application Scenario

In the theory of knowledge discovery, two fundamental concepts are classification and categories. Some of the specific categories may be definable inside one set of knowledge, but they may be undefinable into another knowledge base. This paper contains significant rough membership functional properties, which are utilized in approximation reasoning of an uncertain and vague concept in a knowledge base. In this paper, we have employed the Indicator Function and performed the reasoning for uncertainty, specifically for the rough membership properties of union and intersection. Along with this, we have utilized rough set theory and proposed an approach for an efficient biometric identification. The complexity and efficiency analysis of our proposed approach is also presented in this paper.