Perfect secret sharing schemes for graph access structures on six participants
From MaRDI portal
Publication:2854182
DOI10.1515/jmc-2012-0026zbMath1305.94090OpenAlexW2052565568MaRDI QIDQ2854182
Motahhareh Gharahi, Massoud Hadian Dehkordi
Publication date: 17 October 2013
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2012-0026
Related Items (7)
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 ⋮ Secret sharing on regular bipartite access structures ⋮ The lower bound and exact value of the information rate of some developed graph access structures ⋮ On the information ratio of graphs without high-degree neighbors ⋮ Reduced access structures with four minimal qualified subsets on six participants
This page was built for publication: Perfect secret sharing schemes for graph access structures on six participants
