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

Dual-Mode Cryptosystem Based on the Learning with Errors Problem

Jingnan He, Wenpan Jing, Bao Li, Xianhui Lu, Dingding Jia

Published Jan 1, 2017• 2 citations
Publisher
DOI
10.1007/978-3-319-59870-3_29

Related papers

Provable Dual Attacks on Learning with Errors

Amaury Pouly, Yixin Shen

Lecture notes in computer science•Jan 1, 2024•29 citations

Revocable Cryptography from Learning with Errors

Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan

arXiv:2302.14860•Lecture notes in computer science•Jan 1, 2023•23 citations

Efficient oblivious transfer construction via multiple bits dual-mode cryptosystem for secure selection in the cloud

Zengpeng Li, Chunguang Ma, Minghao Zhao +1 more

Cloud computing is a promising paradigm to provide flexible and reliable services. Nevertheless, concern and anxiety about data security and tenants’ privacy are still a major barrier for the popularity of cloud computing. Oblivious transfer (OT) is a cryptographic primitive that enables a client to selectively retrieve data in a privacy-preserving manner. It can be used to construct high-level protocols enabling applications in the cloud-computing paradigm. Technically, it has been proven that OT protocols can be constructed using a CPA-secure public-key encryption scheme. Along these lines, Peikert et al. formulated a dual-mode cryptosystem on which they constructed a single-bit OT scheme. Obviously, it has deficiencies in performance, which makes it unqualified for use in cloud-computing scenarios. This paper aims at providing an efficient multi-bit OT scheme for secure cloud applications. We first propose a multi-bit dual-mode cryptosystem based on the learning with errors (LWE) problem. Based on this multi-bit dual-mode cryptosystem, we construct a multi-bit OT. We present details of the OT construction together with security analysis of our scheme, and finally provide an example of how it can be used in specific application scenarios.

Journal of the Chinese Institute of Engineers•Jan 2, 2019•5 citations

On the Hardness of the Asymmetric Learning With Errors Problem

Jiang Zhang, Shuqin Fan

Due to the advantages such as the worst-case hardness assumption, lattice-based cryptography is believed to the most promising research direction in post-quantum cryptography. As one of the two main hard problems commonly used in lattice-based cryptography, Learning With Errors (LWE) problem is widely used in constructing numerous cryptosystems. In order to improve the efficiency of lattice-based cryptosystems, Zhang et al. (2019) introduced the Asymmetric LWE (ALWE) problem. In this paper, the relation between the ALWE problem and the standard LWE problem is studied, and it shows that for certain error distributions the two problems are polynomially equivent, which paves the way for constructing secure lattice-based cryptosystems from the ALWE problem.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Feb 19, 2020•0 citations

Identity-Based Lossy Encryption from Learning with Errors

Jingnan He, Bao Li, Xianhui Lu +3 more

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

Efficient Laconic Cryptography from Learning with Errors

Nico Döttling, Dimitris Kolonelos, Russell W. F. Lai +3 more

Lecture notes in computer science•Jan 1, 2023•55 citations
Cloud computing is a promising paradigm to provide flexible and reliable services. Nevertheless, concern and anxiety about data security and tenants’ privacy are still a major barrier for the popularity of cloud computing. Oblivious transfer (OT) is a cryptographic primitive that enables a client to selectively retrieve data in a privacy-preserving manner. It can be used to construct high-level protocols enabling applications in the cloud-computing paradigm. Technically, it has been proven that OT protocols can be constructed using a CPA-secure public-key encryption scheme. Along these lines, Peikert et al. formulated a dual-mode cryptosystem on which they constructed a single-bit OT scheme. Obviously, it has deficiencies in performance, which makes it unqualified for use in cloud-computing scenarios. This paper aims at providing an efficient multi-bit OT scheme for secure cloud applications. We first propose a multi-bit dual-mode cryptosystem based on the learning with errors (LWE) problem. Based on this multi-bit dual-mode cryptosystem, we construct a multi-bit OT. We present details of the OT construction together with security analysis of our scheme, and finally provide an example of how it can be used in specific application scenarios.
Due to the advantages such as the worst-case hardness assumption, lattice-based cryptography is believed to the most promising research direction in post-quantum cryptography. As one of the two main hard problems commonly used in lattice-based cryptography, Learning With Errors (LWE) problem is widely used in constructing numerous cryptosystems. In order to improve the efficiency of lattice-based cryptosystems, Zhang et al. (2019) introduced the Asymmetric LWE (ALWE) problem. In this paper, the relation between the ALWE problem and the standard LWE problem is studied, and it shows that for certain error distributions the two problems are polynomially equivent, which paves the way for constructing secure lattice-based cryptosystems from the ALWE problem.