Permutational-key quantum homomorphic encryption with homomorphic quantum error-correction
- URL: http://arxiv.org/abs/2204.10471v2
- Date: Wed, 04 Jun 2025 19:33:51 GMT
- Title: Permutational-key quantum homomorphic encryption with homomorphic quantum error-correction
- Authors: Yingkai Ouyang, Peter P. Rohde,
- Abstract summary: We revisit a permutational-key quantum homomorphic encryption protocol with information-theoretic security.<n>We explain how to integrate this protocol with quantum error correction that has the error correction encoding as a homomorphism.
- Score: 7.059472280274009
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The gold-standard for security in quantum cryptographic protocols is information-theoretic security. Information-theoretic security is surely future-proof, because it makes no assumptions on the hardness of any computational problems and relies only on the fundamental laws of quantum mechanics. Here, we revisit a permutational-key quantum homomorphic encryption protocol with information-theoretic security. We explain how to integrate this protocol with quantum error correction that has the error correction encoding as a homomorphism. This feature enables both client and server to apply the encoding and decoding step for the quantum error correction, without use of the encrypting permutation-key.
Related papers
- Joint Encryption and Error Correction for Secure Quantum Communication [0.0]
We provide a single integrated process that allows for encryption as well as error correction.<n>This is a first attempt to do so for secure quantum communication.<n>It allows for arbitrary qubits to be transmitted from sender to receiver making the proposed protocol general purpose.
arXiv Detail & Related papers (2025-05-23T17:42:03Z) - Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
Quantum computing solutions are increasingly deployed in commercial environments through delegated computing.
One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations.
Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
arXiv Detail & Related papers (2024-11-19T07:37:24Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes [0.0]
We develop an efficient quantum homomorphic encryption scheme based on quantum error correction codes.
By using a longer quantum error correction code, both the security and error-correction capabilities of the scheme are improved.
arXiv Detail & Related papers (2024-01-16T02:30:06Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Improving the performance of quantum cryptography by using the
encryption of the error correction data [0.0]
We introduce the idea of encrypting classical communication related to error-correction in order to decrease the amount of information available to the eavesdropper.
We analyze the applicability of the method in the context of additional assumptions concerning the eavesdropper's quantum memory coherence time.
arXiv Detail & Related papers (2023-06-21T15:42:54Z) - Deploying hybrid quantum-secured infrastructure for applications: When
quantum and post-quantum can work together [0.8702432681310401]
Quantum key distribution is secure against unforeseen technological developments.
Post-quantum cryptography is believed to be secure even against attacks with both classical and quantum computing technologies.
Various directions in the further development of the full-stack quantum-secured infrastructure are also indicated.
arXiv Detail & Related papers (2023-04-10T13:44:21Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - 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) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Quantum Cryptography: Quantum Key Distribution, a Non-technical Approach [0.0]
Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of physics.
This paper is a non-technical overview of quantum key distribution, a type of cryptography poised to exploit the laws of quantum mechanics directly.
arXiv Detail & Related papers (2022-11-09T15:30:23Z) - Unclonability and Quantum Cryptanalysis: From Foundations to
Applications [0.0]
Unclonability is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information.
We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability.
We discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols.
arXiv Detail & Related papers (2022-10-31T17:57:09Z) - Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
We construct the first fully homomorphic encryption scheme with certified deletion.
Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
arXiv Detail & Related papers (2022-03-03T10:07:32Z) - Quantum Computation Using Action Variables [4.087043981909747]
We argue quantum computation using action variables as fault-tolerant quantum computation, whose fault-tolerance is guaranteed by the quantum KAM theorem.
Besides, we view the Birkhoff norm form as a mathematical framework of the extended harmonic oscillator quantum computation.
arXiv Detail & Related papers (2021-09-24T12:04:27Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - A practical quantum encryption protocol with varying encryption
configurations [0.0]
We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states.
The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
arXiv Detail & Related papers (2021-01-22T20:09:03Z) - Universal quantum computation and quantum error correction with
ultracold atomic mixtures [47.187609203210705]
We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates.
One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information.
We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
arXiv Detail & Related papers (2020-10-29T20:17:14Z) - Quantum information spreading in a disordered quantum walk [50.591267188664666]
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern.
We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport.
Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
arXiv Detail & Related papers (2020-10-20T20:03:19Z) - 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.