Protocols for counterfactual and twin-field quantum digital signature
- URL: http://arxiv.org/abs/2310.11308v2
- Date: Wed, 19 Jun 2024 16:37:01 GMT
- Title: Protocols for counterfactual and twin-field quantum digital signature
- Authors: Vinod N. Rao, Shrikant Utagi, Anirban Pathak, R. Srikanth,
- Abstract summary: Quantum digital signature (QDS) is the quantum version of its classical counterpart.
We propose a QDS scheme based on quantum counterfactuality.
We show how this two-way protocol can be turned into an equivalent non-counterfactual, one-way protocol.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum digital signature (QDS) is the quantum version of its classical counterpart, and can offer security against attacks of repudiation, signature forging and external eavesdropping, on the basis of quantum mechanical no-go principles. Here we propose a QDS scheme based on quantum counterfactuality, which leverages the concept of interaction-free measurement. Employing the idea behind twin-field cryptography, we show how this two-way protocol can be turned into an equivalent non-counterfactual, one-way protocol, that is both more practical and also theoretically helpful in assessing the experimental feasibility of the first protocol. The proposed QDS protocol can be experimentally implemented with current quantum technology.
Related papers
- Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass.
Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements.
We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
arXiv Detail & Related papers (2024-05-24T17:33:10Z) - Increasing Interference Detection in Quantum Cryptography using the Quantum Fourier Transform [0.0]
We present two quantum cryptographic protocols leveraging the quantum Fourier transform (QFT)
The foremost of these protocols is a novel QKD method that leverages this effectiveness of the QFT.
We additionally show how existing quantum encryption methods can be augmented with a QFT-based approach to improve eavesdropping detection.
arXiv Detail & Related papers (2024-04-18T21:04:03Z) - A Feasible Semi-quantum Private Comparison Based on Entanglement
Swapping of Bell States [5.548873288570182]
We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states.
Security analysis shows that our protocol is resilient to both external and internal attacks.
Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
arXiv Detail & Related papers (2023-05-12T13:28:44Z) - 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) - Single-photon-memory measurement-device-independent quantum secure
direct communication [63.75763893884079]
Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely.
In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed.
We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
arXiv Detail & Related papers (2022-12-12T02:23:57Z) - 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) - 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) - Experimental quantum key distribution certified by Bell's theorem [0.0]
cryptographic key exchange protocols traditionally rely on computational conjectures to provide security against eavesdropping attacks.
quantum key distribution protocols provide information-theoretic security against such attacks.
However, quantum protocols are subject to a new class of attacks exploiting implementation defects in the physical devices involved.
We present here the experimental realisation of a complete quantum key distribution protocol immune to these vulnerabilities.
arXiv Detail & Related papers (2021-09-29T17:52:48Z) - Coherent one-way quantum conference key agreement based on twin field [9.369069713000165]
Quantum conference key agreement (CKA) enables key sharing among trusted users with information-theoretic security.
We propose a quantum CKA protocol of three users.
Exploiting coherent states with intensity 0 and $mu$ to encode logic bits, our protocol can break the limit.
arXiv Detail & Related papers (2021-09-06T03:53:08Z) - 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 Key-Distribution Protocols Based on a Quantum Version of the
Monty Hall Game [0.0]
The study proposed two quantum key-distribution protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott.
The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates.
arXiv Detail & Related papers (2020-05-11T22:06:30Z)
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.