Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
This work addresses the challenge of flexible access control in quantum secret sharing, which is incremental as it extends classical methods to the quantum domain.
The authors tackled the problem of realizing general access structures in quantum secret sharing by proposing a quantum version of the multiple assignment scheme, including ramp schemes, and developed an integer optimization approach to minimize the average share size.
The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing schemes. Then we propose an integer optimization approach to minimize the average share size.