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

Microelectronics & Computer

A 1-out-n Oblivious Transfer(OT)Protocol Based on Threshold Idea

Yanhong Wang

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

In a 1-out-n oblivious transfer(OT)model,the sender sends n messages to the receiver.The receiver only get 1 message from n messages.However,the sender cannot know which message the receiver got.In this paper,we proposed a multiple-use 1-out-n oblivious transfer scheme based on threshold idea.It is more efficient than Naor-Pinkas scheme and Tzeng scheme.

Related papers

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

Choosing t-out-of-n Secrets by Oblivious Transfer

Jung-San Lee, Chin‐Chen Chang

Oblivious Transfer (OT) has been regarded as one of the most significant cryptography tools in recent decades.Since the mechanism of OT is widely used in many applications such as e-commerce, secret information exchange, and games, various OT schemes have been proposed to improve its functionality and efficiency.In 2001, Naor and Pinkas proposed a secure 1-out-of-n OT protocol, in which the sender has n messages and the chooser can get one of these n messages in each protocol run.What is more, the sender cannot find which message has been chosen by the chooser and the chooser knows only the correct message.In 2004, Wakaha and Ryota proposed a secure t-out-of-n OT protocol, which is an extension of the 1-out-of-n OT protocol proposed by Naor and Pinkas.Wakaha and Ryota's tout-of-n OT protocol allows the chooser to get t messages from the sender simultaneously in each protocol run.Besides, the sender cannot know what the chooser has chosen and the chooser can only know the exact t messages.However, getting deep understanding of Wakaha and Ryota's protocol, it could be concluded that it still lacks efficiency such that it is hard to be applied in real-world applications.In this article, a secure and efficient t-out-of-n OT protocol based on the Generalized Chinese Remainder Theorem is proposed, in which the chooser can securely get t messages from the sender simultaneously in each protocol run.The efficiency of the proposed t-out-of-n OT protocol is higher than that of Wakaha and Ryota's protocol in terms of practical application.

Information & Security An International Journal•Jan 1, 2006•0 citations

A Survey of Oblivious Transfer Protocol

Vijay Kumar Yadav, Nitish Andola, Shekhar Verma +1 more

Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. In the OT (one-out-of-2, one-out-of- n , and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the k -out-of- n OT protocol, the receiver sends a set of k keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.

ACM Computing Surveys•Jan 5, 2022•38 citations

Efficient k-out-of-n Oblivious Transfer Schemes

Cheng Kang Chu, Wen-Guey Tzeng

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, and S 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 OTkn 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, only O(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].

•Apr 7, 2020•24 citations

Verifiable Oblivious Transfer Protocol

N.-Y. LEE

The Oblivious Transfer (OT), introduced by Rabin in 1981, has become an important and fundamental cryptography technique. An OT protocol should have two important characteristics: sender's privacy and chooser's privacy. The sender is a party who will deliver a secret to chooser. The chooser is another party who acts as receiver to learn some information about input from sender. The chooser learns of certain information concerning sender's input while sender is not allowed to know what chooser has learned. Moreover, chooser cannot acquire any messages that he/she did not choose. Naor and Pinkas have recently proposed an efficient oblivious transfer protocol (EOT) that implementes 1-out-of-n protocol, but this EOT has a flaw: it cannot withstand the same message attack. In this paper, we will improve Naor and Pinkas EOT and make it resistant to the same message attack.

IEICE Transactions on Information and Systems•Dec 1, 2005•2 citations

An efficient t‐out‐of‐n oblivious transfer for information security and privacy protection

Der‐Chyuan Lou, Hui‐Feng Huang

SUMMARY In t‐out‐of‐n oblivious transfer (OT), the receiver can only receive t messages out of n messages sent by the sender, and the sender has no idea about which ones have been received. Majority of the existence of previous efficient OT schemes require t calls of 1‐out‐of‐n OT to construct the t‐out‐of‐n OT. Its computational requirements and bandwidth consumption are quite demanding. On the basis of the elliptic curves cryptography, we propose a new t‐out‐of‐n OT protocol for private information retrieval in this article. It is more suitable for the smart cards or mobile units. Copyright © 2013 John Wiley & Sons, Ltd.

International Journal of Communication Systems•May 29, 2013•5 citations
In a 1-out-n oblivious transfer(OT)model,the sender sends n messages to the receiver.The receiver only get 1 message from n messages.However,the sender cannot know which message the receiver got.In this paper,we proposed a multiple-use 1-out-n oblivious transfer scheme based on threshold idea.It is more efficient than Naor-Pinkas scheme and Tzeng scheme.
Oblivious Transfer (OT) has been regarded as one of the most significant cryptography tools in recent decades.Since the mechanism of OT is widely used in many applications such as e-commerce, secret information exchange, and games, various OT schemes have been proposed to improve its functionality and efficiency.In 2001, Naor and Pinkas proposed a secure 1-out-of-n OT protocol, in which the sender has n messages and the chooser can get one of these n messages in each protocol run.What is more, the sender cannot find which message has been chosen by the chooser and the chooser knows only the correct message.In 2004, Wakaha and Ryota proposed a secure t-out-of-n OT protocol, which is an extension of the 1-out-of-n OT protocol proposed by Naor and Pinkas.Wakaha and Ryota's tout-of-n OT protocol allows the chooser to get t messages from the sender simultaneously in each protocol run.Besides, the sender cannot know what the chooser has chosen and the chooser can only know the exact t messages.However, getting deep understanding of Wakaha and Ryota's protocol, it could be concluded that it still lacks efficiency such that it is hard to be applied in real-world applications.In this article, a secure and efficient t-out-of-n OT protocol based on the Generalized Chinese Remainder Theorem is proposed, in which the chooser can securely get t messages from the sender simultaneously in each protocol run.The efficiency of the proposed t-out-of-n OT protocol is higher than that of Wakaha and Ryota's protocol in terms of practical application.
Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. In the OT (one-out-of-2, one-out-of- n , and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the k -out-of- n OT protocol, the receiver sends a set of k keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of- n , k -out-of- n , and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.
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, and S 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 OTkn 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, only O(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].
The Oblivious Transfer (OT), introduced by Rabin in 1981, has become an important and fundamental cryptography technique. An OT protocol should have two important characteristics: sender's privacy and chooser's privacy. The sender is a party who will deliver a secret to chooser. The chooser is another party who acts as receiver to learn some information about input from sender. The chooser learns of certain information concerning sender's input while sender is not allowed to know what chooser has learned. Moreover, chooser cannot acquire any messages that he/she did not choose. Naor and Pinkas have recently proposed an efficient oblivious transfer protocol (EOT) that implementes 1-out-of-n protocol, but this EOT has a flaw: it cannot withstand the same message attack. In this paper, we will improve Naor and Pinkas EOT and make it resistant to the same message attack.
SUMMARY In t‐out‐of‐n oblivious transfer (OT), the receiver can only receive t messages out of n messages sent by the sender, and the sender has no idea about which ones have been received. Majority of the existence of previous efficient OT schemes require t calls of 1‐out‐of‐n OT to construct the t‐out‐of‐n OT. Its computational requirements and bandwidth consumption are quite demanding. On the basis of the elliptic curves cryptography, we propose a new t‐out‐of‐n OT protocol for private information retrieval in this article. It is more suitable for the smart cards or mobile units. Copyright © 2013 John Wiley & Sons, Ltd.