Pages that link to "Item:Q2176637"
From MaRDI portal
The following pages link to Collision resistant hashing from sub-exponential learning parity with noise (Q2176637):
Displaying 9 items.
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application (Q6618581) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
