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 Journal of Communication Systems

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

Der‐Chyuan Lou, Hui‐Feng Huang

Published May 29, 2013• 5 citations
Publisher

Abstract

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.

DOI
10.1002/dac.2573

Related papers

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

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 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

An Efficient Oblivious Transfer Protocol with Access Control

Yaqing Liao, Jing Li Zhou, Yang Yang +1 more

Due to the rapid development of internet in our daily life, protecting privacy has become a focus of attention. To create privacy-preserving database and prevent illegal user access the database, oblivious transfer with access control (OTAC) was proposed, which is a cryptographic primitive that extends from oblivious transfer (OT). It allows a user to anonymously query a database where each message is protected by an access control policy and only if the user' s attribute satisfy that access control policy can obtain it. In this paper, we propose a new protocol for OTAC by using elliptic curve cryptography, which is more efficient compared to the existing similar protocols. In our scheme, we also preserves user's anonymity and ensures that the user's attribute is not disclosed to the sender. Additionally, our construction guarantees the user to verify the correctness of messages recovered at the end of each transfer phase.

Asia Joint Conference on Information Security (AsiaJCIS)•Aug 1, 2018•0 citations

Efficient oblivious transfer protocols

Moni Naor, Benny Pinkas B

1 IntroductionOblivious Transfer (OT) protocols allow one party, the sender, to transmit part of its inputs to another party, the chooser, in a manner that protects both of them: the sender is assured that the chooser does not receive more information than it is entitled, while the chooser is assured that the sender does not learn which part of the inputs it received. OT is used as a key component in many applications of cryptography. Its computational requirements are quite demanding and they are likely to be the bottleneck in many applications that invoke it.1.1 Contributions.This paper presents several significant improvements to oblivious transfer (OT) protocols of strings, and in particular: (i) Improving the efficiency of applications which many invocations of oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oracle model.

Symposium on Discrete Algorithms•Jan 9, 2001•646 citations

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

Yanhong Wang

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.

Microelectronics & Computer•Jan 1, 2006•0 citations
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.
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
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.
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.
Due to the rapid development of internet in our daily life, protecting privacy has become a focus of attention. To create privacy-preserving database and prevent illegal user access the database, oblivious transfer with access control (OTAC) was proposed, which is a cryptographic primitive that extends from oblivious transfer (OT). It allows a user to anonymously query a database where each message is protected by an access control policy and only if the user' s attribute satisfy that access control policy can obtain it. In this paper, we propose a new protocol for OTAC by using elliptic curve cryptography, which is more efficient compared to the existing similar protocols. In our scheme, we also preserves user's anonymity and ensures that the user's attribute is not disclosed to the sender. Additionally, our construction guarantees the user to verify the correctness of messages recovered at the end of each transfer phase.
1 IntroductionOblivious Transfer (OT) protocols allow one party, the sender, to transmit part of its inputs to another party, the chooser, in a manner that protects both of them: the sender is assured that the chooser does not receive more information than it is entitled, while the chooser is assured that the sender does not learn which part of the inputs it received. OT is used as a key component in many applications of cryptography. Its computational requirements are quite demanding and they are likely to be the bottleneck in many applications that invoke it.1.1 Contributions.This paper presents several significant improvements to oblivious transfer (OT) protocols of strings, and in particular: (i) Improving the efficiency of applications which many invocations of oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oracle model.