Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Learning with errors
OpenAlex ID:
C2779014939
Homomorphic Encryption for Arithmetic of Approximate Numbers
2017
·
Jung Hee Cheon
, Andrey Kim
, et al.
·
Lecture notes in computer science
·
3,499
On lattices, learning with errors, random linear codes, and cryptography
2009
·
Oded Regev
·
Journal of the ACM
·
3,063
PDF
On lattices, learning with errors, random linear codes, and cryptography
2005
·
Oded Regev
·
ACM Symposium on Theory of Computing (STOC)
·
2,955
Evaluating 2-DNF Formulas on Ciphertexts
2005
·
Dan Boneh
, Eu-Jin Goh
, et al.
·
Lecture notes in computer science
·
1,918
(Leveled) Fully Homomorphic Encryption without Bootstrapping
2014
·
Zvika Brakerski
, Craig Gentry
, et al.
·
ACM Transactions on Computation Theory
·
1,879
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
2013
·
Craig Gentry
, Amit Sahai
, et al.
·
Lecture notes in computer science
·
1,852
Efficient Fully Homomorphic Encryption from (Standard) LWE
2011
·
Zvika Brakerski
, Vinod Vaikuntanathan
·
Annual Symposium on Foundations of Computer Science
·
1,676
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
2018
·
Joppe Bos
, Leo Ducas
, et al.
·
IEEE European Symposium on Security and Privacy
·
1,653
PDF
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
2011
·
Zvika Brakerski
, Vinod Vaikuntanathan
·
Lecture notes in computer science
·
1,324
On the concrete hardness of Learning with Errors
2015
·
Martin R. Albrecht
, Rachel Player
, et al.
·
Journal of Mathematical Cryptology
·
1,141
Efficient Lattice (H)IBE in the Standard Model
2010
·
Shweta Agrawal
, Dan Boneh
, et al.
·
Lecture notes in computer science
·
1,107
PDF
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
2011
·
Craig Gentry
, Shai Halevi
·
Lecture notes in computer science
·
1,085
On Ideal Lattices and Learning with Errors over Rings
2013
·
Vadim Lyubashevsky
, Chris Peikert
, et al.
·
Journal of the ACM
·
1,054
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
2016
·
Ilaria Chillotti
, Nicolas Gama
, et al.
·
Lecture notes in computer science
·
941
Worst-case to average-case reductions for module lattices
2014
·
Adeline Langlois
, Damien Stehlé
·
Designs Codes and Cryptography
·
847
Better Key Sizes (and Attacks) for LWE-Based Encryption
2011
·
Richard Lindner
, Chris Peikert
·
Lecture notes in computer science
·
846
A Decade of Lattice Cryptography
2016
·
Chris Peikert
·
Foundations and Trends® in Theoretical Computer Science
·
791
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
1994
·
Michael Kearns
, Leslie Valiant
·
ACM eBooks
·
781
PDF
Classical hardness of learning with errors
2013
·
Zvika Brakerski
, Adeline Langlois
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
767
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
2014
·
Zvika Brakerski
, Vinod Vaikuntanathan
·
SIAM Journal on Computing
·
703
PDF
Post-quantum key exchange - a new hope.
2015
·
Erdem Alkım
, Léo Ducas
, et al.
·
IACR Cryptology ePrint Archive
·
586
A Full RNS Variant of Approximate Homomorphic Encryption
2019
·
Jung Hee Cheon
, Kyoohyung Han
, et al.
·
Lecture notes in computer science
·
560
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
2014
·
Dan Boneh
, Craig Gentry
, et al.
·
Lecture notes in computer science
·
548
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
2011
·
Damien Stehlé
, Ron Steinfeld
·
Lecture notes in computer science
·
542
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
2011
·
Jean-Sébastien Coron
, Avradip Mandal
, et al.
·
Lecture notes in computer science
·
533
PDF
Show more works
View as search
Works count:
2,826
Citation count:
75,630
Year
Topic
Type