The following pages link to A decade of lattice cryptography (Q2808276):
Displaying 36 items.
- Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption (Q5267417) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation (Q6108614) (← links)
- A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
- Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6114265) (← links)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities (Q6122595) (← links)
- Subfield attacks on HSVP in ideal lattices (Q6134036) (← links)
- On module unique-SVP and NTRU (Q6135456) (← links)
- Classical Homomorphic Encryption for Quantum Circuits (Q6139825) (← links)
- An Efficient Algorithm for Integer Lattice Reduction (Q6154950) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- Lattice-Based Proof of a Shuffle (Q6166544) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- Entropic hardness of Module-LWE from module-NTRU (Q6169458) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)
- A Secure Algorithm for Rounded Gaussian Sampling (Q6488039) (← links)
- Construction-D lattice from Garcia–Stichtenoth tower code (Q6499093) (← links)
- Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices (Q6535098) (← links)
- Tightly secure lattice identity-based signature in the quantum random oracle model (Q6535493) (← links)
- Modular design of KEM-based authenticated key exchange (Q6535501) (← links)
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions (Q6556534) (← links)
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
- Minkowski's successive minima in convex and discrete geometry (Q6594637) (← links)
- On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes (Q6594646) (← links)
- Algebraically structured LWE, revisited (Q6595844) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- A refined hardness estimation of LWE in two-step mode (Q6635818) (← links)
- On algebraic embedding for unstructured lattices (Q6635822) (← links)
- Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model (Q6637579) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6655869) (← links)
- On the quantum security of high-dimensional RSA protocol (Q6657369) (← links)
- A new R-LWE based digital signature scheme (Q6665869) (← links)
