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

Modern Electronics Technique

Two Kinds of Method to Construct Oblivious Transfer Protocols

Huang Gen-xun

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

As a fundamental cryptology protocol,oblivious transfer is applied abroad in practice.The methods to construct the protocol are divided into two kinds,direct and indirect.With the help of idea of the representation of integer in base t and the DDH assumption,it proposes a kind of indirect method to construct the protocol with lower computation complexity based on Naor-Pinkas′s scheme,moreover,another kind of direct method is put forward in terms of the some public cryptosystems with homomorphism.

Related papers

Obtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions

Bernardo David, Anderson C. A. Nascimento, Rafael Tonicelli

We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwise, when regular statistically lossy cryptosystems are employed in this construction, it yields oblivious transfer protocols with statistical security for the sender. The construction introduced in this paper is realizable from rerandomizable, homomorphic and lossy cryptosystems in general. Thus, it yields specific constructions based on different assumptions, such as DDH, LWE and McEliece. Moreover, it proves the equivalence of fully simulatable oblivious transfer and lossy encryption.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Nov 6, 2011•0 citations

Cut-and-Choose Bilateral Oblivious Transfer

Chuan Zhao, Han Jiang, Xiaochao Wei +1 more

Oblivious transfer is a fundamental tool in modern cryptography. It plays an important role in the research of security protocols. In recent years, many oblivious transfer variants with more powerful functionalities are proposed, so as to be fit in different kinds of requirements and scenarios. In this paper, a new oblivious transfer variant, called cut-and-choose bilateral oblivious transfer, is proposed. Based on homomorphic encryption, an efficient one-round protocol of this primitive is constructed, accompanied with rigorous security proof in semi-honest model. When applied in security protocols based on cut-and-choose technique (especially in secure two-party computation), cut-and-choose bilateral oblivious transfer enables a more modular high-level description of the protocol framework, as well as reduces the round complexity of the protocols. Besides, as a basic tool in the information security area, this primitive itself is of independent research interest.

•Jan 1, 2016•2 citations

Analysis on A 1-out-n Security Protocol Based on Threshold Idea

Yu Li, Jun Yao Ye

In a 1-out-n oblivious transfer model, the sender sends n messages to the receiver. But the receiver can only get 1 message from the n messages, and the sender does not know which message the receiver has gotten. In this paper, we proposed a multiple-use 1-out-n oblivious transfer protocol based on threshold idea. It is more efficient than Naor-Pinkas protocol[1] and Tzeng protocol[2].

Advanced materials research•Dec 1, 2012•0 citations

Efficient 1-Out-2 Oblivious Transfer Schemes Based on EDDH Assumption

Huawei Huang, Chunhua Li

This paper proposes an efficient 1-out-2 oblivious transfer scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The computation time of the 1-out-2 oblivious transfer scheme is very efficient, too. The receiver need compute 4 modular exponentiations only, and the sender need compute 8 modular exponentiations. The new construction is secure if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new scheme is a good replacement for Wen-Guey Tzeng's oblivious transfer schemes when bilinear group is adopted as construction platform.

International Conference on Network Computing and Information Security•May 1, 2011•0 citations

A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation.

Mei Wang, Zheng Yuan, Feng Xiao

We proposed a new secure oblivious transfer protocol from indistinguishability obfuscation in this paper. Our main technical tool is the candidate indistinguishability obfuscation introduced in [1] and a dual-mode cryptosystem proposed in [2]. Following their steps, we presents a new k-out-of-l oblivious transfer protocol, its realization from DDH is described in this paper, in which we combined indistinguishability obfuscation with the dual-mode cryptosystem. The security of our scheme mainly relies on the indistinguishability of the obf-branches ( corresponding to the two modes in dual-mode model). Our paper explores a new way for the application of indistinguishability obfuscation.

•Jan 1, 2015•0 citations

Efficient Fully-Simulatable Oblivious Transfer.

Yehuda Lindell

Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryp-tographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant), one party known as the sender has a pair of messages and the other party known as the receiver obtains one of them. Somewhat paradoxically, the receiver obtains exactly one of the messages (and learns nothing of the other), and the sender does not know which of the messages the receiver obtained. Due to its importance as a building block for secure protocols, the efficiency of oblivious transfer protocols has been extensively studied. However, to date, there are almost no known oblivious transfer protocols that are secure in the presence of malicious adversaries under the real/ideal model simulation paradigm (without using general zero-knowledge proofs). Thus, efficient protocols that reach this level of security are of great interest. In this paper we present efficient oblivious transfer protocols that are secure according to the ideal/real model simulation paradigm. We achieve constructions under the DDH, Nth residuosity and quadratic residuosity assumptions, as well as under the assumption that homomorphic encryption exists. 1

Chicago Journal of Theoretical Computer Science•Jan 1, 2008•2 citations
As a fundamental cryptology protocol,oblivious transfer is applied abroad in practice.The methods to construct the protocol are divided into two kinds,direct and indirect.With the help of idea of the representation of integer in base t and the DDH assumption,it proposes a kind of indirect method to construct the protocol with lower computation complexity based on Naor-Pinkas′s scheme,moreover,another kind of direct method is put forward in terms of the some public cryptosystems with homomorphism.
We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwise, when regular statistically lossy cryptosystems are employed in this construction, it yields oblivious transfer protocols with statistical security for the sender. The construction introduced in this paper is realizable from rerandomizable, homomorphic and lossy cryptosystems in general. Thus, it yields specific constructions based on different assumptions, such as DDH, LWE and McEliece. Moreover, it proves the equivalence of fully simulatable oblivious transfer and lossy encryption.
Oblivious transfer is a fundamental tool in modern cryptography. It plays an important role in the research of security protocols. In recent years, many oblivious transfer variants with more powerful functionalities are proposed, so as to be fit in different kinds of requirements and scenarios. In this paper, a new oblivious transfer variant, called cut-and-choose bilateral oblivious transfer, is proposed. Based on homomorphic encryption, an efficient one-round protocol of this primitive is constructed, accompanied with rigorous security proof in semi-honest model. When applied in security protocols based on cut-and-choose technique (especially in secure two-party computation), cut-and-choose bilateral oblivious transfer enables a more modular high-level description of the protocol framework, as well as reduces the round complexity of the protocols. Besides, as a basic tool in the information security area, this primitive itself is of independent research interest.
This paper proposes an efficient 1-out-2 oblivious transfer scheme from fundamental cryptographic techniques directly. It achieves optimal efficiency in terms of the number of rounds and the total number of exchanged messages for the case that the receiver's choice is unconditionally secure. The computation time of the 1-out-2 oblivious transfer scheme is very efficient, too. The receiver need compute 4 modular exponentiations only, and the sender need compute 8 modular exponentiations. The new construction is secure if the EDDH assumption holds. Since EDDH assumption is weaker than DDH assumption for generic bilinear groups, the new scheme is a good replacement for Wen-Guey Tzeng's oblivious transfer schemes when bilinear group is adopted as construction platform.
We proposed a new secure oblivious transfer protocol from indistinguishability obfuscation in this paper. Our main technical tool is the candidate indistinguishability obfuscation introduced in [1] and a dual-mode cryptosystem proposed in [2]. Following their steps, we presents a new k-out-of-l oblivious transfer protocol, its realization from DDH is described in this paper, in which we combined indistinguishability obfuscation with the dual-mode cryptosystem. The security of our scheme mainly relies on the indistinguishability of the obf-branches ( corresponding to the two modes in dual-mode model). Our paper explores a new way for the application of indistinguishability obfuscation.
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryp-tographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant), one party known as the sender has a pair of messages and the other party known as the receiver obtains one of them. Somewhat paradoxically, the receiver obtains exactly one of the messages (and learns nothing of the other), and the sender does not know which of the messages the receiver obtained. Due to its importance as a building block for secure protocols, the efficiency of oblivious transfer protocols has been extensively studied. However, to date, there are almost no known oblivious transfer protocols that are secure in the presence of malicious adversaries under the real/ideal model simulation paradigm (without using general zero-knowledge proofs). Thus, efficient protocols that reach this level of security are of great interest. In this paper we present efficient oblivious transfer protocols that are secure according to the ideal/real model simulation paradigm. We achieve constructions under the DDH, Nth residuosity and quadratic residuosity assumptions, as well as under the assumption that homomorphic encryption exists. 1