The complexity of the graph access structures on six participants
From MaRDI portal
Publication:1943986
DOI10.1007/s10623-011-9592-zzbMath1305.94088OpenAlexW2076444987MaRDI QIDQ1943986
Massoud Hadian Dehkordi, Motahhareh Gharahi
Publication date: 3 April 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9592-z
Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)
Related Items (8)
An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ The lower bound and exact value of the information rate of some developed graph access structures ⋮ The complexity of the connected graph access structure on seven participants ⋮ A generalized information theoretical model for quantum secret sharing ⋮ Reduced access structures with four minimal qualified subsets on six participants
Cites Work
- On the classification of ideal secret sharing schemes
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Weighted decomposition construction for perfect secret sharing schemes
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Elements of Information Theory
This page was built for publication: The complexity of the graph access structures on six participants
