Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction

• URL: http://arxiv.org/abs/2002.09182v1
• Date: Fri, 21 Feb 2020 08:45:07 GMT
• Title: Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction
• Authors: Farhan Musanna, Sanjeev Kumar
• Abstract summary: 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.
• Score: 4.378411442784295
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. 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. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the $(3,3)$ scheme which can further be extended for a $(n,n)$ scheme.

Related papers

• A Novel Efficient Multiparty Semi-Quantum Secret Sharing Protocol Using Entangled States for Sharing Specific Bits [0.0]
  This paper develops a novel multi-party SQSS scheme using the quantum property between Bell states to detect eavesdroppers. It employs a fully one-way communication scheme, entirely preventing the Trojan horse attack without costly quantum devices.
  arXiv  Detail & Related papers  (2024-09-08T16:40:56Z)
• A Secure Quantum Key Distribution Protocol Using Two-Particle Transmission [0.0]
  Unextendible Product Bases (UPBs) hold promise in quantum cryptography due to their inherent indistinguishability. This work introduces a protocol utilizing UPBs to establish quantum keys between distant parties.
  arXiv  Detail & Related papers  (2024-03-20T14:33:17Z)
• 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)
• ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment [90.60126724503662]
  ByzSecAgg is an efficient secure aggregation scheme for federated learning. ByzSecAgg is protected against Byzantine attacks and privacy leakages.
  arXiv  Detail & Related papers  (2023-02-20T11:15:18Z)
• Deploying Convolutional Networks on Untrusted Platforms Using 2D Holographic Reduced Representations [33.26156710843837]
  We create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack. By leveraging Holographic Symbolic Reduced Representations (HRR), we create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack.
  arXiv  Detail & Related papers  (2022-06-13T03:31:39Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Revocation and Reconstruction of Shared Quantum Secrets [0.5735035463793007]
  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.
  arXiv  Detail & Related papers  (2021-12-31T17:08:12Z)
• A novel three party Quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharing [4.378411442784295]
  We present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the parties do not divulge in their valid measurement outcomes.
  arXiv  Detail & Related papers  (2020-08-14T07:50:35Z)
• MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack [44.50542274828587]
  We propose an approach for constructing efficient $n$-party protocols for secure neural network training. Our actively secure neural network training incurs affordable efficiency overheads of around 2X and 2.7X in LAN and WAN settings. Besides, we propose a scheme to allow additive shares defined over an integer ring $mathbbZ_N$ to be securely converted to additive shares over a finite field $mathbbZ_Q$.
  arXiv  Detail & Related papers  (2020-07-24T15:03:51Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

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.