A secret sharing scheme permits a secret to be shared among participants in such a way that only qualiied subsets of participants can recover the secret, but any non-qualiied subset has absolutely no information on the secret. In this paper we derive new limitations on the information rate of secret sharing schemes, that measures how much information is being distributed as shares as compared t...

Proactive secret sharing deals with refreshing secret shares i e 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 e g t out of l can access or use the secret The problem is how to redistribute...

a r t i c l e i n f o a b s t r a c t Shamir's (t, n) secret sharing scheme (SS) is based on a univariate polynomial and is the most cited SS in the literature. The secret in a (t, n) SS can be recovered either by exactly t or more than t shareholders. Most SSs only consider when there are exactly t shareholders participated in the secret reconstruction. In this paper, we examine security issue...

We consider the problem of secret key distribution in a sensor network with multiple scattered sensor nodes and a mobile device that can be used to bootstrap the network. Our main contribution is a practical scheme that relies on network coding to provide a robust and low-complexity solution for sharing secret keys among sensor nodes. In spite of its role as a key enabler for this approach, the...

Identity-Based cryptography has been proposed in mobile ad-hoc networks (MANETs) to provide security. However, the figure of the Private Key Generator (PKG) is not adequate in the MANET setting, since it may not be reachable by all nodes, can fail during the life-time of the protocol or can even be attacked, compromising the whole system. Previous works distribute the task of the PKG among a se...

Many challenging security-related issues have been studied in wireless sensor networks to provide a demanded quality and security for deliverable data. Yet, one of these issues which are not handled is the secret key revocation. In a semi-dynamic, resource-constrained and long-living sensor network with self organization features, traditional revocation methods are not desirable and somehow imp...

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 t...

In recent day, the enormous usage of cloud services leads to much concerned on cloud security. This paper primarily considers the important aspect of cloud security based on encryption. The users perform secure search on cloud environment using this method. Data stored in cloud are encrypted which ensure the privacy of the user; the files are encrypted before uploading. At the time of searching...