ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1810.01166
94
7
v1v2v3v4v5v6v7v8v9v10v11v12v13v14v15v16v17v18v19v20 (latest)

A quantum homomorphic encryption scheme for polynomial-sized circuits

2 October 2018
Li Yu
ArXiv (abs)PDFHTML
Abstract

Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor about the program to the opposite party. It is known that information-theoretically-secure QHE for arbitrary circuits would require exponential resources, and efficient computationally-secure QHE schemes for polynomial-sized quantum circuits have been constructed. In this paper we propose an information-theoretically-secure QHE scheme with entanglement and communication costs polynomial in circuit size. The scheme keeps the data perfectly secure, and the privacy of the circuit is optimal in general.

View on arXiv
Comments on this paper