Practical multi-party quantum homomorphic encryption

DOI10.1016/j.tcs.2023.114067OpenAlexW4384459958WikidataQ122182271 ScholiaQ122182271MaRDI QIDQ6175520

Qin Li, Ling-li Chen, Lv Chen

Publication date: 18 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114067

zbMATH Keywords

quantum computationquantum votingquantum homomorphic encryption

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Symmetric quantum fully homomorphic encryption with perfect security
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Towards quantum-based privacy and voting
• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Quantum fully homomorphic encryption with verification
• Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Quantum Homomorphic Encryption for Polynomial-Sized Circuits
• Quantum One-Time Programs
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• A method for obtaining digital signatures and public-key cryptosystems
• Fully homomorphic encryption using ideal lattices
• Cryptographic Voting — A Gentle Introduction
• Reusable garbled circuits and succinct functional encryption
• Sumcheck-based delegation of quantum computing to rational server

This page was built for publication: Practical multi-party quantum homomorphic encryption