Realization of Ideal Multipartite Access Structure Based on Threshold Scheme
Luo Gui-ming
Abstract
Luo Gui-ming
Abstract
This paper introduces the concept of multipartite access structure.In this structure,the set of participants is partitioned into w subsets and all participants in the same subset play an equivalent role.The(t,n)-threshold scheme is a mechanism that allows a set of n participants to share a secret such that only subsets of t or more participants can recover it.This paper presents ideal secret sharing schemes that can realize multipartite access structures by using threshold scheme repeatedly and proves that multipartite access structures are ideal access structures.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper introduces the concept of multipartite access structure.In this structure,the set of participants is partitioned into w subsets and all participants in the same subset play an equivalent role.The(t,n)-threshold scheme is a mechanism that allows a set of n participants to share a secret such that only subsets of t or more participants can recover it.This paper presents ideal secret sharing schemes that can realize multipartite access structures by using threshold scheme repeatedly and proves that multipartite access structures are ideal access structures.
Key concepts: Multipartite, Access structure, Computer science, Ideal (ethics), Secret sharing, Realization (probability), Scheme (mathematics), Set (abstract data type)