The complexity of the graph access structures on six participants
type: Item
instance of: scholarly article
title: The complexity of the graph access structures on six participants
zbMATH Open document ID: 1305.94088
author: Motahhareh Gharahi
author: Massoud Hadian Dehkordi
published in: Designs, Codes and Cryptography
publication date: 2013-04-03T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 6150038
zbMATH Keywords: perfect secret sharing scheme
zbMATH Keywords: complexity
zbMATH Keywords: entropy method
MaRDI profile type: Publication
full work available at URL: s10623-011-9592-z
OpenAlex ID: W2076444987
cites work: Graph decompositions and secret sharing schemes
cites work: Tight bounds on the information rate of secret sharing schemes
cites work: On the classification of ideal secret sharing schemes
cites work: On the size of shares for secret sharing schemes
cites work: Elements of Information Theory
cites work: The size of a share must be large
cites work: An explication of secret sharing schemes
cites work: Weighted decomposition construction for perfect secret sharing schemes
cites work: On the information rate of perfect secret sharing schemes
DOI: 10.1007/S10623-011-9592-Z
description: scientific article; zbMATH DE number 6150038