The following pages link to (Q4341754):
Displaying 44 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- On the nonlinearity of monotone Boolean functions (Q1667447) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← 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)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← 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)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- An approach for stream ciphers design based on joint computing over random and secret data (Q2390944) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Covert learning: how to learn with an untrusted intermediary (Q2697884) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- Perfect Structure on the Edge of Chaos (Q2796138) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- FHEW with Efficient Multibit Bootstrapping (Q2946444) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- (Q4638056) (← links)
- A family of trapdoor ciphers (Q4639336) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- (Q5092472) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
