Maxime Plançon

12 papers Journal 6Unranked 6
YearRankTypeTitle / Venue / Authors
2023 — conf
Exploiting Algebraic Structures in Probing Security.
ASIACRYPT (4)
Maxime Plançon
2022 — conf
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.
Public Key Cryptography (2)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
2022 J jnl
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.
IACR Cryptol. ePrint Arch.
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
2022 J jnl
Exploiting algebraic structures in probing security.
IACR Cryptol. ePrint Arch.
Maxime Plançon
2022 — conf
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General.
CRYPTO (2)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
2022 J jnl
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General.
IACR Cryptol. ePrint Arch.
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
2021 — conf
Exact Lattice Sampling from Non-Gaussian Distributions.
Public Key Cryptography (1)
Maxime Plançon, Thomas Prest
2021 J jnl
Exact Lattice Sampling from Non-Gaussian Distributions.
IACR Cryptol. ePrint Arch.
Maxime Plançon, Thomas Prest
2021 — conf
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations.
ASIACRYPT (4)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler
2021 J jnl
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations.
IACR Cryptol. ePrint Arch.
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler
2019 — conf
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm.
CRYPTO (1)
Léo Ducas, Maxime Plançon, Benjamin Wesolowski
2019 J jnl
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm.
IACR Cryptol. ePrint Arch.
Léo Ducas, Maxime Plançon, Benjamin Wesolowski