On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm. - Léo Ducas; Maxime Plançon; Benjamin Wesolowski (IACR Cryptol. ePrint Arch., 2019)

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

Exact Lattice Sampling from Non-Gaussian Distributions. - Maxime Plançon; Thomas Prest (IACR Cryptol. ePrint Arch., 2021)

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Exploiting algebraic structures in probing security. - Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)