Keyword

learning with errors

Description: A computational problem involving noisy linear equations over finite rings, used as a presumed-hard foundation for lattice-based cryptography.

Primary topic: Cryptography and Data Security (84%)

Wikidata ID: wiki/Q6510239

OpenAlex ID: keywords/learning-with-errors

On lattices, learning with errors, random linear codes, and cryptography

2005 · Oded Regev · ACM Symposium on Theory of Computing (STOC) · 2,358

On lattices, learning with errors, random linear codes, and cryptography

2009 · Oded Regev · Journal of the ACM · 2,300

On Ideal Lattices and Learning with Errors over Rings

2010 · Vadim Lyubashevsky, Chris Peikert, et al. · Lecture notes in computer science · 1,902

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,532

Efficient Fully Homomorphic Encryption from (Standard) LWE

2011 · Zvika Brakerski, Vinod Vaikuntanathan · Annual Symposium on Foundations of Computer Science · 1,465

(Leveled) Fully Homomorphic Encryption without Bootstrapping

2014 · Zvika Brakerski, Craig Gentry, et al. · ACM Transactions on Computation Theory · 1,435

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

2012 · Zvika Brakerski · Lecture notes in computer science · 1,278

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

2012 · Daniele Micciancio, Chris Peikert · Lecture notes in computer science · 1,267

Somewhat Practical Fully Homomorphic Encryption.

2012 · Junfeng Fan, Fréderik Vercauteren · 1,181

Efficient Lattice (H)IBE in the Standard Model

2010 · Shweta Agrawal, Dan Boneh, et al. · Lecture notes in computer science · 1,017

PDF

On the concrete hardness of Learning with Errors

2015 · Martin R. Albrecht, Rachel Player, et al. · Journal of Mathematical Cryptology · 869

Lattice Signatures without Trapdoors

2012 · Vadim Lyubashevsky · Lecture notes in computer science · 868

On Ideal Lattices and Learning with Errors over Rings

2013 · Vadim Lyubashevsky, Chris Peikert, et al. · Journal of the ACM · 840

Public-key cryptosystems from the worst-case shortest vector problem

2009 · Chris Peikert · ACM Symposium on Theory of Computing (STOC) · 821

Better Key Sizes (and Attacks) for LWE-Based Encryption

2011 · Richard Lindner, Chris Peikert · Lecture notes in computer science · 704

Lossy Trapdoor Functions and Their Applications

2008 · Chris Peikert, Brent Waters · SIAM Journal on Computing · 651

Worst-case to average-case reductions for module lattices

2014 · Adeline Langlois, Damien Stehlé · Designs Codes and Cryptography · 647

Classical hardness of learning with errors

2013 · Zvika Brakerski, Adeline Langlois, et al. · ACM Symposium on Theory of Computing (STOC) · 646

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

2009 · Benny Applebaum, David Cash, et al. · Lecture notes in computer science · 570

PDF

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

2014 · Zvika Brakerski, Vinod Vaikuntanathan · SIAM Journal on Computing · 539

A Decade of Lattice Cryptography

2016 · Chris Peikert · Foundations and Trends® in Theoretical Computer Science · 517

Pseudorandom Functions and Lattices

2012 · Abhishek Banerjee, Chris Peikert, et al. · Lecture notes in computer science · 479

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

2014 · Dan Boneh, Craig Gentry, et al. · Lecture notes in computer science · 471

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

2012 · Gilad Asharov, Abhishek Jain, et al. · Lecture notes in computer science · 464

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

2012 · Anja Becker, Antoine Joux, et al. · Lecture notes in computer science · 401

Works count: 2,338

Citation count: 56,550