Plantard, Thomas

Overview

Dr. Thomas Plantard is a senior research fellow at the Institute for Cybersecurity and Cryptology at the University of Wollongong.
Dr. Thomas Plantard has worked for more than 10 years at the University of Wollongong on various topics in cryptography. His particular expertise has been in post-quantum cryptography, which refers to cryptographic algorithms that are resistant to quantum computer attacks.
His works have been supported by various grants awarded by the Department of the Prime Minister and Cabinet or the National Security Science and Technology Centre to collaborate with Australian Signals Directorate and the Defence Science and Technology Group.
He is currently funded by the U.S. Department of Commerce to create standard for the next generation of (quantum resistant) cryptographic protocols and has proposed two candidates to NIST Call for Post-Quantum Cryptography Standardization.

Available as Research Supervisor

Member Of

Institute of Cybersecurity and Cryptology

Selected Publications

Journal Article

Year	Title
2020	A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution Published In Information
2020	Lattice Blind Signatures with Forward Security Published In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020	Short principal ideal problem in multicubic fields Published In Journal of Mathematical Cryptology
2019	Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding Published In Journal of Cryptographic Engineering
2019	Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices Published In Journal of Mathematical Cryptology
2019	Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise Published In Lecture Notes in Computer Science
2019	Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications Published In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2018	Device identification and personal data attestation in networks Published In Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
2017	Dynamic provable data possession protocols with public verifiability and data privacy Published In Lecture Notes in Artificial Intelligence
2017	Efficient regular modular exponentiation using multiplicative half-size splitting Published In Journal of Cryptographic Engineering
2017	Enhanced digital signature using RNS digit exponent representation Published In Lecture Notes in Computer Science
2016	Broadcast encryption with dealership Published In International Journal of Information Security
2016	Certificate-based encryption with keyword search enabling secure authorization in electronic health record Published In Journal of Internet Services and Information Security
2015	Efficient file sharing in electronic health records Published In Lecture Notes in Computer Science
2015	LLL for ideal lattices re-evaluation of the security of Gentry-Halevi's FHE scheme Published In Designs, Codes and Cryptography
2015	Logarithmic size ring signatures without random oracles Published In IET Information Security
2015	Privacy-preserving encryption scheme using DNA parentage test Published In Theoretical Computer Science
2014	Empowering personal health records with cloud computing: how to encrypt with forthcoming fine-grained policies efficiently Published In Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
2013	Adaptive precision floating point LLL Published In Lecture Notes in Computer Science
2013	Fully homomorphic encryption using hidden ideal lattice Published In IEEE Transactions on Information Forensics and Security
2013	Lattice reduction for modular knapsack Published In Lecture Notes in Computer Science
2012	On the CCA-1 security of somewhat homomorphic encryption over the integers Published In Lecture Notes in Computer Science
2012	Reaction attack on outsourced computing with fully homomorphic encryption schemes Published In Lecture Notes in Computer Science
2011	Improving BDD cryptosystems in general lattices Published In Lecture Notes in Computer Science
2010	Recursive lattice reduction Published In Lecture Notes in Computer Science
2010	Subquadratic space complexity binary field multiplier using double polynomial representation Published In IEEE Transactions on Computers
2009	Broadcast attacks against lattice-based cryptosystems Published In Lecture notes in computer science
2008	Efficient Lattice-based Signature Scheme Published In International Journal of Applied Cryptography

Conference Paper

Year	Title
2017	Efficient leak resistant modular exponentiation in RNS Published In 24th IEEE Symposium on Computer Arithmetic (ARITH 2017)
2016	Efficient randomized regular modular exponentiation using combined Montgomery and Barrett multiplications Published In Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016)
2015	Babai round-off CVP method in RNS: application to latice based cryptographic protocols Published In Proceedings of the 14th International Symposium on Integrated Circuits (ISIC)
2015	Efficient dynamic provable data possession with public verifiability and data privacy Published In Information Security and Privacy: Proceedings of the 20th Australasian Conference, ACISP 2015
2015	Efficient modular exponentiation based on multiple multiplications by a common operand Published In Proceedings of the 2015 IEEE Symposium on Computer Arithmetic (ARITH 22)
2015	RNS arithmetic approach in lattice-based cryptography: accelerating the 'rounding-off' core procedure Published In Proceedings of the 2015 IEEE Symposium on Computer Arithmetic (ARITH 22)
2009	Improvement of lattice-based cryptography using CRT Published In International ICST Conference on Quantum Communication and Quantum Networking
2009	Selected RNS bases for modular multiplication Published In Symposium on Computer Arithmetic
2008	A Digital Signature Scheme based on CVP Published In International Conference/Workshop on Practice and Theory in Public Key Cryptography
2008	Efficient modular arithmetic in adapted modular number system using lagrange representation Published In Australasian Conference on Information Security and Privacy
2007	Subquadratic Binary Field Multiplier in Double Polynomial System Published In International Conference on Information Security and Cryptography

Investigator On

Year	Title
2019	Secure Enhanced Mathematical Objects for Next Cryptographic Evolution Awarded by: INRIA Funding Scheme: International Programme
2019	Visualising intrusion detection and behavioural analytics data in real-time for combating cyber attacks and creating awareness Awarded by: NUW Alliance Funding Scheme: Grant
2016 - 2019	On the Structure of Lattices for Post-Quantum Cryptography Awarded by: National Institute of Standards and Technology (NIST) Funding Scheme: Measurement Science and Engineering (MSE) Research Grant Programs
2010	Optimal Lattice Reduction Tools for Protecting Future Cryptosystems Awarded by: National Computational Infrastructure Funding Scheme: Merit Allocation Scheme
2009	Post-quantum Cryptography: protecting Counter-Terrorism against Future Capabilities of Quantum Computers Awarded by: Department of Prime Minister and Cabinet Funding Scheme: Research Support for Counter Terrorism
	Leak resistant arithmetic for cryptography Awarded by: National Centre for Scientific Research (CNRS France) Funding Scheme: Project International for Scientific Cooperation (PICS)

Available as Research Supervisor

Advisees

Graduate Advising Relationship

Degree	Research Title	Advisee
Doctor of Philosophy	Lattice-based Cryptography: Expanding the Design Space	Sipasseuth, Arnaud
Doctor of Philosophy	Lattices for a post-quantum cryptography	Lesavourey, Andrea
Doctor of Philosophy	Contributions to Lattice-based Cryptography	Le, Huy

Keywords

Post-quantum cryptography (i.e quantum resistant cryptography), homomorphic encryption, lattice based cryptology, elliptic curve cryptography, side chanel resistant, modular arithmetic, number system

Selected Publications

Journal Article

Year	Title
2020	A Noise Study of the PSW Signature Family: Patching DRS with Uniform Distribution Published In Information
2020	Lattice Blind Signatures with Forward Security Published In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020	Short principal ideal problem in multicubic fields Published In Journal of Mathematical Cryptology
2019	Efficient Fixed-base exponentiation and scalar multiplication based on a multiplicative splitting exponent recoding Published In Journal of Cryptographic Engineering
2019	Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices Published In Journal of Mathematical Cryptology
2019	Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise Published In Lecture Notes in Computer Science
2019	Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications Published In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2018	Device identification and personal data attestation in networks Published In Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
2017	Dynamic provable data possession protocols with public verifiability and data privacy Published In Lecture Notes in Artificial Intelligence
2017	Efficient regular modular exponentiation using multiplicative half-size splitting Published In Journal of Cryptographic Engineering
2017	Enhanced digital signature using RNS digit exponent representation Published In Lecture Notes in Computer Science
2016	Broadcast encryption with dealership Published In International Journal of Information Security
2016	Certificate-based encryption with keyword search enabling secure authorization in electronic health record Published In Journal of Internet Services and Information Security
2015	Efficient file sharing in electronic health records Published In Lecture Notes in Computer Science
2015	LLL for ideal lattices re-evaluation of the security of Gentry-Halevi's FHE scheme Published In Designs, Codes and Cryptography
2015	Logarithmic size ring signatures without random oracles Published In IET Information Security
2015	Privacy-preserving encryption scheme using DNA parentage test Published In Theoretical Computer Science
2014	Empowering personal health records with cloud computing: how to encrypt with forthcoming fine-grained policies efficiently Published In Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications
2013	Adaptive precision floating point LLL Published In Lecture Notes in Computer Science
2013	Fully homomorphic encryption using hidden ideal lattice Published In IEEE Transactions on Information Forensics and Security
2013	Lattice reduction for modular knapsack Published In Lecture Notes in Computer Science
2012	On the CCA-1 security of somewhat homomorphic encryption over the integers Published In Lecture Notes in Computer Science
2012	Reaction attack on outsourced computing with fully homomorphic encryption schemes Published In Lecture Notes in Computer Science
2011	Improving BDD cryptosystems in general lattices Published In Lecture Notes in Computer Science
2010	Recursive lattice reduction Published In Lecture Notes in Computer Science
2010	Subquadratic space complexity binary field multiplier using double polynomial representation Published In IEEE Transactions on Computers
2009	Broadcast attacks against lattice-based cryptosystems Published In Lecture notes in computer science
2008	Efficient Lattice-based Signature Scheme Published In International Journal of Applied Cryptography

Conference Paper

Year	Title
2017	Efficient leak resistant modular exponentiation in RNS Published In 24th IEEE Symposium on Computer Arithmetic (ARITH 2017)
2016	Efficient randomized regular modular exponentiation using combined Montgomery and Barrett multiplications Published In Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016)
2015	Babai round-off CVP method in RNS: application to latice based cryptographic protocols Published In Proceedings of the 14th International Symposium on Integrated Circuits (ISIC)
2015	Efficient dynamic provable data possession with public verifiability and data privacy Published In Information Security and Privacy: Proceedings of the 20th Australasian Conference, ACISP 2015
2015	Efficient modular exponentiation based on multiple multiplications by a common operand Published In Proceedings of the 2015 IEEE Symposium on Computer Arithmetic (ARITH 22)
2015	RNS arithmetic approach in lattice-based cryptography: accelerating the 'rounding-off' core procedure Published In Proceedings of the 2015 IEEE Symposium on Computer Arithmetic (ARITH 22)
2009	Improvement of lattice-based cryptography using CRT Published In International ICST Conference on Quantum Communication and Quantum Networking
2009	Selected RNS bases for modular multiplication Published In Symposium on Computer Arithmetic
2008	A Digital Signature Scheme based on CVP Published In International Conference/Workshop on Practice and Theory in Public Key Cryptography
2008	Efficient modular arithmetic in adapted modular number system using lagrange representation Published In Australasian Conference on Information Security and Privacy
2007	Subquadratic Binary Field Multiplier in Double Polynomial System Published In International Conference on Information Security and Cryptography

Investigator On

Year	Title
2019	Secure Enhanced Mathematical Objects for Next Cryptographic Evolution Awarded by: INRIA Funding Scheme: International Programme
2019	Visualising intrusion detection and behavioural analytics data in real-time for combating cyber attacks and creating awareness Awarded by: NUW Alliance Funding Scheme: Grant
2016 - 2019	On the Structure of Lattices for Post-Quantum Cryptography Awarded by: National Institute of Standards and Technology (NIST) Funding Scheme: Measurement Science and Engineering (MSE) Research Grant Programs
2010	Optimal Lattice Reduction Tools for Protecting Future Cryptosystems Awarded by: National Computational Infrastructure Funding Scheme: Merit Allocation Scheme
2009	Post-quantum Cryptography: protecting Counter-Terrorism against Future Capabilities of Quantum Computers Awarded by: Department of Prime Minister and Cabinet Funding Scheme: Research Support for Counter Terrorism
	Leak resistant arithmetic for cryptography Awarded by: National Centre for Scientific Research (CNRS France) Funding Scheme: Project International for Scientific Cooperation (PICS)

Advisees

Graduate Advising Relationship

Degree	Research Title	Advisee
Doctor of Philosophy	Lattice-based Cryptography: Expanding the Design Space	Sipasseuth, Arnaud
Doctor of Philosophy	Lattices for a post-quantum cryptography	Lesavourey, Andrea
Doctor of Philosophy	Contributions to Lattice-based Cryptography	Le, Huy

Keywords

Post-quantum cryptography (i.e quantum resistant cryptography), homomorphic encryption, lattice based cryptology, elliptic curve cryptography, side chanel resistant, modular arithmetic, number system

Located In Facility

Building 3, Room 222

Orcid Id

http://orcid.org/0000-0003-2521-2520 (confirmed)

Scopus Id

9335227800

Overview

Overview

Available as Research Supervisor

Affiliation

Member Of

Publications

Selected Publications

Journal Article

Conference Paper

Funding

Investigator On

Supervision

Available as Research Supervisor

Advisees

Graduate Advising Relationship

Background

Keywords

Contact

Located In Facility

Identity

Orcid Id

Scopus Id

Overview

Affiliation

Member Of

Publications

Selected Publications

Journal Article

Conference Paper

Funding

Investigator On

Supervision

Advisees

Graduate Advising Relationship

Background

Keywords

Contact

Located In Facility

Identity

Orcid Id

Scopus Id

Visualisations