Lee and Hwang proposed a multi-stage (t, n) secret sharing scheme which has fewer public values than pervious schemes. In their scheme, a group of participants share multiple secrets stage-by-stage, and only one secret share should been kept by each participant. However, in this article, we will show that multiple secrets cannot, in fact, be reconstructed stage-by-stage by the secret holder’s d...

Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the sou...

Beutelspacher considered a secret sharing scheme having a veto capability such that quali ed minorities can prevent any other set of participants from reconstructing the secret. In this paper, we prove that there exist no such schemes if we do not assume that the reconstruction machine is trustworthy.

Secret sharing allows a dealer to distribute a secret among multiple parties such that authorized coalitions can reconstruct the secret. Traditionally, the dealer knows the exact share each user holds. Grigoriev and Shpilrain recently considered secret sharing systems for which the dealer does not know the share of a particular party and introduced a construction for the special case of all-or-...

The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computations. However, the contrast of reconstructed image is much lost. By means of the reversing operation (reverse black and white), Viet and Kurosawa used the traditional VSS scheme to design a VSS scheme which the secret im...

1 Abbreviations and Notations 3

Article history: Received 25 November 2014 Received in revised form 26 December 2014 Accepted 1 January 2015 Available online 10 January 2015

This paper describes our preliminary research on "attention-sharing" in infants' language acquisition. Attention-sharing is the activity of paying one's attention to someone else's attentional target. This enables one to observe others' sensory-input (what they are perceiving from the target) and motor-output (what they are doing in response to the target). Being inspired by lack of attention-s...

We consider multi-party computation (MPC) in a hierarchical setting, where participants have different capabilities depending on their position in the hierarchy. First, we give necessary conditions for multiplication of secrets in a hierarchical threshold linear secret sharing scheme (LSSS). Starting with known ideal constructions, we then propose a modified scheme with improved multiplication ...

We present a general construction of a rational secret-sharing protocol that converts any rational secret-sharing protocol to a protocol with an expected constant-round reconstruction. Our construction can be applied to protocols for synchronous channels, and preserves a strict Nash equilibrium of the original protocol. Combining with an existing protocol, we obtain the first expected constant-...