Secret sharing scheme realizing general access structure

  title={Secret sharing scheme realizing general access structure},
  author={Mitsuru Ito and Akira Saito and Takao Nishizeki},
  journal={Electronics and Communications in Japan Part Iii-fundamental Electronic Science},
As a method of sharing a secret, e.g., a secret key, Shamir's (k, n) threshold method is well known. However, Shamir's method has a problem in that general access structures cannot be realized. This paper shows that by providing the trustees with several information data concerning the distributed information of the (k, n) threshold method, any access structure can be realized. the update with the change of the secret trustees and the relation to the threshold graph are also discussed. 

A Secure and Efficient Secret Sharing Scheme with General Access Structures

A new secret sharing scheme with general access structures was proposed, which is based on Shamir'ssecret sharing scheme and the discrete logarithm problem and provides great capabilities for many applications.

Realize General Access Structure Based on Single Share

This paper proposed two new secret sharing schemes realizing general access structures by only assigning one share to each trustee, including a perfect secret sharing scheme that can realize any access structures.

Constructing Perfect Secret Sharing Schemes for General and Uniform Access Structures

This paper proposes a construction of perfect secret sharing schemes with uniform, generalized access structures of rank 3 in such a way that only qualified subset of participants can recover the secret, and unqualified subsets of participants obtain no information regarding the secret.

A construction method of secret sharing schemes based on authorized subsets

  • Kouya Tochikubo
  • Computer Science
    2008 International Symposium on Information Theory and Its Applications
  • 2008
The proposed construction method is a perfect secret sharing scheme and includes Shamir's (k; n)-threshold schemes as a special case and is more efficient than Benaloh and Leichter's scheme and Tochikubo, Uyematsu and Matsumoto's scheme I.

Efficient Multi Secret Sharing with Generalized Access Structures

Multi-secret sharing is an extension of secret sharing technique where several secrets are shared between the participants, each according to a specified access structure. The secrets can be

Multi-Secret Sharing Schemes

This paper puts forward a general theory of multi-secret sharing schemes by using an information theoretical framework and proves lower bounds on the size of information held by each participant for various access structures.

On constructing secret sharing schemes

  • S. ShiehHung-Min Sun
  • Computer Science, Mathematics
    Proceedings of INFOCOM '94 Conference on Computer Communications
  • 1994
The authors propose an efficient construction of perfect secret sharing schemes for the access structures consisting of the closure of a graph where a vertex denotes a participant and an edge denotes a minimal qualified pairs of participants.

An ideal hierarchical secret sharing scheme

This paper proposes a novel construction of a secret sharing scheme which is based on the hierarchical concept of companies illustrated through its organization chart and represented by a tree and proves that the proposed scheme is ideal by showing that the information rate equals 1.

A Generalized Secret Sharing Scheme With Cheater Detection

A new secret sharing scheme is presented in this paper to realize the generalized secret sharing policy and any honest participant can detect and identify who is cheating even when all of the other participants corrupt together.



How to share a secret

  • A. Shamir
  • Computer Science, Mathematics
  • 1979
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

Cryptography and Data Security

The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.