Pages that link to "Item:Q5895204"
From MaRDI portal
The following pages link to Noise-tolerant learning, the parity problem, and the statistical query model (Q5895204):
Displayed 36 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Noisy Simon period finding (Q826245) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Solving systems of linear Boolean equations with noisy right-hand sides over the reals (Q1744342) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Dummy shuffling against algebraic attacks in white-box implementations (Q2056730) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- Learning from positive and unlabeled examples (Q2581364) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- (Q4638056) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
- On the advantage over a random assignment (Q5894908) (← links)
- Learning nonsingular phylogenies and hidden Markov models (Q5901107) (← links)
- Pseudorandom correlation functions from variable-density LPN, revisited (Q6067361) (← links)
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice (Q6083669) (← links)
- Solving the learning parity with noise problem using quantum algorithms (Q6103086) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Correlated pseudorandomness from the hardness of quasi-abelian decoding (Q6190123) (← links)