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

International Conference on Network Computing and Information Security

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

Huawei Huang, Chunhua Li

Published May 1, 2011• 0 citations
Publisher

Abstract

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.

DOI
10.1109/ncis.2011.188

Related papers

Efficient k-out-of-n Oblivious Transfer Schemes

Cheng Kang Chu, Wen-Guey Tzeng

Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in which the receiver R sends O(k) messages to the sender S, andS sends O(n) messages back to R. The schemes provide unconditional security for either sender or receiver. The computational security for the other side is based on the Decisional Diffie-Hellman (DDH) or Chosen-Target Computational Diffie-Hellman (CT-CDH) problems. Our schemes have the nice property of universal parameters, that is, each pair of R and S need not hold any secret before performing the protocol. The system parameters can be used by all senders and receivers without any trapdoor specification. In some cases, our OT k n schemes are the most efficient ones in terms of the communication cost, either in rounds or the number of messages. Moreover, one of our schemes is extended to an adaptive oblivious transfer scheme. In that scheme, S sends O(n) messages to R in one round in the commitment phase. For each query of R, onlyO(1) messages are exchanged and O(1) operations are performed. The preliminary version of this paper was published at PKC ’05 [Chu and Tzeng 2005].

•Jan 1, 2007•24 citations

Twot-out-of-n oblivious transfer schemes with designated receiver

Jianhong Zhang, Zou Wei

Oblivious transfer (OT) protocol is a fundamental cryptographical tool and widely used as a building block of secure computation. In this work, we propose two efficient t -out-of- n oblivious transfer schemes with the designated receiver. A common advantage of the two schemes is efficient. The total computation cost of the sender and the receiver is n +2 t +1 modular exponentiations in first scheme that is three-round, and the total one of the sender and receiver is n +3 t modular exponentiations in second scheme that is two-round. Another advantage of both schemes is designable.

Wuhan University Journal of Natural Sciences•Nov 1, 2006•1 citation

Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters

Wen-Guey Tzeng

We propose efficient and secure (string) oblivious transfer (OT/sup 1//sub n/) schemes for any n/spl ges/2. We build our OT/sup 1//sub n/ scheme from fundamental cryptographic techniques directly. The receiver's choice is unconditionally secure and the secrecy of the unchosen secrets is based on the hardness of the decisional Diffie-Hellman problem. Some schemes achieve 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 distinct feature of our scheme is that the system-wide parameters are independent of n and universally usable, that is, all possible receivers and senders use the same parameters and need no trapdoors specific to each of them. We extend our OT/sup 1//sub n/ schemes to distributed oblivious transfer schemes. Our distributed OT/sup 1//sub n/ schemes take full advantage of the research results of secret sharing. For applications, we present a method of transforming any (single-database) PIR protocol into a symmetric PIR protocol by slightly increasing the communication cost only.

IEEE Transactions on Computers•Feb 1, 2004•93 citations

Non-interactive Oblivious Transfer Protocols

Jing Qin, Zhao Huawei, Mingqiang Wang

Two novel constructions of one out of n oblivious transfer protocols from bilinear maps between groups are proposed. The protocols satisfy the category of non-interactive, mean that any sender S can obliviously transfer some secret(s) to a receiver R, but R does not send any messages back to S. The choice of a receiver is unconditionally secure. A sender's secrecy is guaranteed if the receiver is semi-honest in a standard model since the decision bilinear Diffie-Hellman problem is hard and the sender's secrecy is achieved when the receiver is a malicious party in a random oracle model since the bilinear Diffie-Hellman problem assumption holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.

International Forum on Information Technology and Applications•May 1, 2009•3 citations

An efficient composable 1-out-of-2 oblivious transfer scheme using vector decomposition

I. Praveen, S. S. Aravind Vishnu, Madathil Sethumadhavan

A k-out-of-n oblivious transfer scheme is the interaction between a receiver and a sender where the sender possesses the messages m1, m2, … mn. The receiver needs to access k messages out of the n messages. The scheme is a mechanism in which the receiver obtains no more than the messages m1, m2, … mk which the receiver queried for with the indices 1, 2, … k being oblivious to the sender. We put forward a 1-out-of-2 oblivious transfer scheme. The security of our scheme is based on a decisional subspace assumption, decisional linear assumption and the computational infeasibility of vector decomposition problem a.k.a vector decomposition problem (VDP) assumption. Our scheme uses points on an elliptic curve as the ciphertext. Further, we prove the security of the proposed construction in the universal composability framework by using FCRS - hybrid model.

International Journal of Advanced Intelligence Paradigms•Jan 1, 2024•1 citation

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
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.
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in which the receiver R sends O(k) messages to the sender S, andS sends O(n) messages back to R. The schemes provide unconditional security for either sender or receiver. The computational security for the other side is based on the Decisional Diffie-Hellman (DDH) or Chosen-Target Computational Diffie-Hellman (CT-CDH) problems. Our schemes have the nice property of universal parameters, that is, each pair of R and S need not hold any secret before performing the protocol. The system parameters can be used by all senders and receivers without any trapdoor specification. In some cases, our OT k n schemes are the most efficient ones in terms of the communication cost, either in rounds or the number of messages. Moreover, one of our schemes is extended to an adaptive oblivious transfer scheme. In that scheme, S sends O(n) messages to R in one round in the commitment phase. For each query of R, onlyO(1) messages are exchanged and O(1) operations are performed. The preliminary version of this paper was published at PKC ’05 [Chu and Tzeng 2005].
Oblivious transfer (OT) protocol is a fundamental cryptographical tool and widely used as a building block of secure computation. In this work, we propose two efficient t -out-of- n oblivious transfer schemes with the designated receiver. A common advantage of the two schemes is efficient. The total computation cost of the sender and the receiver is n +2 t +1 modular exponentiations in first scheme that is three-round, and the total one of the sender and receiver is n +3 t modular exponentiations in second scheme that is two-round. Another advantage of both schemes is designable.
We propose efficient and secure (string) oblivious transfer (OT/sup 1//sub n/) schemes for any n/spl ges/2. We build our OT/sup 1//sub n/ scheme from fundamental cryptographic techniques directly. The receiver's choice is unconditionally secure and the secrecy of the unchosen secrets is based on the hardness of the decisional Diffie-Hellman problem. Some schemes achieve 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 distinct feature of our scheme is that the system-wide parameters are independent of n and universally usable, that is, all possible receivers and senders use the same parameters and need no trapdoors specific to each of them. We extend our OT/sup 1//sub n/ schemes to distributed oblivious transfer schemes. Our distributed OT/sup 1//sub n/ schemes take full advantage of the research results of secret sharing. For applications, we present a method of transforming any (single-database) PIR protocol into a symmetric PIR protocol by slightly increasing the communication cost only.
Two novel constructions of one out of n oblivious transfer protocols from bilinear maps between groups are proposed. The protocols satisfy the category of non-interactive, mean that any sender S can obliviously transfer some secret(s) to a receiver R, but R does not send any messages back to S. The choice of a receiver is unconditionally secure. A sender's secrecy is guaranteed if the receiver is semi-honest in a standard model since the decision bilinear Diffie-Hellman problem is hard and the sender's secrecy is achieved when the receiver is a malicious party in a random oracle model since the bilinear Diffie-Hellman problem assumption holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.
A k-out-of-n oblivious transfer scheme is the interaction between a receiver and a sender where the sender possesses the messages m1, m2, … mn. The receiver needs to access k messages out of the n messages. The scheme is a mechanism in which the receiver obtains no more than the messages m1, m2, … mk which the receiver queried for with the indices 1, 2, … k being oblivious to the sender. We put forward a 1-out-of-2 oblivious transfer scheme. The security of our scheme is based on a decisional subspace assumption, decisional linear assumption and the computational infeasibility of vector decomposition problem a.k.a vector decomposition problem (VDP) assumption. Our scheme uses points on an elliptic curve as the ciphertext. Further, we prove the security of the proposed construction in the universal composability framework by using FCRS - hybrid model.
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