A Four-Party Quantum Secret-Sharing Scheme based on Grover's Search Algorithm

• URL: http://arxiv.org/abs/2111.08932v1
• Date: Wed, 17 Nov 2021 06:48:23 GMT
• Title: A Four-Party Quantum Secret-Sharing Scheme based on Grover's Search Algorithm
• Authors: Deepa Rathi, Farhan Musanna, Sanjeev Kumar
• Abstract summary: The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS) The proposed QSS scheme utilizes Grover's three-particle quantum state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers.
• Score: 3.706222947143855
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. The participants combine their qubits and find the marked state as a measurement result of the three-qubit state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. In comparison to the existing schemes, our protocol fairs pretty well and has a high encoding capacity. The simulation analysis is done on the cloud platform IBM-QE thereby showing the practical feasibility of the scheme.

Related papers

• Implementing Quantum Secret Sharing on Current Hardware [2.85386288555414]
  Quantum secret sharing is a cryptographic scheme that enables a secure storage and reconstruction of quantum information. We provide a pedagogical description of encoding and decoding circuits for different secret sharing codes. We test their performance on IBM's 127-qubit Brisbane system.
  arXiv  Detail & Related papers  (2024-10-15T14:30:53Z)
• Quantum Encryption of superposition states with Quantum Permutation Pad in IBM Quantum Computers [0.0]
  We present an implementation of Kuang and Bettenburg's Quantum Permutation Pad (QPP) used to encrypt superposition states. The project was conducted on currently available IBM quantum systems using the Qiskit development kit.
  arXiv  Detail & Related papers  (2023-01-25T21:18:52Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Multi-party quantum private comparison based on entanglement swapping of Bell entangled states within d-level quantum system [0.0]
  MQPC scheme is suggested based on entanglement swapping of Bell entangled states within d-level quantum system. Security analysis shows that both the outside attack and the participant attack are ineffective. Scheme has distinct advantages on quantum resource, quantum measurement of third party (TP) and qubit efficiency.
  arXiv  Detail & Related papers  (2022-05-14T00:08:36Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Proposal for Quantum Ciphertext-Policy Attribute-Based Encryption [0.0]
  A Quantum Ciphertext-Policy Attribute-Based Encryption scheme (QCP-ABE) has been presented. A Semi Quantum version of the scheme has also been considered.
  arXiv  Detail & Related papers  (2022-03-21T11:22:09Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)

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.