Classical Homomorphic Encryption for Quantum Circuits
From MaRDI portal
Publication:3387755
DOI10.1137/18M1231055zbMath1457.81026arXiv1708.02130WikidataQ121603510 ScholiaQ121603510MaRDI QIDQ3387755
Publication date: 13 January 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.02130
Quantum computation (81P68) Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (8)
Constant-round blind classical verification of quantum sampling ⋮ Delegating quantum computation in the quantum random oracle model ⋮ Classical Verification of Quantum Computations ⋮ Homomorphic encryption: a mathematical survey ⋮ Simple tests of quantumness also certify qubits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches
Cites Work
- Unnamed Item
- Quantum FHE (almost) as secure as classical
- New bounds in some transference theorems in the geometry of numbers
- Qfactory: classically-instructed remote secret qubits preparation
- A Decade of Lattice Cryptography
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice-based FHE as secure as PKE
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Trapdoors for hard lattices and new cryptographic constructions
- Pseudorandomness of ring-LWE for any ring and modulus
- Post-quantum zero knowledge in constant rounds
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Classical Homomorphic Encryption for Quantum Circuits
