Gabrielle De Micheli

Orcid: 0000-0002-2617-6878

According to our database1, Gabrielle De Micheli authored at least 18 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
CARVQ: Corrective Adaptor with Group Residual Vector Quantization for LLM Embedding Compression.
CoRR, October, 2025

HE-LRM: Encrypted Deep Learning Recommendation Models using Fully Homomorphic Encryption.
CoRR, June, 2025

Faster amortized bootstrapping using the incomplete NTT for free.
IACR Cryptol. ePrint Arch., 2025

Incompleteness in Number-Theoretic Transforms: New Tradeoffs and Faster Lattice-Based Cryptographic Applications.
Proceedings of the 10th IEEE European Symposium on Security and Privacy, 2025

Rhychee-FL: Robust and Efficient Hyperdimensional Federated Learning with Homomorphic Encryption.
Proceedings of the Design, Automation & Test in Europe Conference, 2025

2024
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation.
J. Cryptol., March, 2024

Survey: Recovering cryptographic keys from partial information, by example.
IACR Commun. Cryptol., 2024

Faster Amortized FHEW Bootstrapping Using Ring Automorphisms.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

2023
Efficient Machine Learning on Encrypted Data Using Hyperdimensional Computing.
Proceedings of the IEEE/ACM International Symposium on Low Power Electronics and Design, 2023

Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
A fully classical LLL algorithm for modules.
IACR Cryptol. ePrint Arch., 2022

2021
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks. (Cryptanalyses de logarithmes discrets : crible algébrique et réseaux pour canaux auxiliaires).
PhD thesis, 2021

Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Recovering cryptographic keys from partial information, by example.
IACR Cryptol. ePrint Arch., 2020

Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

A Tale of Three Signatures: Practical Attack of ECDSA with wNAF.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2020, 2020

2018
CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Characterizing overstretched NTRU attacks.
IACR Cryptol. ePrint Arch., 2018


  Loading...