Lianglin Yan

dblp:398/4118 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0000-8378-9446ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 3 first-author · 3 since 2021
YearPublicationVenuePosition
2026 Faster Bootstrapping for CKKS with Less Modulus Consumption
Lianglin Yan, Pengfei Zeng, Heyang Cao, Peizhe Song, Mingsheng Wang
PKC (4)1
2025 Turtle Wins Rabbit Again: Faster Modulus Reduction for RNS-CKKS
Lianglin Yan, Pengfei Zeng, Mingsheng Wang
ICICS (1)1
2025 Speedup signing: pre-rejection sampling towards dilithium
abstract
Abstract Security and efficiency have always been two critical factors in the development of post-quantum digital signatures. As the best-known scheme, (Ducas et al., TCHES 2018) is SUF-CMA in QROM and has a relatively fast efficiency with many untrivial optimizations. The goal of this paper is to propose some techniques that can promote signing speed without sacrificing security. We first propose the pre-rejection sampling technique in stage to reduce the rejections of the fourth condition, consequently resulting in some speedup in stage. To prove security, we propose the c-selected MLWE problem, a variant of MLWE that can offer the equivalent security as original MLWE. Applying these two techniques to , we obtain an advanced signature scheme with better efficiency, and without any other losses except some pre-computations. Security reduction demonstrates that our scheme is also SUF-CMA in QROM. The experimental results show that pre-rejection sampling achieves a $$47\%$$ 47 % , $$22\%$$ 22 % , and $$17\%$$ 17 % reduction in the rejection probability of the fourth condition over scheme when the parameter set corresponds to NIST’s security levels 2, 3 and 5, respectively. This type of reduction increases signing speed by approximately $$1\%$$ 1 % under the parameter set 2 of .
Lianglin Yan, Mingsheng Wang
Cybersecur.1