Ideal secret sharing schemes with multipartite access structures
Siaw‐Lynn Ng
Abstract
Siaw‐Lynn Ng
Abstract
The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite access structures is still open. Here it is shown that quasi-threshold multipartite access structures are ideal by constructing a projective space representation of the associated matroids.
OpenAlex reports 31 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
The concept of quasi-threshold multipartite access structures for secret sharing schemes is introduced. These access structures allow one distinguished class of participants to retain control over the reconstruction of the secret, while allowing flexibility over the quorum of participants from other classes. While ideal bipartite access structures have been classified, the case for multipartite access structures is still open. Here it is shown that quasi-threshold multipartite access structures are ideal by constructing a projective space representation of the associated matroids.
Key concepts: Multipartite, Secret sharing, Access structure, Ideal (ethics), Bipartite graph, Computer science, Flexibility (engineering), Mathematics