Randomly Choose an Angle from an Immense Number of Angles to Rotate
Qubits, Compute and Reverse
- URL: http://arxiv.org/abs/2302.05841v1
- Date: Sun, 12 Feb 2023 03:20:58 GMT
- Title: Randomly Choose an Angle from an Immense Number of Angles to Rotate
Qubits, Compute and Reverse
- Authors: Dor Bitan and Shlomi Dolev
- Abstract summary: This paper studies information-theoretically secure quantum homomorphic encryption schemes of classical data.
We use the RBE (Random-Basis Encryption) scheme -- a QHE scheme in which the encryption of a bit is a qubit, randomly selected from a set of an immense number of qubits.
- Score: 3.04585143845864
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper studies information-theoretically secure quantum homomorphic
encryption (QHE) schemes of classical data. Previous works on
information-theoretically secure QHE schemes (like Childs'05, Liang'13, and
others) are typically based on the Quantum-One-Time-Pad (QOTP) approach of
Ambainis et al. [AMTdW'00]. There, the encryption of a bit is a qubit, randomly
selected from a set of four possible qubits. This paper takes a different
approach and presents the RBE (Random-Basis Encryption) scheme -- a QHE scheme
in which the encryption of a bit is a qubit, randomly selected from a set of an
immense number of qubits.
Second, this paper studies weak measurements (WM) and presents a WM-based
attack on legacy QOTP-based Quantum Key Distribution (QKD) protocols. Then, we
use the RBE scheme to construct a QKD protocol and argue that this protocol is
resilient to such WM-based attacks.
Finally, this paper raises the following question. Entanglement is an
essential resource in quantum information and quantum computation research.
Hence, once generated, how can its owner secure entangled systems of qubits? We
inspect possible QOTP-based solutions, suggest an RBE-based solution, and
discuss some of the benefits of the latter.
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) - Hybrid Quantum Cryptography from Communication Complexity [0.43695508295565777]
We build a key distribution protocol called HM-QCT from the Hidden Matching problem.
We show that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem.
Remarkably, the scheme remains secure with up to $mathcalObig( fracsqrtnlog(n)big)$ input photons for each channel use.
arXiv Detail & Related papers (2023-11-15T18:03:15Z) - 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) - Quantum oblivious transfer: a short review [0.06554326244334865]
We study the concept of oblivious transfer in the area of theoretical quantum cryptography.
We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.
arXiv Detail & Related papers (2022-06-06T15:19:26Z) - 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) - Fast and Secure Routing Algorithms for Quantum Key Distribution Networks [5.659290426197763]
We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks.
We propose a new secure throughput-optimal policy called Tandem Queue Decomposition (TQD)
We show that the TQD policy solves the problem of secure and efficient packet routing for a broad class of traffic, including unicast, broadcast, multicast, and anycast.
arXiv Detail & Related papers (2021-09-16T12:29:41Z) - Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad
with Quaternions [4.182969308816531]
Quantum fully homomorphic encryption (QFHE) allows to evaluate quantum circuits on encrypted data.
We present a novel QFHE scheme, which extends Pauli one-time pad encryption by relying on the quaternion of SU(2).
arXiv Detail & Related papers (2020-12-08T04:54:02Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Post-Quantum Multi-Party Computation [32.75732860329838]
We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries.
We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption.
Along the way, we develop cryptographic primitives that may be of independent interest.
arXiv Detail & Related papers (2020-05-23T00:42:52Z) - Backflash Light as a Security Vulnerability in Quantum Key Distribution
Systems [77.34726150561087]
We review the security vulnerabilities of quantum key distribution (QKD) systems.
We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
arXiv Detail & Related papers (2020-03-23T18:23:12Z)
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.