Welcome to the resource topic for 2025/1008
Title:
Reviving a Grover based Quantum Secret Sharing Scheme
Authors: Debajyoti Bera, Santanu Majhi
Abstract:Secret-sharing schemes allow a dealer to split a secret into
multiple “shares” and distribute them individually among many parties
while mandating certain constraints on its reconstruction. Such protocols
are usually executed over a secure communication channel since an
eavesdropper, after intercepting all the shares, is expected to be able
to reconstruct the secret. Leveraging the unique properties of quantum
channels, several quantum protocols have been designed for secret sharing.
However, almost all of them detect the presence of an eavesdropper
by statistical analysis of the outcome of multiple rounds, or simply require
a secure channel of communication.
We mathematically analyse the correctness and security properties of a
quantum-search based secret-sharing framework proposed by Hsu (2003)
(and attacked by Hao et al. (2010)) that was proposed as an alternative
that works over public channels and does not require multiple rounds.We
show how to improve the original protocol to be more resistant towards
eavesdropping and other attacks; however, we also prove that complete
security against an eavesdropper is not possible in this framework.
Our tight characterization will be helpful towards the construction of
more quantum secret sharing schemes based on the same framework.
ePrint: https://eprint.iacr.org/2025/1008
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .