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

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

Published Jan 1, 2022• 7 citations
Publisher
DOI
10.1007/978-3-031-06944-4_7

Related papers

Lattice-based oblivious transfer protocol

Zhenhua Liu

Utilizing a trapdoor one-way function based on learning with errors(LWE),a three moves oblivious transfer(OT) protocol was proposed.Both the privacy of the receiver's choice and the secrecy of the unchosen secret were based on the hardness of the LWE problem.Since merely modular multiplication and modular addition operations were used,the proposed OT protocol was efficient.Moreover,the plaintext-to-ciphertext expansion factor was amortized,which sig-nificantly shortened the message length,and made the protocol achieved optimal efficiency.

Journal of Communications•Jan 1, 2011•1 citation

Superposition Attack on OT Protocols.

Ehsan Ebrahimi, Céline Chevalier, Marc A. Kaplan +1 more

•Jan 1, 2020•2 citations

Robust Distributed Multiplication without Interaction

Masayuki Abe

Lecture notes in computer science•Jan 1, 1999•35 citations

Efficient Oblivious Transfer Protocol Based on Bilinear Pairing

Zhenhua Chen

Oblivious Transfer(OT) protocol is an important primitive for designing cryptographic protocols.Designing OT protocol from bilinear pairing not only extends the bilinear pairing application but also increases the design technique of OT,which has important practical significance.This paper utilizes bilinear pairing to design a k-out-of-n OT protocol.The new protocol can protect both receiver’s privacy and sender’s privacy.The new protocol also can resist impersonation attacks,replay attacks and man-in-the-middle attacks.It can be used in an insecure channel,and the protocol has high efficiency.

Jisuanji gongcheng•Jan 1, 2013•1 citation

Quantum Algorithms and Protocols

David Peter Divincenzo

APS•Jun 1, 2001•0 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
Utilizing a trapdoor one-way function based on learning with errors(LWE),a three moves oblivious transfer(OT) protocol was proposed.Both the privacy of the receiver's choice and the secrecy of the unchosen secret were based on the hardness of the LWE problem.Since merely modular multiplication and modular addition operations were used,the proposed OT protocol was efficient.Moreover,the plaintext-to-ciphertext expansion factor was amortized,which sig-nificantly shortened the message length,and made the protocol achieved optimal efficiency.
Oblivious Transfer(OT) protocol is an important primitive for designing cryptographic protocols.Designing OT protocol from bilinear pairing not only extends the bilinear pairing application but also increases the design technique of OT,which has important practical significance.This paper utilizes bilinear pairing to design a k-out-of-n OT protocol.The new protocol can protect both receiver’s privacy and sender’s privacy.The new protocol also can resist impersonation attacks,replay attacks and man-in-the-middle attacks.It can be used in an insecure channel,and the protocol has high efficiency.
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.