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 Advanced Information Networking and Applications (AINA)

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

Hui‐Feng Huang, Chin‐Chen Chang

Published Apr 25, 2005• 6 citations
Publisher

Abstract

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.

DOI
10.1109/aina.2005.40

Related papers

A New t-out-n Oblivious Transfer with Low Bandwidth

Hui‐Feng Huang, Chin‐Chen Chang

Abstract. The most efficient previously proposed oblivious transfer schemes require t calls of 1-out-n oblivious transfer (OT) to construct the t-out-n OT. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of growing popular communication service, an efficient t-out-n OT scheme with low bandwidth is urgently desired. Based on elliptic curve cryptosystems, we propose a new t-out-n OT scheme in this paper. Compared with existing OT schemes based on modular exponentiations, our scheme can reduce many computation and communication loads for both the sender and the receiver. Owing to its smaller bandwidth and faster computation speed, our scheme is very suitable for mobile clients and smart-card users. Moreover, our scheme provides a simple algorithm and fewer parameter requirements. Keywords: Two-lock cryptosystem, private information retrieval, elliptic curve 1.

•Jan 1, 2007•3 citations

A New Design of Oblivious Transfer for Private Information Retrieval

Hui‐Feng Huang

In a t-out-n oblivious transfer, 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 existing of previous efficient oblivious transfer schemes require t calls of 1-out-n oblivious transfer to construct the t-out-n oblivious transfer. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of electronic commercial service, an efficient t-out-n oblivious transfer scheme is urgently desired. Based on the RSA, we propose a new t-out-n oblivious transfer protocol for private information retrieval in this paper. In our method, only several modular multiplications and t hash functions are performed by a user (receiver) to obtain t messages. It is very suitable for the limited computation capacities of receivers such as smart cards or mobile units. Key words: Private information retrieval, security, RSA

•Jan 1, 2008•0 citations

Robust non-interactivet-out-of-noblivious transfer based on the RSA cryptosystem

Ya‐Fen Chang, Chin‐Chen Chang, Yi‐Fang Cheng

In 2003, Mu et al. proposed a non-interactive oblivious transfer scheme based on the standard ElGamal encryption scheme. Unfortunately, the receiver cannot verify the retrieved messages in the original scheme. Though they also proposed an extension to amend this drawback, this extension makes itself impracticable. On the other hand, the RSA cryptosystem is widely spread, and the certification infrastructure for it has been well built. As a result, we present two efficient non-interactive t-out-of-n oblivious transfer schemes in this paper, where one is for the honest receiver and the other is to inhibit the dishonest user from getting the valid signature of the sender. Moreover, the receiver can easily verify the requested messages in our schemes.

Journal of Discrete Mathematical Sciences and Cryptography•Feb 1, 2007•0 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

A general model for oblivious transfer

Hossein Ghodosi

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.

•Jan 1, 2007•3 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
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.
Abstract. The most efficient previously proposed oblivious transfer schemes require t calls of 1-out-n oblivious transfer (OT) to construct the t-out-n OT. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of growing popular communication service, an efficient t-out-n OT scheme with low bandwidth is urgently desired. Based on elliptic curve cryptosystems, we propose a new t-out-n OT scheme in this paper. Compared with existing OT schemes based on modular exponentiations, our scheme can reduce many computation and communication loads for both the sender and the receiver. Owing to its smaller bandwidth and faster computation speed, our scheme is very suitable for mobile clients and smart-card users. Moreover, our scheme provides a simple algorithm and fewer parameter requirements. Keywords: Two-lock cryptosystem, private information retrieval, elliptic curve 1.
In a t-out-n oblivious transfer, 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 existing of previous efficient oblivious transfer schemes require t calls of 1-out-n oblivious transfer to construct the t-out-n oblivious transfer. Its computational requirements and bandwidth consumption are quite demanding. Therefore, to guarantee the quality of electronic commercial service, an efficient t-out-n oblivious transfer scheme is urgently desired. Based on the RSA, we propose a new t-out-n oblivious transfer protocol for private information retrieval in this paper. In our method, only several modular multiplications and t hash functions are performed by a user (receiver) to obtain t messages. It is very suitable for the limited computation capacities of receivers such as smart cards or mobile units. Key words: Private information retrieval, security, RSA
In 2003, Mu et al. proposed a non-interactive oblivious transfer scheme based on the standard ElGamal encryption scheme. Unfortunately, the receiver cannot verify the retrieved messages in the original scheme. Though they also proposed an extension to amend this drawback, this extension makes itself impracticable. On the other hand, the RSA cryptosystem is widely spread, and the certification infrastructure for it has been well built. As a result, we present two efficient non-interactive t-out-of-n oblivious transfer schemes in this paper, where one is for the honest receiver and the other is to inhibit the dishonest user from getting the valid signature of the sender. Moreover, the receiver can easily verify the requested messages in our schemes.
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.
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.
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.