Publicly verifiable quantum homomorphic encryption based on quantum remote control
From MaRDI portal
Cites work
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Classical homomorphic encryption for quantum circuits
- Communication Theory of Secrecy Systems*
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption using ideal lattices
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum computation and quantum information. 10th anniversary edition
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Quantum fully homomorphic encryption with verification
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum homomorphic encryption for polynomial-sized circuits
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Quantum one-time programs. (Extended abstract)
- Reusable garbled circuits and succinct functional encryption
- Symmetric quantum fully homomorphic encryption with perfect security
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- The garden-hose model
- Verification of quantum computation: an overview of existing approaches
This page was built for publication: Publicly verifiable quantum homomorphic encryption based on quantum remote control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928700)
