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

A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation.

Mei Wang, Zheng Yuan, Feng Xiao

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

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.

Related papers

A LWE-based Oblivious Transfer Protocol from Indistinguishability Obfuscation.

Shanshan Zhang

International journal of network security•Jan 1, 2020•0 citations

Ciphertext Obfuscation-based Oblivious Transfer Protocol

LI Xiaodong, ZHU Xiaopeng, ZHANG Jianyi, WU Yong, DOU Yimeng

The Oblivious Transfer (OT) protocol is a privacy-preserving two-way communication protocol important for building secure multiparty computations. To exchange symmetric keys, this protocol is typically based on the Rivest—Shamir—Adleman (RSA) or Diffie—Hellman (DH) cryptographic systems, which are used for encryption during the message-encryption phase. However, in existing OT protocols, the generation of multiple pairs of public and private keys and data computations are time-consuming. Using bijective functions to transform the ciphertext within the same ciphertext domain can ensure indistinguishability after decryption and reduce the computational complexity. In the semi-honest model, a ciphertext obfuscation-based OT protocol framework is proposed and OT protocols are instantiated based on RSA and DH within this framework. Compared with RSA-based encryption schemes, the proposed protocol requires only one pair of public and private keys. When the number of public and private keys is reduced to one, the receiver can use the public key in the digital certificate of the sender to implement the OT protocol using an identity authentication function. Compared with the OT protocol based on the DH key exchange, this protocol has a small data transmission volume and low computational complexity. Experimental results show that, compared with existing OT protocols, the efficiency of instantiated protocols in the key exchange stage can be improved by at least 30%. Moreover, this protocol can be used as a basic protocol for privacy set intersections, obfuscation circuits, and OT extension protocols.

•Jan 1, 2026•0 citations

Secure oblivious transfer protocol from indistinguishability obfuscation

Zheng Yuan, Mei Wang, Feng Xiao

中国邮电高校学报：英文版•Jun 1, 2016•1 citation

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

Secure oblivious transfer protocol from indistinguishability obfuscation

Yuan, Zheng Zheng, Wang +3 more

中国邮电高校学报：英文版•Jan 1, 2016•0 citations

Two Kinds of Method to Construct Oblivious Transfer Protocols

Huang Gen-xun

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.

Modern Electronics Technique•Jan 1, 2007•0 citations
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.
The Oblivious Transfer (OT) protocol is a privacy-preserving two-way communication protocol important for building secure multiparty computations. To exchange symmetric keys, this protocol is typically based on the Rivest—Shamir—Adleman (RSA) or Diffie—Hellman (DH) cryptographic systems, which are used for encryption during the message-encryption phase. However, in existing OT protocols, the generation of multiple pairs of public and private keys and data computations are time-consuming. Using bijective functions to transform the ciphertext within the same ciphertext domain can ensure indistinguishability after decryption and reduce the computational complexity. In the semi-honest model, a ciphertext obfuscation-based OT protocol framework is proposed and OT protocols are instantiated based on RSA and DH within this framework. Compared with RSA-based encryption schemes, the proposed protocol requires only one pair of public and private keys. When the number of public and private keys is reduced to one, the receiver can use the public key in the digital certificate of the sender to implement the OT protocol using an identity authentication function. Compared with the OT protocol based on the DH key exchange, this protocol has a small data transmission volume and low computational complexity. Experimental results show that, compared with existing OT protocols, the efficiency of instantiated protocols in the key exchange stage can be improved by at least 30%. Moreover, this protocol can be used as a basic protocol for privacy set intersections, obfuscation circuits, and OT extension protocols.
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.
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.