Quantum fully homomorphic encryption scheme based on universal quantum circuit
From MaRDI portal
Abstract: Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on an encrypted data. The QFHE scheme is proved to be perfectly secure. In the scheme, the decryption key is different from the encryption key, however, the encryption key cannot be public. Moreover, the evaluate algorithm of the scheme is independent of the encryption key, so it is very applicable in delegated quantum computing between two parties.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5666680 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- BLIND QUANTUM COMPUTATION
- Demonstration of Blind Quantum Computing
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption using ideal lattices
- Moving Beyond Trust in Quantum Computing
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Secure assisted quantum computation
- Symmetric quantum fully homomorphic encryption with perfect security
- Universal Blind Quantum Computation
Cited in
(24)- A multi-valued quantum fully homomorphic encryption scheme
- Secure delegated quantum algorithms for solving Mahalanobis distance
- Classical homomorphic encryption for quantum circuits
- Quantum multiparty cryptosystems based on a homomorphic random basis encryption
- Measurement-device-independent quantum homomorphic encryption
- Secure multi-party convex hull protocol based on quantum homomorphic encryption
- Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
- Homomorphic encryption of the \(k = 2\) Bernstein-Vazirani algorithm
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- Two-round quantum homomorphic encryption scheme based on matrix decomposition
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit
- Optimal symmetric ternary quantum encryption schemes
- Quantum fully homomorphic encryption with verification
- Quantum private query based on quantum homomorphic encryption with qubit rotation
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum circuit implementations of SM4 block cipher based on different gate sets
- Improved multiparty quantum private comparison based on quantum homomorphic encryption
- Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
- Practical multi-party quantum homomorphic encryption
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum attribute-based encryption: a comprehensive study
This page was built for publication: Quantum fully homomorphic encryption scheme based on universal quantum circuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496935)
