Quantum fully homomorphic encryption scheme based on universal quantum circuit
From MaRDI portal
Publication:496935
DOI10.1007/S11128-015-1034-9zbMATH Open1327.81163arXiv1410.2435OpenAlexW3123462502WikidataQ122467300 ScholiaQ122467300MaRDI QIDQ496935FDOQ496935
Authors: Min Liang 
Publication date: 23 September 2015
Published in: Quantum Information Processing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1410.2435
Recommendations
Cites Work
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Title not available (Why is that?)
- Demonstration of Blind Quantum Computing
- Universal Blind Quantum Computation
- (Leveled) fully homomorphic encryption without bootstrapping
- BLIND QUANTUM COMPUTATION
- Secure assisted quantum computation
- Moving Beyond Trust in Quantum Computing
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Symmetric quantum fully homomorphic encryption with perfect security
- Title not available (Why is that?)
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
Cited In (24)
- Measurement-device-independent quantum homomorphic encryption
- Quantum fully homomorphic encryption with verification
- Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Quantum private query based on quantum homomorphic encryption with qubit rotation
- Improved multiparty quantum private comparison based on quantum homomorphic encryption
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- A multi-valued quantum fully homomorphic encryption scheme
- Quantum fully homomorphic encryption scheme for cloud privacy data based on quantum circuit
- Secure delegated quantum algorithms for solving Mahalanobis distance
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- Quantum attribute-based encryption: a comprehensive study
- Quantum circuit implementations of SM4 block cipher based on different gate sets
- Homomorphic encryption of the \(k = 2\) Bernstein-Vazirani algorithm
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Two-round quantum homomorphic encryption scheme based on matrix decomposition
- Classical homomorphic encryption for quantum circuits
- Quantum multiparty cryptosystems based on a homomorphic random basis encryption
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
- Secure multi-party convex hull protocol based on quantum homomorphic encryption
- Practical multi-party quantum homomorphic encryption
- Optimal symmetric ternary quantum encryption schemes
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)
