Revocation and Reconstruction of Shared Quantum Secrets
- URL: http://arxiv.org/abs/2112.15556v6
- Date: Wed, 29 Mar 2023 03:39:05 GMT
- Title: Revocation and Reconstruction of Shared Quantum Secrets
- Authors: Prakash Mudholkar, Chiranjeevi Vanarasa, Indranil Chakrabarty and
Srinathan Kannan
- Abstract summary: In existing protocols there are no means by which the dealer can retrieve back the secret once he/she finds all the share holders to be semi-honest.
In this work, we explicitly deal with shareholders who are semi-honest and not dishonest.
Our protocol makes a significant advancement in solving this problem by designing strategy in bringing back the secret in the worst possible situation.
- Score: 0.5735035463793007
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In Quantum secret sharing we can share both quantum and classical secrets
with a quantum resource. In this article we study the problem of revocation of
quantum secret shared by the dealer with two shareholders in a three party
scenario. In the existing secret sharing protocols there are no means by which
the dealer can retrieve back the secret once he/she finds all the share holders
to be semi-honest. In this work, we are not dealing with shareholders who are
dishonest. We state clearly that in our quantum secret sharing protocol, we
explicitly deal with shareholders who are semi-honest and not dishonest. Our
protocol makes a significant advancement in solving this problem by designing
strategy in bringing back the secret in the worst possible situation when all
the shareholders/receivers are semi-honest. In our proposed strategy the dealer
also possesses a quantum share of the secret which empowers the dealer to bring
back the secret even after sharing is done. However the protocol along with the
revocation process also ensures the normal reconstruction at the share holder's
location when they are honest. This advantage comes with the expense of extra
one qubit on dealer's side and consequently we require a four qubit resource to
start with for 1-dealer and 2-share holder's scenario. Here in this article we
not only give the description of our protocol but also give an example where
our protocol is working with the help of a four qubit entangled state. We also
explicitly found out the range of parameter for the input state for which the
protocol will be successful.
Related papers
- Tyche: Collateral-Free Coalition-Resistant Multiparty Lotteries with Arbitrary Payouts [23.27199615640474]
We propose Tyche, a family of protocols for performing efficient multiparty lotteries.
Our protocols are based on a commit-and-reveal approach, requiring only a collision-resistant hash function.
We show that our protocols are secure, fair, and some preserve the participants' privacy.
arXiv Detail & Related papers (2024-09-05T12:19:37Z) - Quantum cloning transformation unlocks the potential of W class of states in a secret sharing protocol [0.0]
We introduce a quantum secret sharing protocol exploiting a three-qubit W class of state shared between three parties.
We find that the protocol is probabilistic and have calculated the probability of success of the protocol.
Even a less entangled W class of state can also play a vital role in the proposed secret-sharing scheme.
arXiv Detail & Related papers (2024-08-13T08:27:58Z) - Unclonable Secret Sharing [18.564937506648622]
Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically.
We introduce a novel unclonable primitive in the context of secret sharing, called unclonable secret sharing (USS)
arXiv Detail & Related papers (2024-06-16T16:50:15Z) - Quantum advantage in a unified scenario and secure detection of
resources [55.2480439325792]
We consider a single task to study different approaches of having quantum advantage.
We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
arXiv Detail & Related papers (2023-09-22T23:06:20Z) - Quantum Secret Reconstruction [2.8233507229238177]
This paper proposes the first quantum secret reconstruction protocol based on cluster states.
It is shown that the proposed protocol is secure against several common attacks.
arXiv Detail & Related papers (2023-06-15T05:24:29Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Semiquantum secret sharing by using x-type states [4.397981844057195]
A semiquantum secret sharing protocol based on x-type states is proposed.
It can accomplish the goal that only when two classical communicants cooperate together can they extract the shared secret key of a quantum communicant.
Detailed security analysis turns out that this protocol is completely robust against an eavesdropper.
arXiv Detail & Related papers (2022-08-03T08:58:45Z) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z) - Quantum secret sharing using GHZ state qubit positioning and selective
qubits strategy for secret reconstruction [4.378411442784295]
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties.
Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret.
The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret.
arXiv Detail & Related papers (2020-02-21T08:45:07Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.