The following pages link to Damien Stehlé (Q778972):
Displayed 50 items.
- Towards practical GGM-based PRF from (module-)learning-with-rounding (Q778973) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Middle-product Learning with Errors (Q1675205) (← links)
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE (Q1675207) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Learning with errors and extrapolated dihedral cosets (Q1753874) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security (Q2055676) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- An LLL algorithm for module lattices (Q2176639) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
- Approx-SVP in ideal lattices with pre-processing (Q2292889) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance (Q2811123) (← links)
- Sanitization of FHE Ciphertexts (Q2820487) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- Lattice-Based Group Signatures with Logarithmic Signature Size (Q2867145) (← links)
- Hardness of k-LWE and Applications in Traitor Tracing (Q2874512) (← links)
- H-LLL (Q2883828) (← links)
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Low-dimensional lattice basis reduction revisited (Q2930273) (← links)
- Cryptanalysis of the Multilinear Map over the Integers (Q2948321) (← links)
- Fully Homomophic Encryption over the Integers Revisited (Q2948342) (← links)
- A new view on HJLS and PSLQ (Q2963228) (← links)
- Tuple lattice sieving (Q2971007) (← links)
- Faster LLL-type Reduction of Lattice Bases (Q2985850) (← links)
- Semantically Secure Lattice Codes for the Gaussian Wiretap Channel (Q2986109) (← links)
- Decoding by Embedding: Correct Decoding Radius and DMT Optimality (Q2989264) (← links)
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Faster Fully Homomorphic Encryption (Q3058667) (← links)
- Rigorous Perturbation Bounds of Some Matrix Factorizations (Q3079774) (← links)
- Searching worst cases of a one-variable function using lattice reduction (Q3417011) (← links)
- LLL reducing with the most significant bits (Q3452418) (← links)
- BREAKING LITTLEWOOD'S CIPHER (Q3452629) (← links)
- An LLL Algorithm with Quadratic Complexity (Q3575152) (← links)
- Accelerating Lattice Reduction with FPGAs (Q3584979) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm (Q3612549) (← links)
- Handbook of Floating-Point Arithmetic (Q3629031) (← links)
- Efficient Public Key Encryption Based on Ideal Lattices (Q3650717) (← links)
- (Q4598216) (← links)
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications (Q4916004) (← links)
- Short Bases of Lattices over Number Fields (Q4931647) (← links)