Symmetric quantum fully homomorphic encryption with perfect security
From MaRDI portal
Publication:479359
DOI10.1007/S11128-013-0626-5zbMATH Open1303.81062arXiv1304.5087OpenAlexW1969408209WikidataQ121358650 ScholiaQ121358650MaRDI QIDQ479359FDOQ479359
Authors: Min Liang 
Publication date: 5 December 2014
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any -qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.
Full work available at URL: https://arxiv.org/abs/1304.5087
Recommendations
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- A multi-valued quantum fully homomorphic encryption scheme
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
quantum cryptographyhomomorphic encryptionquantum one-time padperfect securityprivacy-preserving quantum computing
Cites Work
- Fully homomorphic encryption using ideal lattices
- Quantum cryptography based on Bell’s theorem
- Title not available (Why is that?)
- Demonstration of Blind Quantum Computing
- Quantum cryptography: public key distribution and coin tossing
- Quantum Private Queries
- Quantum private comparison against decoherence noise
- Universal Blind Quantum Computation
- Efficient quantum private comparison employing single photons and collective detection
- New quantum private comparison protocol using EPR pairs
- Quantum private comparison protocol with \(d\)-dimensional Bell states
- BLIND QUANTUM COMPUTATION
- Secure assisted quantum computation
- Computing arbitrary functions of encrypted data
- On hiding information from an oracle
- Actively secure two-party evaluation of any quantum operation
- Moving Beyond Trust in Quantum Computing
- On constructing homomorphic encryption schemes from coding theory
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cited In (21)
- Measurement-device-independent quantum homomorphic encryption
- IND-secure quantum symmetric encryption based on point obfuscation
- 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
- Privacy-enhanced multi-user quantum private data query using partial quantum homomorphic encryption
- Secure delegated quantum algorithms for solving Mahalanobis distance
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- General impossibility of group homomorphic encryption in the quantum world
- Two-round quantum homomorphic encryption scheme based on matrix decomposition
- Quantum multiparty cryptosystems based on a homomorphic random basis encryption
- Invited Paper: Homomorphic Operations Techniques Yielding Communication Efficiency
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
- Practical multi-party quantum homomorphic encryption
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Optimal symmetric ternary quantum encryption schemes
This page was built for publication: Symmetric quantum fully homomorphic encryption with perfect security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479359)
