Access structure in graphs in high dimension and application to secret sharing

Abstract

We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on graph state protocols. We give a lower bound on $k$ for the existence of a $((k,n){)}_q$ scheme and prove, using probabilistic methods, that there exists $\alpha$ such that a random multigraph has an accessing parameter $k\le \alpha n$ with high probability.

18 pages, 2 figures

References in corpus (9)

• Multi-party entanglement in graph states
• Quantum secret sharing with qudit graph states
• Reducing the quantum communication cost of quantum secret sharing
• Generalized Semi-Quantum Secret Sharing Schemes
• On the equivalence between sharing quantum and classical secrets, and error correction
• New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
• On Weak Odd Domination and Graph-based Quantum Secret Sharing
• Parametrized Complexity of Weak Odd Domination Problems
• Optimal accessing and non-accessing structures for graph protocols