Client-Server Identification Protocols with Quantum PUF
- URL: http://arxiv.org/abs/2006.04522v2
- Date: Fri, 1 Oct 2021 12:11:32 GMT
- Title: Client-Server Identification Protocols with Quantum PUF
- Authors: Mina Doosti, Niraj Kumar, Mahshid Delavar, and Elham Kashefi
- Abstract summary: We propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs)
The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice-versa.
Unlike existing identification protocols based on Quantum Read-out PUFs which rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties.
- Score: 1.4174475093445233
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recently, major progress has been made towards the realisation of quantum
internet to enable a broad range of classically intractable applications. These
applications such as delegated quantum computation require running a secure
identification protocol between a low-resource and a high-resource party to
provide secure communication. In this work, we propose two identification
protocols based on the emerging hardware secure solutions, the quantum Physical
Unclonable Functions (qPUFs). The first protocol allows a low-resource party to
prove its identity to a high-resource party and in the second protocol, it is
vice-versa. Unlike existing identification protocols based on Quantum Read-out
PUFs which rely on the security against a specific family of attacks, our
protocols provide provable exponential security against any Quantum
Polynomial-Time adversary with resource-efficient parties. We provide a
comprehensive comparison between the two proposed protocols in terms of
resources such as quantum memory and computing ability required in both parties
as well as the communication overhead between them.
Related papers
- Towards efficient and secure quantum-classical communication networks [47.27205216718476]
There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC)
We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution.
We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
arXiv Detail & Related papers (2024-11-01T23:36:19Z) - Twin-field-based multi-party quantum key agreement [0.0]
We study a method to extend the twin-field key distribution protocol to a scheme for multi-party quantum key agreement.
We derive the key rate based on the entanglement-based source-replacement scheme.
arXiv Detail & Related papers (2024-09-06T11:51:10Z) - Efficient Device-Independent Quantum Key Distribution [4.817429789586127]
Device-independent quantum key distribution (DIQKD) is a key distribution scheme whose security is based on the laws of quantum physics.
We propose an efficient device-independent quantum key distribution protocol in which one participant prepares states and transmits them to another participant.
arXiv Detail & Related papers (2023-11-16T13:01:34Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - 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) - Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [1.3812010983144802]
Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations.
This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
arXiv Detail & Related papers (2021-09-03T08:52:17Z) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - Composable Security for Multipartite Entanglement Verification [3.4806267677524896]
We present a composably secure protocol allowing $n$ parties to test an entanglement generation resource controlled by a possibly dishonest party.
The test consists only in local quantum operations and authenticated classical communication once a state is shared among them.
Our protocol can typically be used as a subroutine in a Quantum Internet, to securely share a GHZ state among the network before performing a communication or computation protocol.
arXiv Detail & Related papers (2020-04-16T14:33:17Z)
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.