Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
From MaRDI portal
Publication:2115737
DOI10.1007/s10623-021-00993-2zbMath1487.81068OpenAlexW4206634505WikidataQ114849818 ScholiaQ114849818MaRDI QIDQ2115737
Qin Li, Haozhen Situ, Can Wang, Junyu Quan, Jiang Liu, Jin-Jing Shi
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00993-2
Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (3)
Secure delegated quantum algorithms for solving Mahalanobis distance ⋮ Practical multi-party quantum homomorphic encryption ⋮ Security analysis and improvement of a semi-quantum private comparison protocol with three-particle G-like states
Cites Work
- Unnamed Item
- Multiple-server flexible blind quantum computation in networks
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Quantum cryptography beyond quantum key distribution
- Efficient mediated semi-quantum key distribution
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Quantum encryption and generalized Shannon impossibility
- Quantum fully homomorphic encryption with verification
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
This page was built for publication: Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
