Symmetric quantum fully homomorphic encryption with perfect security
From MaRDI portal
Publication:479359
DOI10.1007/s11128-013-0626-5zbMath1303.81062arXiv1304.5087OpenAlexW1969408209WikidataQ121358650 ScholiaQ121358650MaRDI QIDQ479359
Publication date: 5 December 2014
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.5087
quantum cryptographyhomomorphic encryptionquantum one-time padperfect securityprivacy-preserving quantum computing
Related Items (16)
Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security ⋮ Quantum private query based on quantum homomorphic encryption with qubit rotation ⋮ Quantum multiparty cryptosystems based on a homomorphic random basis encryption ⋮ Improved multiparty quantum private comparison based on quantum homomorphic encryption ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ Secure delegated quantum algorithms for solving Mahalanobis distance ⋮ Practical multi-party quantum homomorphic encryption ⋮ Two-round quantum homomorphic encryption scheme based on matrix decomposition ⋮ Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing ⋮ Quantum fully homomorphic encryption scheme based on universal quantum circuit ⋮ Privacy-enhanced multi-user quantum private data query using partial quantum homomorphic encryption ⋮ Optimal symmetric ternary quantum encryption schemes ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum private comparison against decoherence noise
- New quantum private comparison protocol using EPR pairs
- Quantum cryptography: public key distribution and coin tossing
- On hiding information from an oracle
- Quantum private comparison protocol with \(d\)-dimensional Bell states
- Efficient quantum private comparison employing single photons and collective detection
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Moving Beyond Trust in Quantum Computing
- Demonstration of Blind Quantum Computing
- On Constructing Homomorphic Encryption Schemes from Coding Theory
- Quantum Private Queries
- BLIND QUANTUM COMPUTATION
- Computing arbitrary functions of encrypted data
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Quantum cryptography based on Bell’s theorem
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Symmetric quantum fully homomorphic encryption with perfect security