Pages that link to "Item:Q4612477"
From MaRDI portal
The following pages link to On the hardness of learning with errors with binary secrets (Q4612477):
Displaying 19 items.
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Revisiting the hardness of binary error LWE (Q2030882) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Lattice Decoding Attacks on Binary LWE (Q5170784) (← links)
- Classical hardness of learning with errors (Q5495828) (← links)
- Entropic hardness of Module-LWE from module-NTRU (Q6169458) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- Lattice-Based Secure Biometric Authentication for Hamming Distance (Q6488402) (← links)
- Sequential half-aggregation of lattice-based signatures (Q6550626) (← links)
- On the multi-user security of LWE-based NIKE (Q6587945) (← links)
- SoK: learning with errors, circular security, and fully homomorphic encryption (Q6635900) (← links)
- The complexity of algebraic algorithms for LWE (Q6637336) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
- Revocable policy-based chameleon hash using lattices (Q6657367) (← links)
