Analysis of Learning With Errors in Query Access Model: A List Decoding Approach

Mingqiang WANG; Jincheng ZHUANG

doi:10.11999/JEIT190624

Volume 42 Issue 2

Feb. 2020

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2020 > 42(2): 322-326

Mingqiang WANG, Jincheng ZHUANG. Analysis of Learning With Errors in Query Access Model: A List Decoding Approach[J]. Journal of Electronics & Information Technology, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624

Citation:

Mingqiang WANG, Jincheng ZHUANG. Analysis of Learning With Errors in Query Access Model: A List Decoding Approach[J]. Journal of Electronics & Information Technology, 2020, 42(2): 322-326. doi: 10.11999/JEIT190624

Citation:

PDF( 448 KB)

Analysis of Learning With Errors in Query Access Model: A List Decoding Approach

doi: 10.11999/JEIT190624

Mingqiang WANG^{1, 2},
Jincheng ZHUANG^{1, 3
,
,}

1.
Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education Shandong University, Qingdao 266237, China
2.
School of Mathematics, Shandong University, Jinan 250100, China
3.
School of Cyber Science and Technology, Shandong University, Qingdao 266237, China

Funds: The National Natural Science Foundation of China (61672019)

Received Date: 2019-08-14
Rev Recd Date: 2019-12-05

Available Online: 2019-12-09

Publish Date: 2020-02-19

Abstract

Abstract

Regev introduced the Learning With Errors (LWE) problem in 2005, which has close connections to random linear code decoding and has found wide applications to cryptography, especially to post-quantum cryptography. The LWE problem is originally introduced in random access model, and there are evidences that indicate the hardness of this problem. It is well known that the LWE problem is vulnerable if the attacker is allowed to choose samples. However, to the best of the author’s knowledge, a complete algorithm has not been published. In this paper, the LWE problem in query samples access model is analyzed. The technique is to relate the problem to the hidden number problem, and then Fourier learning method is applied to the list decoding.
- Learning With Errors (LWE) problem,
- Query access model,
- Hidden number problem,
- Fourier learning,
- List decoding

FullText(HTML)

References(12)

References

KEARNS M J and VAZIRANI U V. An Introduction to Computational Learning Theory[M]. Cambridge, London England: The MIT Press, 1994.

BLUM A, KALAI A, and WASSERMAN H. Noise-tolerant learning, the parity problem, and the statistical query model[J]. Journal of the ACM, 2003, 50(4): 506–519. doi: 10.1145/792538.792543

PIETRZAK K. Cryptography from learning parity with noise[C]. The 38th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, 2012: 99–114.

REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]. The 37th Annual ACM Symposium on Theory of Computing, Baltimore, USA, 2005: 84–93.

BONEH D and VENKATESAN R. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes[C]. The 16th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 1996: 129–142.

GALBRAITH S D and SHANI B. The multivariate hidden number problem[C]. The 8th International Conference on Information Theoretic Security, Lugano, Switzerland, 2015: 250–268.

GOLDREICH O and LEVIN L A. A hard-core predicate for all one-way functions[C]. The 21st Annual ACM Symposium on Theory of Computing, Seattle, USA, 1989: 25–32.

KUSHILEVITZ E and MANSOUR Y. Learning decision trees using the Fourier spectrum[C]. The 23rd Annual ACM Symposium on Theory of Computing, New Orleans, USA, 1991: 455–464.

AKAVIA A, GOLDWASSER S, and SAFRA S. Proving hard-core predicates using list decoding[C]. The 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, USA, 2003: 146–157.

GALBRAITH S D, LAITY J, and SHANI B. Finding significant Fourier coefficients: Clarifications, simplifications, applications and limitations[J]. Chicago Journal of Theoretical Computer Science, 2018, 6: 1–38.

AKAVIA A. Solving hidden number problem with one bit oracle and advice[C]. The 29th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, USA, 2009: 337–354.

MICCIANCIO D and MOL P. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions[C]. The 31st Annual Conference on Advances in Cryptology, Santa Barbara, USA, 2011: 465–484.

Relative Articles

Supplements(0)

Cited By

Proportional views