Pages that link to "Item:Q5899519"
From MaRDI portal
The following pages link to Noise-tolerant learning, the parity problem, and the statistical query model (Q5899519):
Displaying 50 items.
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- On learning from queries and counterexamples in the presence of noise (Q751304) (← links)
- Boolean ring cryptographic equation solving (Q832346) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- A new birthday-type algorithm for attacking the fresh re-keying countermeasure (Q1739216) (← links)
- Learning parities in the mistake-bound model (Q1944027) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- On the robustness of learning parity with noise (Q1989525) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem (Q2128750) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- A subexponential-time, polynomial quantum space algorithm for inverting the CM group action (Q2191211) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field (Q2215268) (← links)
- Security estimates of a ring-LWE symmetric cryptosystem against chosen plaintext attack (Q2215308) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Key-recovery attacks on \(\mathsf{ASASA}\) (Q2413617) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Sample-size-reduction of quantum states for the noisy linear problem (Q2682658) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- (Q2771835) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
- Algorithms for the approximate common divisor problem (Q2970999) (← links)
- (Q2994258) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
