Circular semi-quantum secret sharing using single particles

• URL: http://arxiv.org/abs/2205.05558v1
• Date: Wed, 11 May 2022 15:09:17 GMT
• Title: Circular semi-quantum secret sharing using single particles
• Authors: Chong-Qiang Ye, Tian-Yu Ye
• Abstract summary: Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (1) they adopt product states or entangled states as initial quantum resource; (2) the particles prepared by quantum party are transmitted in a tree-type way; and (3) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (1) they adopt single particles rather than product states or entangled states as initial quantum resource; (2) the particles prepared by quantum party are transmitted in a circular way; and (3) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality.

Related papers

• Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
  We propose a measurement-device-independent (MDI) test for beyond-quantum state detection. We discuss the importance of tomographic completeness of the input sets to the detection.
  arXiv  Detail & Related papers  (2023-12-11T06:40:13Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• 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)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• Measure-resend semi-quantum private comparison without entanglement [0.0]
  Our protocol allows two classical users to compare the equality of their private secrets under the help of a quantum third party. The quantum TP is semi-honest in the sense that he is allowed to misbehave on his own but cannot conspire with either of users.
  arXiv  Detail & Related papers  (2022-05-13T00:43:05Z)
• Semi-quantum dialogue based on single photons [0.0]
  We propose two semi-quantum dialogue (SQD) protocols by using single photons as the quantum carriers. One requires the classical party to possess the measurement capability and the other does not.
  arXiv  Detail & Related papers  (2022-05-11T15:27:10Z)
• 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)
• Single-state multi-party semiquantum key agreement protocol based on multi-particle GHZ entangled states [3.312385039704987]
  We propose a single-state three-party semiquantum key agreement (SQKA) protocol with three-particle GHZ entangled states first. Detailed security analysis turns out that the proposed single-state three-party SQKA protocol is secure against several famous attacks from an outside eavesdropper.
  arXiv  Detail & Related papers  (2021-12-11T00:13:16Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Multiparty Mediated Quantum Secret Sharing Protocol [0.0]
  The proposed MQSS protocol has addressed two common challenges in the existing semi-quantum secret sharing protocols. The security analysis has delivered proof to show that the proposed MQSS protocol can avoid the collective attack, the collusion attack, and the Trojan horse attacks.
  arXiv  Detail & Related papers  (2021-02-13T02:09:16Z)
• 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)

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.