In 1979, secret sharing schemes were first proposed by Blakley and Shamir. In a secret sharing scheme, each participant receives a share of a secret in such a way that only authorized subsets can reconstruct the secret. Later, Wu and He proposed a (t, n)-threshold scheme for sharing a secret based on a hyperspherical function (HS-TS). Their scheme give a practical algorithm to solve the problem...

Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the N shares, however, have no visual meaning and...

The paper analyses the multiple assignment secret sharing scheme, presented at the GLOBECOM'87 Conference. It contains three technical comments and a contribution to extend the capabilities of Shamir scheme. First it is proved that the proposed multiple assignment secret sharing scheme is not perfect. In fact, the non-perfectness of the scheme is due to the non-perfectness of a certain type of ...

Verifiable secret sharing schemes proposed so far can only allow participants to verify whether their shares are correct or not. In this paper, we propose a new protocol which can allow participants not only to verify the correctness of their shares but also to revise the faulty shares. It is achieved in a cooperative way by participants, but without any assistance from the dealer. This protoco...

Generalized secret sharing is a method of constructing secret sharing from the perspective of access structure. In this paper, we propose a novel solution for achieving generalized secret sharing with linear hierarchical secrets. We use a matrix to model the relationship related to the access structure and transfer the matrix to modular arithmetic, which is calculated by Chinese Remainder Theor...

The constrained resources of sensors restrict the design of a key management scheme for wireless sensor networks (WSNs). In this work, we first formalize the security model of ALwEN, which is a gossipbased wireless medical sensor network (WMSN) for ambient assisted living. Our security model considers the node capture, the gossip-based network and the revocation problems, which should be valuab...

We improve a secret sharing scheme, which enables users select their personal keys by themselves instead of being distributed by group manager and users can reuse their personal keys no matter the shared secret is renewed or recovered. Then we apply it to design a self-healing key distribution scheme. The new scheme achieves good properties. Firstly, the scheme reduces storage overhead of perso...