The Learning with Errors Problem (Invited Survey)

No abstract is available for this paper.

• Publication year

  2010

• Venue

  2010 IEEE 25th Annual Conference on Computational Complexity

• Publication date

  2010-06-09

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/CCC.2010.26
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Public-Key Encryption Schemes with Auxiliary Inputs

  2010cited by this paper
• Robustness of the Learning with Errors Assumption

  2010cited by this paper
• Cryptographic Functions from Worst-Case Complexity Assumptions

  2010cited by this paper
• Efficient Lattice (H)IBE in the Standard Model

  2010cited by this paper
• Bonsai Trees, or How to Delegate a Lattice Basis

  2010cited by this paper
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

  2010cited by this paper
• Efficient Public Key Encryption Based on Ideal Lattices

  2009influential reference
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

  2009influential reference
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks

  2009cited by this paper
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

  2009cited by this paper
• Some Recent Progress in Lattice-Based Cryptography

  2009cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009influential reference
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

  2009cited by this paper
• Lossy trapdoor functions and their applications

  2008cited by this paper
• Trapdoors for hard lattices and new cryptographic constructions

  2008influential reference
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

  2008cited by this paper
• SWIFFT: A Modest Proposal for FFT Hashing

  2008cited by this paper
• How to Encrypt with the LPN Problem

  2008cited by this paper
• Lattice-Based Identification Schemes Secure Under Active Attacks

  2008cited by this paper
• The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence

  2007cited by this paper
• Generalized Compact Knapsacks Are Collision Resistant

  2006cited by this paper
• Cryptographic Hardness for Learning Intersections of Halfspaces

  2006cited by this paper
• Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

  2006cited by this paper
• Multi-bit Cryptosystems Based on Lattice Problems

  2006cited by this paper
• On Bounded Distance Decoding for General Lattices

  2006cited by this paper
• Representing hard lattices with O(n log n) bits

  2005cited by this paper
• The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem

  2005cited by this paper
• Authenticating Pervasive Devices with Human Protocols

  2005cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005influential reference
• Lattice problems in NP ∩ coNP

  2005cited by this paper
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• New lattice based cryptographic constructions

  2003influential reference
• Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More

  2003cited by this paper
• More on Average Case vs Approximation Complexity

  2003cited by this paper
• Relations between average case complexity and approximation complexity

  2002cited by this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002cited by this paper
• Secure Human Identification Protocols

  2001cited by this paper
• A sieve algorithm for the shortest lattice vector problem

  2001cited by this paper
• On the Limits of Nonapproximability of Lattice Problems

  2000cited by this paper
• Noise-tolerant learning, the parity problem, and the statistical query model

  2000cited by this paper
• The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications

  1999cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem

  1997cited by this paper
• A public-key cryptosystem with worst-case/average-case equivalence

  1997cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Collision-Free Hashing from Lattice Problems

  1996cited by this paper
• Cryptographic Primitives Based on Hard Learning Problems

  1993cited by this paper
• How to recycle random bits

  1989cited by this paper
• SRI International

  1982influential reference
• Factoring polynomials with rational coefficients

  1982cited by this paper
• Factoring polynomials with rational coeficients

  1982cited by this paper

• Structured Module Lattice-based Cryptography

  2026cites this paper
• Hybrid Consensus with Quantum Sybil Resistance

  2026cites this paper
• Security Guidelines for Implementing Homomorphic Encryption

  2025cites this paper
• A Quantum-Resistant Advanced Metering Infrastructure

  2025cites this paper
• HELP: Everlasting Privacy through Server-Aided Randomness

  2025cites this paper
• AI-Driven Post-Quantum Cryptography for Cyber-Resilient V2X Communication in Transportation Cyber-Physical Systems

  2025cites this paper
• Two-stage reversible data hiding in encrypted domain with public key embedding mechanism

  2025cites this paper
• Candidate Matchmaking Encryption from Attribute-Based Encryption Schemes

  2025cites this paper
• (Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices

  2025cites this paper
• NoMod: A Non-modular Attack on Module Learning With Errors

  2025cites this paper
• FucoPVA: An Efficient Video Analytics Framework with Full-Content Privacy Preservation

  2025cites this paper
• CRT representation of LWE Based TFHE

  2025cites this paper
• TAPAS: Datasets for Learning the Learning with Errors Problem

  2025cites this paper
• Toward owner governance in genomic data privacy with Governome

  2025cites this paper
• Publicly Verifiable Secret Sharing: Generic Constructions and Lattice-Based Instantiations in the Standard Model

  2025cites this paper
• Designs for practical SHE schemes based on Ring-LWR

  2025cites this paper
• EFFACT: A Highly Efficient Full-Stack FHE Acceleration Platform

  2025cites this paper
• FrodoKEM based on multicore implementation: enhancing performance and memory efficiency in IoT applications

  2025cites this paper
• FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism

  2025cites this paper
• Privacy Preserving Healthcare Based on Secure Mathematical Foundations of Fully Homomorphic Encryption (FHE)

  2025cites this paper
• The cost of unmodeled biological complexity in artificial neural networks

  2025cites this paper
• Security Analysis of Integer Learning with Errors with Rejection Sampling

  2025cites this paper
• Obfuscated Quantum and Post-Quantum Cryptography

  2025cites this paper
• Efficient Homomorphically Encrypted Convolutional Neural Network Without Rotation

  2024cites this paper
• Privacy Preserving Approximated Optimal Control of Pasteurization Unit Using Homomorphic Encryption

  2024cites this paper
• BRAKE: Biometric Resilient Authenticated Key Exchange

  2024cites this paper
• Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH

  2024cites this paper
• CP-ABE-LWE-Based Smart Contract: A Novel Post-Quantum Smart Contract-Based Decentralized Application (DApp) for E-Health Records Management

  2024cites this paper
• Learning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography

  2024cites this paper
• A Central Limit Approach for Ring-LWE Noise Analysis

  2024cites this paper
• Implementatión de una Multiplicación de Polinomios óptima basada en Karatsuba Utilizando un ARM Cortex-A72

  2024cites this paper
• Ultra-secure storage and analysis of genetic data for the advancement of precision medicine

  2024cites this paper
• Hardware Implementation of K2RED and Plantard Modular Multiplication Algorithms in Post-Quantum Cryptography

  2024cites this paper
• GMS: an efficient fully homomorphic encryption scheme for secure outsourced matrix multiplication

  2024cites this paper
• Efficient Laconic Cryptography from Learning With Errors

  2023cites this paper
• Extending quantum key distribution through proxy re-encryption

  2023cites this paper
• Quantum algorithmic solutions to the shortest vector problem on simulated coherent Ising machines

  2023cites this paper
• Accuracy-Tweakable Federated Learning with Minimal Interruption

  2023cites this paper
• A Distributed EMR Data Storage Scheme Based on LWE

  2023cites this paper
• Fully Homomorphic Encryption with Applications to Privacy-Preserving Machine Learning

  2023influential citation
• Streaming quantum state purification

  2023cites this paper
• Lessons Learned: Building a Privacy-Preserving Entity Resolution Adaptation of PPJoin using End-to-End Homomorphic Encryption

  2023cites this paper
• Learning with Physical Rounding for Linear and Quadratic Leakage Functions

  2023cites this paper
• A Novel CCA Attack for NTRU+ KEM

  2023cites this paper
• Post Quantum Implications on Private and Public Key Cryptography

  2023cites this paper
• MPC-Mimicking Neural Network Based on Homomorphic Encryption

  2023influential citation
• Privacy-preserving Decision Making Based on Q-Learning in Cloud Computing

  2022cites this paper
• Enhancing Ring-LWE Hardness using Dedekind Index Theorem

  2022influential citation
• Practical Quantum-Safe Voting from Lattices, Extended

  2022cites this paper
• The Feasibility of the CRYSTALS-Kyber Scheme for Smart Metering Systems

  2022cites this paper
• A System-on-a-Chip Implementation of a Post-Quantum Cryptography Scheme for Smart Meter Data Communications

  2022influential citation
• Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems

  2022cites this paper
• Evaluating the Feasibility of a Provably Secure Privacy-Preserving Entity Resolution Adaptation of PPJoin using Homomorphic Encryption

  2022cites this paper
• HybridPKE: A forward-secure non-interactive quantum-safe hybrid key exchange scheme

  2022cites this paper
• An Homomorphic Logistic Regression Inference Implementation

  2022cites this paper
• AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE

  2022cites this paper
• Concrete Analysis of Approximate Ideal-SIVP to Decision Ring-LWE Reduction

  2022cites this paper
• A survey on NIST PQ signatures

  2021cites this paper
• Technical Committee on Intelligent Control [Technical Activities]

  2021cites this paper
• Fortis-ámyna-smart contract model for cross border financial transactions

  2021cites this paper
• PCPs and Instance Compression from a Cryptographic Lens

  2021cites this paper
• The Case for SIKE: A Decade of the Supersingular Isogeny Problem

  2021cites this paper
• Replacing Probability Distributions in Security Games via Hellinger Distance

  2021cites this paper
• Lower bounds on lattice sieving and information set decoding

  2021cites this paper
• Lossless fuzzy extractor enabled secure authentication using low entropy noisy sources

  2021cites this paper
• Dual lattice attacks for closest vector problems (with preprocessing)

  2021cites this paper
• Code Offset in the Exponent

  2021cites this paper
• Learning Parity with Physical Noise: Imperfections, Reductions and FPGA Prototype

  2021cites this paper
• Side-Channel Analysis of CRYSTALS-Kyber and A Novel Low-Cost Countermeasure

  2021cites this paper
• Pro Cryptography and Cryptanalysis: Creating Advanced Algorithms with C# and .NET

  2021cites this paper
• Specifications and improvements of LPN solving algorithms

  2020cites this paper
• Risks and Security of Internet and Systems: 14th International Conference, CRiSIS 2019, Hammamet, Tunisia, October 29–31, 2019, Proceedings

  2020cites this paper
• A Descriptive Study on Homomorphic Encryption Schemes for Enhancing Security in Fog Computing

  2020cites this paper
• An automatic analysis approach toward indistinguishability of sampling on the LWE problem

  2020cites this paper
• Information Security Theory and Practice: 13th IFIP WG 11.2 International Conference, WISTP 2019, Paris, France, December 11–12, 2019, Proceedings

  2020cites this paper
• Post Quantum Secure Command and Control of Mobile Agents Inserting quantum-resistant encryption schemes in the Secure Robot Operating System

  2020cites this paper
• Encrypted Control for Networked Systems: An Illustrative Introduction and Current Challenges

  2020cites this paper
• Post-Quantum Cryptography: 11th International Conference, PQCrypto 2020, Paris, France, April 15–17, 2020, Proceedings

  2020influential citation
• Learning with Physical Noise or Errors

  2020cites this paper
• Universal location referencing and homomorphic evaluation of geospatial query

  2020cites this paper
• LUSA: the HPC library for lattice-based cryptanalysis

  2020cites this paper
• Cryptanalysis on Attribute-Based Encryption from Ring-Learning with Error (R-LWE)

  2020cites this paper
• Revisiting the Hardness of Binary Error LWE

  2020cites this paper
• A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields

  2020cites this paper
• Distributed Additive Encryption and Quantization for Privacy Preserving Federated Deep Learning

  2020cites this paper
• Outcome indistinguishability

  2020cites this paper
• Multi-instance iris remote authentication using private multi-class perceptron on malicious cloud server

  2020cites this paper
• INAKA: Improved Authenticated Key Agreement Protocol Based on Newhope

  2020cites this paper
• Defeating NewHope with a Single Trace

  2020cites this paper
• Towards Privacy-Preserving Deep Learning: Opportunities and Challenges

  2020cites this paper
• Quantum Copy-Protection from Hidden Subspaces

  2020cites this paper
• From discrete-log to lattices: maybe the real lessons were our broken schemes along the way?

  2020cites this paper
• Secure Computation on the SAP Cloud Platform

  2020cites this paper
• Efficient NewHope Cryptography Based Facial Security System on a GPU

  2020cites this paper
• Post Quantum Learning With Errors Problem Based Key Encapsulation Protocols and Matrix Vector Product

  2019cites this paper
• δ-subgaussian Random Variables in Cryptography

  2019cites this paper
• Algebraically Structured LWE, Revisited

  2019cites this paper
• Hardness of Decoding Random Linear Codes in the Exponent Luke Demarest

  2019cites this paper
• Fault Sensitivity Analysis of Lattice-Based Post-Quantum Cryptographic Components

  2019cites this paper
• A Lattice-based Enhanced Privacy ID

  2019cites this paper