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 general model for oblivious transfer

Hossein Ghodosi

Published Jan 1, 2007• 3 citations
OpenAlex

Abstract

Naor and Pinkas (1999a) pointed out that 'this is of interest, given the possibility of implementing Oblivious Transfer using physical means, e.g., via a noisy channel or quantum cryptography. However, some of these reductions are not particularly efficient. .. '. Using tamper-proof smart cards, we propose some radically different approaches to the Oblivious Transfer problem. Despite the simplicity of our model, we achieve unconditional security and privacy for both the sender and receiver. In contrast to all known oblivious transfer protocols, which require extensive computations, the proposed schemes are very computationally efficient.

Related papers

A New Design for Efficient t-out-n Oblivious Transfer Scheme

Hui‐Feng Huang, Chin‐Chen Chang

A general approach for constructing t-out-n oblivious transfer is more practical than 1-out-n oblivious transfer for applications. To guarantee the quality of growing popular communication service, an efficient t-out-n oblivious transfer scheme is urgently desired. Based on the RSA and two-lock cryptosystem, we propose an efficient t-out-n oblivious transfer scheme in this paper. Compared with existing oblivious transfer schemes, our scheme can reduce many computations and communications for both the sender and the receiver. Moreover, our scheme is very suitable for smart-card users.

International Conference on Advanced Information Networking and Applications (AINA)•Apr 25, 2005•6 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

Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel

Claude Crépeau, Kirill Morozov, Stefan Wolf

Lecture notes in computer science•Jan 1, 2005•97 citations

Unconditionally Secure Quantum m-out-of-n Oblivious Transfer

Zhide Chen, Tian-Ming Bu, Hong Ping Zhu

This paper has been withdrawn.

arXiv:quant-ph/0401057•Jan 11, 2004•0 citations

On Distributed Oblivious Transfer

Ventzislav Nikov, Svetla Nikova⋆, Bart Preneel A

This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to n servers, and a Receiver must contact a threshold of the servers in order to compute the secret. We present a non-existence result and a lower bound for the existence of one-round, threshold, distributed oblivious transfer protocols, generalizing the results of Blundo et al. A threshold based construction implementing 1-out-of-ζ distributed oblivious transfer achieving this lower bound is described. A condition for existence of distributed oblivious transfer schemes based on general access structures is proven. We also present a general access structure protocol implementing 1-out-of-ζ distributed oblivious transfer.

Serdica Journal of Computing•Sep 26, 2007•1 citation

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
Naor and Pinkas (1999a) pointed out that 'this is of interest, given the possibility of implementing Oblivious Transfer using physical means, e.g., via a noisy channel or quantum cryptography. However, some of these reductions are not particularly efficient. .. '. Using tamper-proof smart cards, we propose some radically different approaches to the Oblivious Transfer problem. Despite the simplicity of our model, we achieve unconditional security and privacy for both the sender and receiver. In contrast to all known oblivious transfer protocols, which require extensive computations, the proposed schemes are very computationally efficient.
A general approach for constructing t-out-n oblivious transfer is more practical than 1-out-n oblivious transfer for applications. To guarantee the quality of growing popular communication service, an efficient t-out-n oblivious transfer scheme is urgently desired. Based on the RSA and two-lock cryptosystem, we propose an efficient t-out-n oblivious transfer scheme in this paper. Compared with existing oblivious transfer schemes, our scheme can reduce many computations and communications for both the sender and the receiver. Moreover, our scheme is very suitable for smart-card users.
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.
This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to n servers, and a Receiver must contact a threshold of the servers in order to compute the secret. We present a non-existence result and a lower bound for the existence of one-round, threshold, distributed oblivious transfer protocols, generalizing the results of Blundo et al. A threshold based construction implementing 1-out-of-ζ distributed oblivious transfer achieving this lower bound is described. A condition for existence of distributed oblivious transfer schemes based on general access structures is proven. We also present a general access structure protocol implementing 1-out-of-ζ distributed oblivious transfer.
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.