Identity-based encryption from lattices using approximate trapdoors

M Izabachène, L Prabel, A Roux-Langlois - Australasian Conference on …, 2023 - Springer
Practical implementations of advanced lattice-based constructions have received much
attention since the first practical scheme instantiated over NTRU lattices, proposed by Prest …

Design of advanced post-quantum signature schemes

C Jeudy - 2024 - hal.science
The transition to post-quantum cryptography has been an enormous effort for cryptographers
over the last decade. In the meantime, cryptography for the protection of privacy, aiming at …

A Lamus‐Based Flight Data Sharing Model on Consortium Blockchain

F Li, Y Cui, B Huang, S Yu, P Liu… - Security and …, 2022 - Wiley Online Library
Currently, traditional flight data sharing models cannot resist quantum attacks, which poses
the risk of data leakage. The research on the flight data sharing model against quantum …

Trapdoors in lattice-based cryptography: applications and implementation

L Prabel - 2023 - theses.hal.science
Lattice-based cryptography has established itself as a promising candidate among the major
families of post-quantum cryptography, offering a wide range of attractive features. The work …

New Trapdoor and Preimage Sampling on NTRU Lattice

C Liu, C Tang, H Jia - International Conference on Frontiers in Cyber …, 2022 - Springer
Despite the importance of preimage sampling algorithm in lattice-based cryptography, its
low efficiency limits its applications. In this study, we propose a family of gadget-based …

On the (M) iNTRU assumption in the integer case

J Barthel, V Müller, R Roşie - International Conference on Provable …, 2021 - Springer
Abstract In AsiaCrypt 2019, Genise, Gentry, Halevi, Li and Micciancio put forth two novel and
intriguing computational hardness hypotheses: The inhomogeneous NTRU (iNTRU iNTRU) …

On the (M) iNTRU Assumption in the Integer Case

J Luxembourg - … , ProvSec 2021, Guangzhou, China, November 5 …, 2021 - books.google.com
In AsiaCrypt 2019, Genise, Gentry, Halevi, Li and Micciancio put forth two novel and
intriguing computational hardness hypotheses: The inhomogeneous NTRU (iNTRU) …

Check for updates

P Xu, LP Wang - … , ACISP 2023, Brisbane, QLD, Australia, July 5 …, 2023 - books.google.com
Homomorphic secret sharing (HSS) allows participants to share their private data between
computing servers for the joint computation of a public function without fully homomorphic …