New Algorithms for Learning in Presence of Errors
From MaRDI portal
Publication:3012822
DOI10.1007/978-3-642-22006-7_34zbMath1332.68099OpenAlexW1760474993MaRDI QIDQ3012822
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_34
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)
Related Items (54)
On solving LPN using BKW and variants, Implementation and analysis ⋮ The Cryptographic Power of Random Selection ⋮ Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem ⋮ Cryptography from Learning Parity with Noise ⋮ Polly cracker, revisited ⋮ Homomorphic Encryption Standard ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ A dichotomy for local small-bias generators ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices ⋮ Making the BKW algorithm practical for LWE ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ 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 ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ On the hardness of module learning with errors with short distributions ⋮ 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 ⋮ On the asymptotic complexity of solving LWE ⋮ 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 ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ NTRU prime: reducing attack surface at low cost ⋮ On the complexity of the BKW algorithm on LWE ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ 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 ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ Generalized Learning Problems and Applications to Non-commutative Cryptography ⋮ On the success probability of solving unique SVP via BKZ ⋮ How (Not) to Instantiate Ring-LWE ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Unnamed Item ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Hardness of learning problems over Burnside groups of exponent 3 ⋮ Pseudorandom Functions: Three Decades Later ⋮ Homomorphic Encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More on average case vs approximation complexity
- Public-key cryptography from different assumptions
- Candidate One-Way Functions Based on Expander Graphs
- Efficient noise-tolerant learning from statistical queries
- Algebraic Cryptanalysis
- On Agnostic Learning of Parities, Monomials, and Halfspaces
- Hidden translation and orbit coset in quantum computing
- A Framework for Efficient and Composable Oblivious Transfer
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Lattice-based Cryptography
- On the Security of Goldreich’s One-Way Function
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
This page was built for publication: New Algorithms for Learning in Presence of Errors
