Pages that link to "Item:Q3012822"
From MaRDI portal
The following pages link to New Algorithms for Learning in Presence of Errors (Q3012822):
Displaying 50 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Polly cracker, revisited (Q285245) (← links)
- A dichotomy for local small-bias generators (Q315550) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem (Q2128750) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes (Q2817869) (← links)
- Parallel Implementation of BDD Enumeration for LWE (Q2822698) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- The Cryptographic Power of Random Selection (Q2889867) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- Generalized Learning Problems and Applications to Non-commutative Cryptography (Q3092369) (← links)
- On the Efficacy of Solving LWE by Reduction to Unique-SVP (Q3193270) (← links)
- Coded-BKW: Solving LWE Using Lattice Codes (Q3457103) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- Attacks on the Search RLWE Problem with Small Errors (Q4603026) (← links)
- (Q4612477) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Homomorphic Encryption Standard (Q5044564) (← links)
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials (Q6547993) (← links)
- A refined hardness estimation of LWE in two-step mode (Q6635818) (← links)
- The complexity of algebraic algorithms for LWE (Q6637336) (← links)
- Further improvements of the estimation of key enumeration with applications to solving LWE (Q6643252) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
