95
Views
4
CrossRef citations to date
0
Altmetric
Information Engineering

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

ORCID Icon, , &
Pages 97-106 | Received 07 Aug 2017, Accepted 13 Jun 2018, Published online: 20 Feb 2019
 

ABSTRACT

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.

SUBJECT INDEX:

The nomenclature table is as follows:

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant number 61472097 and 61802214] and National Research Foundation of 725 Korea [grant number 2017R1E1A1A01077913].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.