Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness

Craig Gentry

Published Jan 1, 2010• 182 citations
Publisher
DOI
10.1007/978-3-642-14623-7_7

Related papers

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption

Joël Alwen, Manuel Barbosa, Pooya Farshim +4 more

Lecture notes in computer science•Jan 1, 2013•41 citations

Quantum Fully Homomorphic Encryption with neither Clifford Gate Decomposition nor Real Representation

Guangsheng Ma, Hongbo Li

We present a novel quantum fully homomorphic encryption (QFHE) scheme, which allows to perform conditional rotations with the control bit in encrypted form. In our scheme, any quantum circuit can be directly evaluated with no need to decompose into Clifford/non-Clifford gates, nor to be transformed into real representation. Our scheme is able to evaluate quantum Fourier transform algorithm faster than previous QFHE schemes in the worst case. The security of our scheme relies on the hardness of the underlying quantum capable FHE scheme, and the latter sets its security on the learning with errors problem and the circular security assumption.

•Dec 8, 2020•0 citations

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption

Jonathan I. Katz, Aishwarya Thiruvengadam, Hong-Sheng Zhou

Lecture notes in computer science•Jan 1, 2013•19 citations

Classical Hardness of Learning with Errors

Zvika Brakerski, Adeline Roux-Langlois, Chris Peikert +2 more

We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.

arXiv:1306.0281•Jun 3, 2013•48 citations

Understanding integer-based fully homomorphic encryption

Sonam Mittal, K. R. Ramkumar

AIP conference proceedings•Jan 1, 2022•4 citations

Fully-Homomorphic Encryption from Lattice Isomorphism

Pedro Costa Branco, Giulio Malavolta, Zayd Maradni

Lecture notes in computer science•Dec 1, 2025•6 citations
We present a novel quantum fully homomorphic encryption (QFHE) scheme, which allows to perform conditional rotations with the control bit in encrypted form. In our scheme, any quantum circuit can be directly evaluated with no need to decompose into Clifford/non-Clifford gates, nor to be transformed into real representation. Our scheme is able to evaluate quantum Fourier transform algorithm faster than previous QFHE schemes in the worst case. The security of our scheme relies on the hardness of the underlying quantum capable FHE scheme, and the latter sets its security on the learning with errors problem and the circular security assumption.
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.