Thomas Plantard

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 38

Top Venues

Montpellier 2 University, France (PHD)

Education History

Montpellier 2 University, France

PHD

Publications

Markus Bläser, Zhili Chen, Dung Hoang Duong, Antoine Joux, Tuong Ngoc Nguyen, Thomas Plantard, Youming Qiao, Willy Susilo, Gang Tang
On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures. PQCrypto (1) (2024)
Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, Pascal Véron
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $. Adv. Math. Commun. 18 (3) (2024)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Fast verification and public key storage optimization for unstructured lattice-based signatures. J. Cryptogr. Eng. 13 (3) (2023)
Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. EUROCRYPT (3) (2022)
Thomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca
Tight Bound on NewHope Failure Probability. IEEE Trans. Emerg. Top. Comput. 10 (4) (2022)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Generating Very Large RNS Bases. IEEE Trans. Emerg. Top. Comput. 10 (3) (2022)
Gang Tang, Dung Hoang Duong, Antoine Joux, Thomas Plantard, Youming Qiao, Willy Susilo
Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms. IACR Cryptol. ePrint Arch. 2022 (2022)
Jean-Claude Bajard, Kazuhide Fukushima, Thomas Plantard, Arnaud Sipasseuth
Generating Very Large RNS Bases. ARITH (2022)
Jean-Claude Bajard, Kazuhide Fukushima, Shinsaku Kiyomoto, Thomas Plantard, Arnaud Sipasseuth, Willy Susilo
Generating Residue Number System Bases. ARITH (2021)
Thomas Plantard
Efficient Word Size Modular Arithmetic. ARITH (2021)
Thomas Plantard
Efficient Word Size Modular Arithmetic. IEEE Trans. Emerg. Top. Comput. 9 (3) (2021)
Andrea Lesavourey, Thomas Plantard, Willy Susilo
On the Short Principal Ideal Problem over some real Kummer fields. IACR Cryptol. ePrint Arch. 2021 (2021)
Andrea Lesavourey, Thomas Plantard, Willy Susilo
Short Principal Ideal Problem in multicubic fields. J. Math. Cryptol. 14 (1) (2020)
Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, Pascal Véron
On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$. CoRR (2020)
Arnaud Sipasseuth, Thomas Plantard, Willy Susilo
A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution †. Inf. 11 (3) (2020)
Huy Quoc Le, Dung Hoang Duong, Willy Susilo, Ha Thanh Nguyen Tran, Viet Cuong Trinh, Josef Pieprzyk, Thomas Plantard
Lattice Blind Signatures with Forward Security. CoRR (2020)
Huy Quoc Le, Dung Hoang Duong, Willy Susilo, Ha Thanh Nguyen Tran, Viet Cuong Trinh, Josef Pieprzyk, Thomas Plantard
Lattice Blind Signatures with Forward Security. ACISP (2020)
Arnaud Sipasseuth, Thomas Plantard, Willy Susilo
Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise. ACISP (2019)
Arnaud Sipasseuth, Thomas Plantard, Willy Susilo
Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices. J. Math. Cryptol. 13 (3-4) (2019)
Jean-Marc Robert, Christophe Nègre, Thomas Plantard
Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding. J. Cryptogr. Eng. 9 (2) (2019)
Arnaud Sipasseuth, Thomas Plantard, Willy Susilo
Using Freivalds' Algorithm to Accelerate Lattice-Based Signature Verifications. ISPEC (2019)
Thomas Plantard, Arnaud Sipasseuth, Willy Susilo, Vincent Zucca
Tight bound on NewHope failure probability. IACR Cryptol. ePrint Arch. 2019 (2019)
Clémentine Gritti, Melek Önen, Refik Molva, Willy Susilo, Thomas Plantard
Device Identification and Personal Data Attestation in Networks. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 9 (4) (2018)
Clémentine Gritti, Rongmao Chen, Willy Susilo, Thomas Plantard
Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy. CoRR (2017)
Andrea Lesavourey, Christophe Nègre, Thomas Plantard
Efficient Leak Resistant Modular Exponentiation in RNS. ARITH (2017)
Christophe Nègre, Thomas Plantard
Efficient regular modular exponentiation using multiplicative half-size splitting. J. Cryptogr. Eng. 7 (3) (2017)
Clémentine Gritti, Rongmao Chen, Willy Susilo, Thomas Plantard
Dynamic Provable Data Possession Protocols with Public Verifiability and Data Privacy. ISPEC (2017)
Clémentine Gritti, Willy Susilo, Thomas Plantard
Logarithmic size ring signatures without random oracles. IET Inf. Secur. 10 (1) (2016)
Thomas Plantard, Jean-Marc Robert
Enhanced Digital Signature Using RNS Digit Exponent Representation. WAIFI (2016)
Clémentine Gritti, Willy Susilo, Thomas Plantard
Certificate-Based Encryption with Keyword Search: Enabling Secure Authorization in Electronic Health Record. J. Internet Serv. Inf. Secur. 6 (4) (2016)
Clémentine Gritti, Willy Susilo, Thomas Plantard, Kaitai Liang, Duncan S. Wong
Broadcast encryption with dealership. Int. J. Inf. Sec. 15 (3) (2016)
Andrea Lesavourey, Christophe Nègre, Thomas Plantard
Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. SECRYPT (2016)
Clémentine Gritti, Willy Susilo, Thomas Plantard
Efficient Dynamic Provable Data Possession with Public Verifiability and Data Privacy. ACISP (2015)
Clémentine Gritti, Willy Susilo, Thomas Plantard
Efficient File Sharing in Electronic Health Records. ISPEC (2015)
Thomas Plantard, Willy Susilo, Zhenfei Zhang
LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme. Des. Codes Cryptogr. 76 (2) (2015)
Christophe Nègre, Thomas Plantard, Jean-Marc Robert
Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand. ARITH (2015)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard
RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure. ARITH (2015)
Clémentine Gritti, Willy Susilo, Thomas Plantard, Khin Than Win
Privacy-preserving encryption scheme using DNA parentage test. Theor. Comput. Sci. 580 (2015)
Jean-Claude Bajard, Julien Eynard, Nabil Merkiche, Thomas Plantard
Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols. ISIC (2014)
Clémentine Gritti, Willy Susilo, Thomas Plantard, Kaitai Liang, Duncan S. Wong
Empowering Personal Health Records with Cloud Computing: How to encrypt with forthcoming fine-grained policies efficiently. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 5 (4) (2014)
Thomas Plantard, Willy Susilo, Zhenfei Zhang
Adaptive Precision Floating Point LLL. ACISP (2013)
Thomas Plantard, Michael Schneider
Creating a Challenge for Ideal Lattices. IACR Cryptol. ePrint Arch. 2013 (2013)
Thomas Plantard, Willy Susilo, Zhenfei Zhang
Fully Homomorphic Encryption Using Hidden Ideal Lattice. IEEE Trans. Inf. Forensics Secur. 8 (12) (2013)
Thomas Plantard, Willy Susilo, Zhenfei Zhang
Lattice Reduction for Modular Knapsack. Selected Areas in Cryptography (2012)
Zhenfei Zhang, Thomas Plantard, Willy Susilo
On the CCA-1 Security of Somewhat Homomorphic Encryption over the Integers. ISPEC (2012)
Michael Rose, Thomas Plantard, Willy Susilo
Improving BDD Cryptosystems in General Lattices. ISPEC (2011)
Zhenfei Zhang, Thomas Plantard, Willy Susilo
Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes. ICISC (2011)
Jean-Claude Bajard, Christophe Nègre, Thomas Plantard
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation. IEEE Trans. Computers 59 (12) (2010)
Thomas Plantard, Willy Susilo
Recursive Lattice Reduction. SCN (2010)
Thomas Plantard, Mike Rose, Willy Susilo
Improvement of Lattice-Based Cryptography Using CRT. QuantumComm (2009)
Jean-Claude Bajard, Marcelo E. Kaihara, Thomas Plantard
Selected RNS Bases for Modular Multiplication. IEEE Symposium on Computer Arithmetic (2009)
Thomas Plantard, Willy Susilo
Broadcast Attacks against Lattice-Based Cryptosystems. ACNS (2009)
Christophe Nègre, Thomas Plantard
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation. ACISP (2008)
Thomas Plantard, Willy Susilo, Khin Than Win
. Public Key Cryptography (2008)
Thomas Plantard, Willy Susilo, Khin Than Win, Qiong Huang
Efficient lattice-based signature scheme. Int. J. Appl. Cryptogr. 1 (2) (2008)
Pascal Giorgi, Christophe Nègre, Thomas Plantard
Subquadratic Binary Field Multiplier in Double Polynomial System. SECRYPT (2007)
Jean-Claude Bajard, Laurent Imbert, Thomas Plantard
Arithmetic Operations in the Polynomial Modular Number System. IEEE Symposium on Computer Arithmetic (2005)
Jean-Claude Bajard, Laurent Imbert, Thomas Plantard
Modular Number Systems: Beyond the Mersenne Family. Selected Areas in Cryptography (2004)
Jean-Claude Bajard, Laurent Imbert, Christophe Nègre, Thomas Plantard
Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. IEEE Symposium on Computer Arithmetic (2003)

Thomas Plantard.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Plantard