{
  "id": "1708.02130",
  "version": "v1",
  "published": "2017-08-07T14:27:06.000Z",
  "updated": "2017-08-07T14:27:06.000Z",
  "title": "Classical Homomorphic Encryption for Quantum Circuits",
  "authors": [
    "Urmila Mahadev"
  ],
  "categories": [
    "quant-ph",
    "cs.CR"
  ],
  "abstract": "We present a computationally secure classical homomorphic encryption scheme for quantum circuits. The scheme allows a classical server to blindly delegate a quantum computation to a quantum server; the server is able to run the computation without learning about the computation itself. This result relies on post-quantum classical cryptographic tools, including sub-exponentially secure indistinguishability obfuscation and pseudorandom function families, as well as classical homomorphic encryption and learning with errors.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-08-07T14:27:06.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum circuits",
      "secure classical homomorphic encryption scheme",
      "pseudorandom function families",
      "computationally secure classical homomorphic encryption",
      "sub-exponentially secure indistinguishability obfuscation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}