New Algorithms for Learning in Presence of Errors
From MaRDI portal
Recommendations
- Refined error bounds for several learning algorithms
- An algorithm for learning from erroneous and incorrigible examples
- Learning in the Presence of Malicious Errors
- Error learning behaviour and stability revisited
- On the concrete hardness of learning with errors
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Learning with errors in the exponent
- scientific article; zbMATH DE number 1495495
- Detecting and preventing error propagation via competitive learning
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Algebraic Cryptanalysis
- Candidate one-way functions based on expander graphs
- Efficient noise-tolerant learning from statistical queries
- Hidden translation and orbit coset in quantum computing
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- Lattice-based Cryptography
- More on average case vs approximation complexity
- Noise-tolerant learning, the parity problem, and the statistical query model
- On agnostic learning of parities, monomials, and halfspaces
- On lattices, learning with errors, random linear codes, and cryptography
- On the Security of Goldreich’s One-Way Function
- Public-key cryptography from different assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Cited in
(85)- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- On the asymptotic complexity of solving LWE
- NTRU prime: reducing attack surface at low cost
- An improved algorithm for learning sparse parities in the presence of noise
- Verifiable single-server private information retrieval from LWE with binary errors
- MPSign: a signature from small-secret middle-product learning with errors
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- On the success probability of solving unique SVP via BKZ
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Making the BKW algorithm practical for LWE
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Quantum algorithms for variants of average-case lattice problems via filtering
- Compressible FHE with applications to PIR
- On the complexity of the BKW algorithm on LWE
- Hardness of learning problems over Burnside groups of exponent 3
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Predicting the concrete security of LWE against the dual attack using binary search
- On the hardness of module learning with errors with short distributions
- BKW meets Fourier new algorithms for LPN with sparse parities
- On solving LPN using BKW and variants, Implementation and analysis
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem
- Homomorphic evaluation of lattice-based symmetric encryption schemes
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- How (not) to instantiate ring-LWE
- Towards sound fresh re-keying with hard (physical) learning problems
- Polly cracker, revisited
- The cryptographic power of random selection
- Cryptography from learning parity with noise
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- A practical post-quantum public-key cryptosystem based on spLWE
- Generalized learning problems and applications to non-commutative cryptography. (Extended abstract)
- A dichotomy for local small-bias generators
- On the efficacy of solving LWE by reduction to unique-SVP
- Coded-BKW: solving LWE using lattice codes
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- scientific article; zbMATH DE number 92608 (Why is no real title available?)
- Attacks on the Search RLWE Problem with Small Errors
- Detecting and preventing error propagation via competitive learning
- On the hardness of learning with errors with binary secrets
- Quantum hardness of learning shallow classical circuits
- Pseudorandom functions: three decades later
- Homomorphic encryption
- Homomorphic Encryption Standard
- XOR codes and sparse learning parity with noise
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Solving LWR via BDD Strategy: Modulus Switching Approach
- A polynomial time algorithm for breaking NTRU encryption with multiple keys
- Homomorphic encryption: a mathematical survey
- Non-interactive secure computation of inner-product from LPN and LWE
- Oblivious transfer with constant computational overhead
- Correlated pseudorandomness from expand-accumulate codes
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials
- A refined hardness estimation of LWE in two-step mode
- The complexity of algebraic algorithms for LWE
- Further improvements of the estimation of key enumeration with applications to solving LWE
- An algebraic algorithm for breaking NTRU with multiple keys
- Lossy cryptography from code-based assumptions
- A systematic study of sparse LWE
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- The quantum decoding problem
- LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
- A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli
- Improved lattice blind signatures from recycled entropy
- On the soundness of algebraic attacks against code-based assumptions
- On algebraic homomorphic encryption and its applications to doubly-efficient PIR
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- On the independence heuristic in the dual attack
- Memory-efficient BKW algorithm for solving the LWE problem
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Compact encryption based on Module-NTRU problems
- DAWN: smaller and faster NTRU encryption via double encoding
- SoK: on the security of cryptographic problems from linear algebra
- Cool + cruel = dual, and new benchmarks for sparse LWE
- Lattice EPID with efficient revocation
- Preliminary cryptanalysis of the Biscuit signature scheme
- Hardness of M-LWE with general distributions and applications to leaky variants
- A BKW-style solver for the restricted syndrome decoding problem
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
This page was built for publication: New Algorithms for Learning in Presence of Errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012822)
