QEnclave -- A practical solution for secure quantum cloud computing

• URL: http://arxiv.org/abs/2109.02952v3
• Date: Tue, 21 Sep 2021 12:29:40 GMT
• Title: QEnclave -- A practical solution for secure quantum cloud computing
• Authors: Yao Ma, Elham Kashefi, Myrto Arapinis, Kaushik Chakraborty and Marc Kaplan
• Abstract summary: We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. Remarkably, our QEnclave only performs single-qubit rotations, but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary.
• Score: 3.171632548686767
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing the classical concept of a secure enclave which isolates a computation from its environment to provide privacy and tamper-resistance. Remarkably, our QEnclave only performs single-qubit rotations, but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named Remote State Rotation. We show that this resource, similar to previously introduced functionality of remote state preparation, allows blind delegated quantum computing with perfect security. Our proof relies on standard tools from delegated quantum computing. Working in the Abstract Cryptography framework, we show a construction of remote state preparation from remote state rotation preserving the security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols were relying on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them.

Related papers

• Composable Verification in the Circuit-Model via Magic-Blindness [0.0]
  We introduce a family of noise robust, composable and efficient verification protocols for Clifford + MSI circuits.<n>Our technique is based on a refined notion of blindness, called magic-blindness, which hides only the injected magic states.<n>As a result, circuit-based quantum verification attains the same level of security and robustness previously known only in MBQC.
  arXiv  Detail & Related papers  (2026-01-12T00:30:24Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Implementation of classical client universal blind quantum computation with 8-state RSP in current architecture [1.5649420473539184]
  We propose an implementation of a universal blind quantum computation (UBQC) protocol based on measurement-based quantum computation (MBQC) UBQC enables a semi-classical client to delegate universal quantum computation to a quantum server, interactively and fetch the results while the computation itself remains blind to the server. Such an implementation has already been shown to be secure in a game-based security setting, which is the weakest security model.
  arXiv  Detail & Related papers  (2025-03-14T22:52:02Z)
• Partial Blind Quantum Computation: A Framework for Selective Circuit Protection [0.5755004576310334]
  Universal Blind Quantum Computation protocols enable clients with limited quantum resources to delegate computations while concealing both inputs and circuit details.<n>Applying UBQC uniformly to an entire quantum circuit incurs additional quantum resources and computational overhead.<n>We propose a selective application of UBQC that targets only the critical components of quantum circuits.
  arXiv  Detail & Related papers  (2025-03-13T03:31:12Z)
• Composably Secure Delegated Quantum Computation with Weak Coherent Pulses [0.0]
  Secure Delegated Quantum Computation protocols allow a client to delegate a quantum computation to a powerful remote server. This paper shows how to alleviate the necessity for the client to have a single-photon source. It proposes a protocol that ensures that among a sufficiently large block of transmitted weak coherent pulses, at least one of them was emitted as a single photon.
  arXiv  Detail & Related papers  (2025-03-11T15:47:52Z)
• Quantum delegated and federated learning via quantum homomorphic encryption [0.5939164722752263]
  We present a general framework that enables quantum delegated and federated learning with atheoretical data privacy guarantee. We show that learning and inference under this framework feature substantially lower communication complexity compared with schemes based on blind quantum computing.
  arXiv  Detail & Related papers  (2024-09-28T14:13:50Z)
• 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)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• 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)
• Simulation of Networked Quantum Computing on Encrypted Data [0.0]
  cryptographic techniques must be developed for secure remote use of quantum computing power. I present a simulation of such a protocol, tested classically on the simulation platform LIQ$Ui|rangle.
  arXiv  Detail & Related papers  (2022-12-25T20:02:53Z)
• Modulation leakage-free continuous-variable quantum key distribution [1.8268488712787332]
  Continuous-variable (CV) QKD based on coherent states is an attractive scheme for secure communication. This work is a step towards protecting CVQKD systems against practical imperfections of physical devices and operational limitations without performance degradation.
  arXiv  Detail & Related papers  (2022-05-15T10:07:19Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• 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)
• 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)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power [1.9737117321211988]
  Quantum cloud computing is emerging as a popular model for users to experience the power of quantum computing through the internet. How can users be sure that the output strings sent by the server are really from a quantum hardware?
  arXiv  Detail & Related papers  (2020-05-04T14:28:14Z)

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.