Multi-secret Sharing Research Papers - Academia.edu (original) (raw)
In this work, we employ a key access control management scheme which effortlessly transitions any organization-like security policy to state of the art cloud level security. Offering a very flexible, secure, and hierarchical key access... more
In this work, we employ a key access control management scheme which effortlessly transitions any organization-like security policy to state of the art cloud level security. Offering a very flexible, secure, and hierarchical key access mechanism for institutions that deal with mission-critical data. The scheme also minimizes concerns about moving critical data to the public cloud and ensures only the users with sufficient permission from equal or higher privileged members can access the key by the use of topological ordering of a directed graph which includes self-loop. The main overheads such as public and private storage needs are restricted to a level that is tolerable, and the derivation of key is computationally fast and efficient. From a security perspective, the proposed scheme would be resistant to collaboration attacks and would provide key in distinguishability security. Since the key isn't stored anywhere so, the problem of a data breach is eliminated.
Because of lack of infrastructure and Central Authority(CA), secure communication is a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its nodes resource tightness and mobility feature. The role of... more
Because of lack of infrastructure and Central Authority(CA), secure communication is a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET because the network is managed by the nodes themselves without any fixed infrastructure and centralized authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its private key. The traditional PKI protocols require centralized authority and heavy computing power to manage public and private keys, thus making them not suitable for MANETs. To establish a secure communication for the MANET nodes, we proposed a lightweight crypto protocol which requires limited resources, making it suitable for MANETs.
Authenticating a node in mobile ad-hoc networks is a challenging task due to their dynamic and resource constraint infrastructure. For this purpose, MANETS adopt two kinds of approaches Public key cryptography and identity based... more
Authenticating a node in mobile ad-hoc networks is a challenging task due to their dynamic and resource constraint infrastructure. For this purpose, MANETS adopt two kinds of approaches Public key cryptography and identity based cryptography. In Public Key Infrastructure (PKI), Certificate Authority (CA) is responsible for key management. In order to adopt it to MANET, the job of the CA must be distributed. The master secret key is shared among the nodes of the MANET, to self-organize the network without a central authority.The key is shared based on Shamir secret sharing scheme with bi-variate polynomial to make the MANET fully self-managed by nodes.In this paper, we considered PKI based scenario and proposed a new scheme to authenticate a node using BLS signature which is light weight compared to the existing schemes thus making it suitable for MANET.
—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... more
—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.
In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension... more
In a (t, n) secret sharing scheme (SS), a dealer divides the secret into n shares in such way that any t or more than t shares can reconstruct the secret but fewer than t shares cannot reconstruct the secret. The multi-SS is an extension of the (t, n) SS in which shares can be reused to reconstruct multiple secrets. Thus, the efficiency of the multi-SS is better than the efficiency of the (t, n) SS. In this paper, we propose the first multi-SS using a bivariate polynomial. Our design is unique in comparing with all existing multi-SSs. Shares generated using a bivariate polynomial can not only be used to reconstruct multiple secrets but also be used to establish pairwise keys between any pair of shareholders. The pairwise keys can protect exchange information in the secret reconstruction to prevent outsiders from obtaining the recovered secrets. All existing multi-SSs require additional key establishment to accomplish this.