default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Stehlé
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Jung Hee Cheon, Hyeongmin Choe, Julien Devevey, Tim Güneysu, Dongyeon Hong, Markus Krausz, Georg Land, Marc Möller, Damien Stehlé, MinJune Yi:
HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(3): 25-75 (2024)- [c73]Jung Hee Cheon
, Hyeongmin Choe, Alain Passelègue, Damien Stehlé, Elias Suvanto:
Attacks Against the IND-CPAD Security of Exact FHE Schemes. CCS 2024: 2505-2519 - [c72]Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé:
Fast and Accurate Homomorphic Softmax Evaluation. CCS 2024: 4391-4404 - [c71]Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé:
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. CRYPTO (3) 2024: 387-421 - [c70]Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, Damien Stehlé:
Bootstrapping Bits with CKKS. EUROCRYPT (2) 2024: 94-123 - [c69]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. STOC 2024: 423-434 - [i66]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. CoRR abs/2401.03807 (2024) - [i65]Wonhee Cho, Guillaume Hanrot, Taeseong Kim, Minje Park, Damien Stehlé:
Fast and Accurate Homomorphic Softmax Evaluation. CoRR abs/2410.11184 (2024) - [i64]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. IACR Cryptol. ePrint Arch. 2024: 30 (2024) - [i63]Jung Hee Cheon, Hyeongmin Choe, Alain Passelègue, Damien Stehlé, Elias Suvanto:
Attacks Against the INDCPA-D Security of Exact FHE Schemes. IACR Cryptol. ePrint Arch. 2024: 127 (2024) - [i62]Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, Damien Stehlé:
Bootstrapping Bits with CKKS. IACR Cryptol. ePrint Arch. 2024: 767 (2024) - [i61]Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé:
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. IACR Cryptol. ePrint Arch. 2024: 1284 (2024) - [i60]Youngjin Bae, Jaehyung Kim, Damien Stehlé, Elias Suvanto:
Bootstrapping Small Integers With CKKS. IACR Cryptol. ePrint Arch. 2024: 1637 (2024) - 2023
- [c68]Julien Devevey, Alain Passelègue, Damien Stehlé:
G+G: A Fiat-Shamir Lattice Signature Based on Convolved Gaussians. ASIACRYPT (7) 2023: 37-64 - [c67]Calvin Abou Haidar, Alain Passelègue, Damien Stehlé:
Efficient Updatable Public-Key Encryption from Lattices. ASIACRYPT (5) 2023: 342-373 - [c66]Jung Hee Cheon, Wonhee Cho, Jaehyung Kim, Damien Stehlé:
Homomorphic Multiple Precision Multiplication for CKKS and Reduced Modulus Consumption. CCS 2023: 696-710 - [c65]Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, Jai Hyun Park, Damien Stehlé:
HERMES: Efficient Ring Packing Using MLWE Ciphertexts and Application to Transciphering. CRYPTO (4) 2023: 37-69 - [c64]Julien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé:
A Detailed Analysis of Fiat-Shamir with Aborts. CRYPTO (5) 2023: 327-357 - [c63]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski:
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. TCC (4) 2023: 63-92 - [i59]Julien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé:
A Detailed Analysis of Fiat-Shamir with Aborts. IACR Cryptol. ePrint Arch. 2023: 245 (2023) - [i58]Jung Hee Cheon, Hyeongmin Choe, Julien Devevey, Tim Güneysu, Dongyeon Hong, Markus Krausz, Georg Land, Marc Möller, Damien Stehlé, MinJune Yi:
HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures. IACR Cryptol. ePrint Arch. 2023: 624 (2023) - [i57]Youngjin Bae, Jung Hee Cheon, Jaehyung Kim, Jai Hyun Park, Damien Stehlé:
HERMES: Efficient Ring Packing using MLWE Ciphertexts and Application to Transciphering. IACR Cryptol. ePrint Arch. 2023: 1244 (2023) - [i56]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski:
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. IACR Cryptol. ePrint Arch. 2023: 1370 (2023) - [i55]Calvin Abou Haidar, Alain Passelègue, Damien Stehlé:
Efficient Updatable Public-Key Encryption from Lattices. IACR Cryptol. ePrint Arch. 2023: 1400 (2023) - [i54]Julien Devevey, Alain Passelègue, Damien Stehlé:
G+G: A Fiat-Shamir Lattice Signature Based on Convolved Gaussians. IACR Cryptol. ePrint Arch. 2023: 1477 (2023) - [i53]Jung Hee Cheon, Wonhee Cho, Jaehyung Kim, Damien Stehlé:
Homomorphic Multiple Precision Multiplication for CKKS and Reduced Modulus Consumption. IACR Cryptol. ePrint Arch. 2023: 1788 (2023) - 2022
- [c62]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. ASIACRYPT (4) 2022: 34-64 - [c61]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé:
On Module Unique-SVP and NTRU. ASIACRYPT (3) 2022: 709-740 - [c60]Shweta Agrawal, Elena Kirshanova, Damien Stehlé, Anshu Yadav:
Practical, Round-Optimal Lattice-Based Blind Signatures. CCS 2022: 39-53 - [c59]Shweta Agrawal, Damien Stehlé, Anshu Yadav:
Round-Optimal Lattice-Based Threshold Signatures, Revisited. ICALP 2022: 8:1-8:20 - [i52]Olivier Blazy, Sayantan Mukherjee, Huyen Nguyen, Duong Hieu Phan, Damien Stehlé:
An Anonymous Trace-and-Revoke Broadcast Encryption Scheme. IACR Cryptol. ePrint Arch. 2022: 307 (2022) - [i51]Shweta Agrawal, Damien Stehlé, Anshu Yadav:
Round-Optimal Lattice-Based Threshold Signatures, Revisited. IACR Cryptol. ePrint Arch. 2022: 634 (2022) - [i50]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé:
On Module Unique-SVP and NTRU. IACR Cryptol. ePrint Arch. 2022: 1203 (2022) - [i49]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. IACR Cryptol. ePrint Arch. 2022: 1249 (2022) - 2021
- [j19]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from sf LWE. J. Cryptol. 34(3): 29 (2021) - [c58]Olivier Blazy, Sayantan Mukherjee, Huyen Nguyen, Duong Hieu Phan, Damien Stehlé:
An Anonymous Trace-and-Revoke Broadcast Encryption Scheme. ACISP 2021: 214-233 - [c57]Alice Pellet-Mary, Damien Stehlé:
On the Hardness of the NTRU Problem. ASIACRYPT (1) 2021: 3-35 - [c56]Julien Devevey, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
On the Integer Polynomial Learning with Errors Problem. Public Key Cryptography (1) 2021: 184-214 - [i48]Julien Devevey, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
On the Integer Polynomial Learning with Errors Problem. IACR Cryptol. ePrint Arch. 2021: 277 (2021) - [i47]Chitchanok Chuengsatiansup, Damien Stehlé:
Towards practical GGM-based PRF from (Module-)Learning-with-Rounding. IACR Cryptol. ePrint Arch. 2021: 446 (2021) - [i46]Veronika Kuchta, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Shifeng Sun:
Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security. IACR Cryptol. ePrint Arch. 2021: 454 (2021) - [i45]Alice Pellet-Mary, Damien Stehlé:
On the hardness of the NTRU problem. IACR Cryptol. ePrint Arch. 2021: 821 (2021) - [i44]Vadim Lyubashevsky, Damien Stehlé:
Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. IACR Cryptol. ePrint Arch. 2021: 1364 (2021) - [i43]Shweta Agrawal, Elena Kirshanova, Damien Stehlé, Anshu Yadav:
Can Round-Optimal Lattice-Based Blind Signatures be Practical? IACR Cryptol. ePrint Arch. 2021: 1565 (2021) - 2020
- [j18]Elena Kirshanova, Huyen Nguyen, Damien Stehlé, Alexandre Wallet:
On the smoothing parameter and last minimum of random orthogonal lattices. Des. Codes Cryptogr. 88(5): 931-950 (2020) - [c55]Chitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé, Alexandre Wallet, Keita Xagawa:
ModFalcon: Compact Signatures Based On Module-NTRU Lattices. AsiaCCS 2020: 853-866 - [c54]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). CRYPTO (2) 2020: 186-212 - [c53]Veronika Kuchta, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Shifeng Sun:
Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security. EUROCRYPT (3) 2020: 703-728 - [c52]Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang:
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. Public Key Cryptography (2) 2020: 66-93 - [i42]Elena Kirshanova, Huyen Nguyen, Damien Stehlé, Alexandre Wallet:
On the smoothing parameter and last minimum of random orthogonal lattices. IACR Cryptol. ePrint Arch. 2020: 57 (2020) - [i41]Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang:
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. IACR Cryptol. ePrint Arch. 2020: 198 (2020) - [i40]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)). IACR Cryptol. ePrint Arch. 2020: 707 (2020)
2010 – 2019
- 2019
- [j17]Jung Hee Cheon, Kyoohyung Han, Changmin Lee, Hansol Ryu, Damien Stehlé:
Cryptanalysis of the CLT13 Multilinear Map. J. Cryptol. 32(2): 547-565 (2019) - [c51]Changmin Lee, Alice Pellet-Mary, Damien Stehlé, Alexandre Wallet:
An LLL Algorithm for Module Lattices. ASIACRYPT (2) 2019: 59-90 - [c50]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. EUROCRYPT (2) 2019: 685-716 - [c49]Chitchanok Chuengsatiansup, Damien Stehlé:
Towards Practical GGM-Based PRF from (Module-)Learning-with-Rounding. SAC 2019: 693-713 - [i39]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. IACR Cryptol. ePrint Arch. 2019: 215 (2019) - [i38]Changmin Lee, Alice Pellet-Mary, Damien Stehlé, Alexandre Wallet:
An LLL Algorithm for Module Lattices. IACR Cryptol. ePrint Arch. 2019: 1035 (2019) - [i37]Chitchanok Chuengsatiansup, Thomas Prest, Damien Stehlé, Alexandre Wallet, Keita Xagawa:
ModFalcon: compact signatures based on module NTRU lattices. IACR Cryptol. ePrint Arch. 2019: 1456 (2019) - 2018
- [j16]Shi Bai, Tancrède Lepoint, Adeline Roux-Langlois, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. J. Cryptol. 31(2): 610-640 (2018) - [j15]Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé:
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(1): 238-268 (2018) - [c48]Shi Bai, Damien Stehlé, Weiqiang Wen:
Measuring, Simulating and Exploiting the Head Concavity Phenomenon in BKZ. ASIACRYPT (1) 2018: 369-404 - [c47]Miruna Rosca, Damien Stehlé, Alexandre Wallet:
On the Ring-LWE and Polynomial-LWE Problems. EUROCRYPT (1) 2018: 146-173 - [c46]Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, Damien Stehlé:
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. EuroS&P 2018: 353-367 - [c45]Jingwei Chen, Damien Stehlé, Gilles Villard:
Computing an LLL-reduced Basis of the Orthogonal Latice. ISSAC 2018: 127-133 - [c44]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning with Errors and Extrapolated Dihedral Cosets. Public Key Cryptography (2) 2018: 702-727 - [c43]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from \mathsf LWE. TCC (2) 2018: 391-421 - [i36]Jingwei Chen, Damien Stehlé, Gilles Villard:
Computing an LLL-reduced basis of the orthogonal lattice. CoRR abs/1805.03418 (2018) - [i35]Miruna Rosca, Damien Stehlé, Alexandre Wallet:
On the Ring-LWE and Polynomial-LWE problems. IACR Cryptol. ePrint Arch. 2018: 170 (2018) - [i34]Shi Bai, Damien Stehlé, Weiqiang Wen:
Measuring, simulating and exploiting the head concavity phenomenon in BKZ. IACR Cryptol. ePrint Arch. 2018: 856 (2018) - [i33]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from LWE. IACR Cryptol. ePrint Arch. 2018: 927 (2018) - 2017
- [j14]San Ling, Duong Hieu Phan, Damien Stehlé, Ron Steinfeld:
Hardness of k-LWE and Applications in Traitor Tracing. Algorithmica 79(4): 1318-1352 (2017) - [c42]Shweta Agrawal, Sanjay Bhattacherjee, Duong Hieu Phan, Damien Stehlé, Shota Yamada:
Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract. CCS 2017: 2277-2293 - [c41]Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
Middle-Product Learning with Errors. CRYPTO (3) 2017: 283-297 - [c40]Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. CRYPTO (3) 2017: 332-364 - [c39]Damien Stehlé:
Lattice Reduction Algorithms. ISSAC 2017: 11-12 - [i32]Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning With Errors and Extrapolated Dihedral Cosets. CoRR abs/1710.08223 (2017) - [i31]Miruna Rosca, Amin Sakzad, Ron Steinfeld, Damien Stehlé:
Middle-Product Learning With Errors. IACR Cryptol. ePrint Arch. 2017: 628 (2017) - [i30]Léo Ducas, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé:
CRYSTALS - Dilithium: Digital Signatures from Module Lattices. IACR Cryptol. ePrint Arch. 2017: 633 (2017) - [i29]Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Damien Stehlé:
CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. IACR Cryptol. ePrint Arch. 2017: 634 (2017) - [i28]Shweta Agrawal, Sanjay Bhattacherjee, Duong Hieu Phan, Damien Stehlé, Shota Yamada:
Efficient Public Trace and Revoke from Standard Assumptions. IACR Cryptol. ePrint Arch. 2017: 650 (2017) - [i27]Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. IACR Cryptol. ePrint Arch. 2017: 876 (2017) - 2016
- [j13]Shi Bai, Thijs Laarhoven, Damien Stehlé:
Tuple lattice sieving. LMS J. Comput. Math. 19(A): 146-162 (2016) - [c38]Shweta Agrawal, Benoît Libert, Damien Stehlé:
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. CRYPTO (3) 2016: 333-362 - [c37]Léo Ducas, Damien Stehlé:
Sanitization of FHE Ciphertexts. EUROCRYPT (1) 2016: 294-310 - [c36]Shi Bai, Damien Stehlé, Weiqiang Wen:
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. ICALP 2016: 76:1-76:12 - [c35]Arnold Neumaier, Damien Stehlé:
Faster LLL-type Reduction of Lattice Bases. ISSAC 2016: 373-380 - [i26]Léo Ducas, Damien Stehlé:
Sanitization of FHE Ciphertexts. IACR Cryptol. ePrint Arch. 2016: 164 (2016) - [i25]Shi Bai, Thijs Laarhoven, Damien Stehlé:
Tuple lattice sieving. IACR Cryptol. ePrint Arch. 2016: 713 (2016) - [i24]Shi Bai, Damien Stehlé, Weiqiang Wen:
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. IACR Cryptol. ePrint Arch. 2016: 753 (2016) - [i23]Jung Hee Cheon, Damien Stehlé:
Fully Homomorphic Encryption over the Integers Revisited. IACR Cryptol. ePrint Arch. 2016: 837 (2016) - [i22]Arnold Neumaier, Damien Stehlé:
Faster LLL-type Reduction of Lattice Bases. IACR Cryptol. ePrint Arch. 2016: 852 (2016) - 2015
- [j12]Adeline Langlois, Damien Stehlé:
Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3): 565-599 (2015) - [c34]Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Ron Steinfeld:
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance. ASIACRYPT (1) 2015: 3-24 - [c33]Jung Hee Cheon, Kyoohyung Han, Changmin Lee, Hansol Ryu, Damien Stehlé:
Cryptanalysis of the Multilinear Map over the Integers. EUROCRYPT (1) 2015: 3-12 - [c32]Jung Hee Cheon, Damien Stehlé:
Fully Homomophic Encryption over the Integers Revisited. EUROCRYPT (1) 2015: 513-536 - [i21]Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Ron Steinfeld:
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. IACR Cryptol. ePrint Arch. 2015: 483 (2015) - [i20]Benoît Libert, Damien Stehlé:
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. IACR Cryptol. ePrint Arch. 2015: 608 (2015) - [i19]Alice Pellet-Mary, Damien Stehlé:
Cryptanalysis of Gu's ideal multilinear map. IACR Cryptol. ePrint Arch. 2015: 759 (2015) - 2014
- [j11]Cong Ling, Laura Luzzi, Jean-Claude Belfiore, Damien Stehlé:
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel. IEEE Trans. Inf. Theory 60(10): 6399-6416 (2014) - [c31]San Ling, Duong Hieu Phan, Damien Stehlé, Ron Steinfeld:
Hardness of k-LWE and Applications in Traitor Tracing. CRYPTO (1) 2014: 315-334 - [c30]Adeline Langlois, Damien Stehlé, Ron Steinfeld:
GGHLite: More Efficient Multilinear Maps from Ideal Lattices. EUROCRYPT 2014: 239-256 - [c29]Saruchi, Ivan Morel, Damien Stehlé, Gilles Villard:
LLL reducing with the most significant bits. ISSAC 2014: 367-374 - [i18]Adeline Langlois, Damien Stehlé, Ron Steinfeld:
GGHLite: More Efficient Multilinear Maps from Ideal Lattices. IACR Cryptol. ePrint Arch. 2014: 487 (2014) - [i17]San Ling, Duong Hieu Phan, Damien Stehlé, Ron Steinfeld:
Hardness of k-LWE and Applications in Traitor Tracing. IACR Cryptol. ePrint Arch. 2014: 494 (2014) - [i16]Jung Hee Cheon, Kyoohyung Han, Changmin Lee, Hansol Ryu, Damien Stehlé:
Cryptanalysis of the Multilinear Map over the Integers. IACR Cryptol. ePrint Arch. 2014: 906 (2014) - 2013
- [j10]Laura Luzzi, Damien Stehlé, Cong Ling:
Decoding by Embedding: Correct Decoding Radius and DMT Optimality. IEEE Trans. Inf. Theory 59(5): 2960-2973 (2013) - [c28]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. ASIACRYPT (2) 2013: 41-61 - [c27]Jingwei Chen, Damien Stehlé, Gilles Villard:
A new view on HJLS and PSLQ: sums and projections of lattices. ISSAC 2013: 149-156 - [c26]San Ling, Khoa Nguyen, Damien Stehlé, Huaxiong Wang:
Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications. Public Key Cryptography 2013: 107-124 - [c25]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical hardness of learning with errors. STOC 2013: 575-584 - [i15]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical Hardness of Learning with Errors. CoRR abs/1306.0281 (2013) - [i14]Damien Stehlé, Ron Steinfeld:
Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices. IACR Cryptol. ePrint Arch. 2013: 4 (2013) - [i13]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. IACR Cryptol. ePrint Arch. 2013: 308 (2013) - 2012
- [j9]Xiao-Wen Chang, Damien Stehlé, Gilles Villard:
Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. Math. Comput. 81(279): 1487-1511 (2012) - [i12]Cong Ling, Laura Luzzi, Jean-Claude Belfiore, Damien Stehlé:
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel. CoRR abs/1210.6673 (2012) - [i11]Adeline Langlois, Damien Stehlé:
Worst-Case to Average-Case Reductions for Module Lattices. IACR Cryptol. ePrint Arch. 2012: 90 (2012) - [i10]San Ling, Khoa Nguyen, Damien Stehlé, Huaxiong Wang:
Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications. IACR Cryptol. ePrint Arch. 2012: 569 (2012) - 2011
- [b3]Damien Stehlé:
Euclidean lattices: algorithms and cryptography. (Réseaux Euclidiens : Algorithmes et Cryptographie). École normale supérieure de Lyon, France, 2011 - [j8]Shuiyin Liu, Cong Ling, Damien Stehlé:
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding. IEEE Trans. Inf. Theory 57(9): 5933-5945 (2011) - [c24]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Algorithms for the Shortest and Closest Lattice Vector Problems. IWCC 2011: 159-190 - [c23]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. CRYPTO 2011: 447-464 - [c22]Damien Stehlé, Ron Steinfeld:
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. EUROCRYPT 2011: 27-47 - [c21]Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehlé:
Decoding by embedding: Correct decoding radius and DMT optimality. ISIT 2011: 1106-1110 - [c20]Andrew Novocin, Damien Stehlé, Gilles Villard:
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. STOC 2011: 403-412 - [i9]Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehlé:
Decoding by Embedding: Correct Decoding Radius and DMT Optimality. CoRR abs/1102.2936 (2011) - [i8]Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Terminating BKZ. IACR Cryptol. ePrint Arch. 2011: 198 (2011) - 2010
- [b2]Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres:
Handbook of Floating-Point Arithmetic. Birkhäuser 2010, ISBN 978-0-8176-4704-9, pp. I-XXIII, 1-572 - [j7]Xiao-Wen Chang, Damien Stehlé:
Rigorous Perturbation Bounds of Some Matrix Factorizations. SIAM J. Matrix Anal. Appl. 31(5): 2841-2859 (2010) - [j6]Ivan Morel, Damien Stehlé, Gilles Villard:
Analyse numérique et réduction de réseaux. Tech. Sci. Informatiques 29(1): 115-144 (2010) - [c19]Claus Fieker, Damien Stehlé:
Short Bases of Lattices over Number Fields. ANTS 2010: 157-173 - [c18]Damien Stehlé, Mark Watkins:
On the Extremality of an 80-Dimensional Lattice. ANTS 2010: 340-356 - [c17]Damien Stehlé, Ron Steinfeld:
Faster Fully Homomorphic Encryption. ASIACRYPT 2010: 377-394 - [c16]Shuiyin Liu, Cong Ling, Damien Stehlé:
Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding. ISIT 2010: 2263-2267 - [c15]Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé:
Accelerating Lattice Reduction with FPGAs. LATINCRYPT 2010: 124-143 - [p1]Damien Stehlé:
Floating-Point LLL: Theoretical and Practical Aspects. The LLL Algorithm 2010: 179-213 - [i7]Shuiyin Liu, Cong Ling, Damien Stehlé:
Randomized Lattice Decoding. CoRR abs/1003.0064 (2010) - [i6]Damien Stehlé, Ron Steinfeld:
Faster Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010: 299 (2010)
2000 – 2009
- 2009
- [j5]Phong Q. Nguyen, Damien Stehlé:
An LLL Algorithm with Quadratic Complexity. SIAM J. Comput. 39(3): 874-903 (2009) - [j4]Phong Q. Nguyen, Damien Stehlé:
Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5(4): 46:1-46:48 (2009) - [c14]Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa:
Efficient Public Key Encryption Based on Ideal Lattices. ASIACRYPT 2009: 617-635 - [c13]Ivan Morel, Damien Stehlé, Gilles Villard:
H-LLL: using householder inside LLL. ISSAC 2009: 271-278 - [i5]Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa:
Efficient Public Key Encryption Based on Ideal Lattices. IACR Cryptol. ePrint Arch. 2009: 285 (2009) - [i4]Xavier Pujol, Damien Stehlé:
Solving the Shortest Lattice Vector Problem in Time 22.465n. IACR Cryptol. ePrint Arch. 2009: 605 (2009) - 2008
- [j3]Ivan Morel, Damien Stehlé, Gilles Villard:
From an LLL-reduced basis to another. ACM Commun. Comput. Algebra 42(3): 142-143 (2008) - [c12]Xavier Pujol, Damien Stehlé:
Rigorous and Efficient Short Lattice Vectors Enumeration. ASIACRYPT 2008: 390-405 - [c11]Vincent Lefèvre, Damien Stehlé, Paul Zimmermann:
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. Reliable Implementation of Real Number Algorithms 2008: 114-126 - [c10]Ali Akhavi, Damien Stehlé:
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). LATIN 2008: 293-305 - [i3]Guillaume Hanrot, Damien Stehlé:
Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases. CoRR abs/0801.3331 (2008) - 2007
- [c9]Guillaume Hanrot, Vincent Lefèvre, Damien Stehlé, Paul Zimmermann:
Worst Cases of a Periodic Function for Large Arguments. IEEE Symposium on Computer Arithmetic 2007: 133-140 - [c8]Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO 2007: 170-186 - [i2]Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CoRR abs/0705.0965 (2007) - 2006
- [c7]Phong Q. Nguyen, Damien Stehlé:
LLL on the Average. ANTS 2006: 238-256 - [c6]Damien Stehlé:
On the Randomness of Bits Generated by Sufficiently Smooth Functions. ANTS 2006: 257-274 - [i1]Vincent Lefèvre, Damien Stehlé, Paul Zimmermann:
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. Reliable Implementation of Real Number Algorithms 2006 - 2005
- [b1]Damien Stehlé:
Algorithmique de la réduction de réseaux et application à la recherche de pires cas pour l'arrondi defonctions mathématiques. Henri Poincaré University, Nancy, France, 2005 - [j2]Damien Stehlé, Vincent Lefèvre, Paul Zimmermann:
Searching Worst Cases of a One-Variable Function Using Lattice Reduction. IEEE Trans. Computers 54(3): 340-346 (2005) - [c5]Damien Stehlé, Paul Zimmermann:
Gal's Accurate Tables Method Revisited. IEEE Symposium on Computer Arithmetic 2005: 257-264 - [c4]Phong Q. Nguyen, Damien Stehlé:
Floating-Point LLL Revisited. EUROCRYPT 2005: 215-233 - 2004
- [j1]Damien Stehlé:
Breaking Littlewood's Cipher. Cryptologia 28(4): 341-357 (2004) - [c3]Phong Q. Nguyen, Damien Stehlé:
Low-Dimensional Lattice Basis Reduction Revisited. ANTS 2004: 338-357 - [c2]Damien Stehlé, Paul Zimmermann:
A Binary Recursive Gcd Algorithm. ANTS 2004: 411-425 - 2003
- [c1]Damien Stehlé, Vincent Lefèvre, Paul Zimmermann:
Worst Cases and Lattice Reduction. IEEE Symposium on Computer Arithmetic 2003: 142-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
