Thomas Plantard

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