pith. sign in

arxiv: 1503.04061 · v1 · pith:MKXL4BVCnew · submitted 2015-03-13 · 🪐 quant-ph

Quantum fully homomorphic encryption scheme based on quantum fault-tolerant construction

classification 🪐 quant-ph
keywords quantumschemeencryptionfullyhomomorphicclientcomputationconstructed
0
0 comments X
read the original abstract

Fully homomorphic encryption is a kind of encryption scheme, which enables arbitrary computation on encrypted data without accessing the data. We present the quantum version of fully homomorphic encryption scheme, which is constructed based on quantum fault-tolerant construction. Two schemes are constructed. The first is a symmetric scheme, and the secret key is the quantum CSS code. In the scheme, when Server performs quantum computation on the encrypted plaintext, some ancillary quantum states should be provided by Client. The second is an asymmetric scheme, which contains the periodical interaction between Client and Server.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Reliable Non-Leveled Homomorphic Encryption for Web Services

    cs.CR 2025-08 unverdicted novelty 4.0

    Proposes a reliable non-leveled FHE scheme with new encoding and an algebraic reliability layer to reduce overhead and add built-in error correction for web services.