Efficient Updatable Public-Key Encryption from Lattices

C Abou Haidar, A Passelègue, D Stehlé - … on the Theory and Application of …, 2023 - Springer
Updatable public key encryption has recently been introduced as a solution to achieve
forward-security in the context of secure group messaging without hurting efficiency, but so …

NTRU in quaternion algebras of bounded discriminant

C Ling, A Mendelsohn - International Conference on Post-Quantum …, 2023 - Springer
The NTRU assumption provides one of the most prominent problems on which to base post-
quantum cryptography. Because of the efficiency and security of NTRU-style schemes …

On the Multi-user Security of LWE-Based NIKE

R Langrehr - Theory of Cryptography Conference, 2023 - Springer
Non-interactive key exchange (NIKE) schemes like the Diffie-Hellman key exchange are a
widespread building block in several cryptographic protocols. Since the Diffie-Hellman key …

[HTML][HTML] Hardness of (M) LWE with semi-uniform seeds

W Jia, J Zhang, B Xiang, B Wang - Theoretical Computer Science, 2024 - Elsevier
Abstract Let (D, S, χ, m)-LWE n, q be the LWE problem in matrix form (A, y= As+ e mod q),
where A, s, e are randomly chosen respectively from the seed distribution D over Z qm× n …

Hardness of (Semiuniform) MLWE with Short Distributions Using the Rényi Divergence

W Jia, B Wang - IET Information Security, 2023 - Wiley Online Library
The module learning with errors (MLWE) problem has attracted considerable attention for its
tradeoff between security and efficiency. The quantum/classical worst‐case to average‐case …

Hardness of Module‐LWE with Semiuniform Seeds from Module‐NTRU

W Jia, J Zhang, B Wang - IET Information Security, 2023 - Wiley Online Library
The module learning with errors (MLWE) problem has attracted significant attention and has
been widely used in building a multitude of lattice‐based cryptographic primitives. The …

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 …

Hardness of entropic module-LWE

H Lin, M Wang, J Zhuang, Y Wang - Cryptology ePrint Archive, 2020 - eprint.iacr.org
Abstract The Learning with Errors (LWE) problem is a versatile basis for building various
purpose post-quantum schemes. Goldwasser et al.[ISC 2010] initialized the study of a …

Hardness of entropic module-LWE

H Lin, M Wang, J Zhuang, Y Wang - Theoretical Computer Science, 2024 - Elsevier
Abstract The Learning with Errors (LWE) problem is a versatile basis for building various
purpose post-quantum schemes. Goldwasser et al.[ISC 2010] initialized the study of a …