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

The Short Secret Sharing Protocols (S3P), proposed by Roe et al in 1998 [13] and revised in 2003 [14], is a family of protocols that bootstrap secure session keys from weak secrets such as passwords. In this letter, we describe an attack against the RSA variants of the S3P protocols. The attacker can successfully masquerade as one of the participants, establish a new session, and gain knowledge...

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

This paper introduces “hyper-and-elliptic-curve cryptography”, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (e.g., Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (e.g., key generation) and multi-scalar m...

Traditional security mechanisms are mainly based on the distribution of shared secret keys. Yet, this task is non trivial in large wireless networks, due to mobility and scalability issues. Recently, it has been found that some properties of the physical layer of wireless communications can be leveraged for the purpose of secret key generation. In particular, the wireless channel has been inves...