Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Worst-Case to Average-Case Hardness of LWE: An Alternative Perspective

Divesh Aggarwal, Jin Ming Leong, Alexandra Veliche

Published Nov 27, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-78017-2_11

Related papers

Worst and Average Case Hardness of Decoding via Smoothing Bounds

Thomas Debris-Alazard, Nicolas Resch

Lecture notes in computer science•Jan 1, 2025•7 citations

The Hardness of LWE and Ring-LWE: A Survey.

David Balbás

•Jan 1, 2021•2 citations

LWE-based identification schemes

Rosemberg Silva, Antonio C. de A. Campello, Ricardo Dahab

Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•6 citations

Hardness of Entropic Module-LWE

Hao Lin, Mingqiang Wang, Jincheng Zhuang +1 more

Theoretical Computer Science•Apr 8, 2024•6 citations

LWE-based Identification Schemes

Rosemberg Silva, Antonio C. de A. Campello, Ricardo Dahab

Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their performance and security. We also highlight the design choices that make our solution of both theoretical and practical interest.

arXiv:1109.0631•Sep 3, 2011•1 citation

New variant for Learning with Errors Problem

Xuyang Wang, Aiqun Hu, Hao Fang

The Learning with Errors (LWE) problem is a special average-case lattice problem, which has proved to be as hard as worst-case lattice problems. By this property, it has become the cornerstones for a series of cryptographic applications under the security assumption of worst-case lattice problems. However, the efficiency of these applications are not high. Therefore, how to improve the efficiency of cryptographic applications based on LWE is an urgent problem to be solved. In this paper, a new variant of LWE is proposed. By using trapdoor composed by lattice-based matrix and its dual orthogonal matrix, we construct a more efficient public key encryption (PKE) scheme based on the variant. Furthermore, by the hardness of the variant problem, we prove the new PKE scheme is chosen plaintext attack (CPA) secure. At last, we analyze the homomorphism property of the new PKE scheme.

Procedia Computer Science•Jan 1, 2018•3 citations
The Learning with Errors (LWE) problem is a special average-case lattice problem, which has proved to be as hard as worst-case lattice problems. By this property, it has become the cornerstones for a series of cryptographic applications under the security assumption of worst-case lattice problems. However, the efficiency of these applications are not high. Therefore, how to improve the efficiency of cryptographic applications based on LWE is an urgent problem to be solved. In this paper, a new variant of LWE is proposed. By using trapdoor composed by lattice-based matrix and its dual orthogonal matrix, we construct a more efficient public key encryption (PKE) scheme based on the variant. Furthermore, by the hardness of the variant problem, we prove the new PKE scheme is chosen plaintext attack (CPA) secure. At last, we analyze the homomorphism property of the new PKE scheme.