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

Journal of Xidian University

Analysis of oblivious transfer

Yumin Wang

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

We analyze the security of the three m out of n oblivious transfer schemes proposed by Y.Mu et al, and then point out the insecurities of their schemes. We also provide our improvements on them respectively, which prevent users from getting more messages or disobeying the protocol. One of the improved schemes is more efficient than all the schemes proposed by Y.Mu et al.

Related papers

Cryptanalysis and Improvement of a k-out-of-n Oblivious Transfer Protocol

Qinglong Wang, Jíntai Ding

In this article, the authors cryptanalyze a k-out-of-n oblivious transfer protocol proposed in [12 Jain , A. , and C. Hari . 2010 . A New Efficient Protocol for k-out-of-n Oblivious Transfer , Cryptologia , 34 ( 4 ): 282 – 290 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]]. Their protocol is one of the most efficient k-out-of-n oblivious transfer protocols and is directly built from a 1-out-of-n oblivious transfer protocol. However, their analysis shows that the proposed k-out-of-n oblivious transfer protocol is insecure, though the primitive 1-out-of-n oblivious transfer protocol is secure. The weakness is that with high probability the receiver in their protocol can get all n secret messages encrypted by the sender. Finally, they fix the serious flaw and introduce an improved k-out-of-n oblivious transfer protocol without increasing any cost.

Cryptologia•Aug 30, 2014•1 citation

Efficient t-out-of-n Oblivious Transfer Schemes

Chin‐Chen Chang, Yeu‐Pong Lai

In this paper, we shall bring up two efficient t-out-of-n oblivious transfer schemes. The first comes out handy for communication and computation. However, it has a shortcoming in revealing combined information of secrets. To solve this problem, we have developed it into the second scheme.

International Conference on Security Technology (SecTech)•Dec 1, 2008•3 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

Robust non-interactive oblivious transfer

Yi Mu, Junqi Zhang, Vijay Varadharajan +1 more

We present a novel scheme of noninteractive m out of n oblivious transfer, which demonstrates significant improvement over the existing schemes in terms of completeness, robustness and flexibility. This scheme is useful for protection of user privacy in the Internet.

IEEE Communications Letters•Apr 1, 2003•15 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

A new Protocol for 1-2 Oblivious Transfer

Bjoern Grohmann

A new protocol for 1-2 (String) Oblivious Transfer is proposed. The protocol uses 5 rounds of message exchange.

arXiv:0904.2023•Apr 13, 2009•1 citation
We analyze the security of the three m out of n oblivious transfer schemes proposed by Y.Mu et al, and then point out the insecurities of their schemes. We also provide our improvements on them respectively, which prevent users from getting more messages or disobeying the protocol. One of the improved schemes is more efficient than all the schemes proposed by Y.Mu et al.
In this article, the authors cryptanalyze a k-out-of-n oblivious transfer protocol proposed in [12 Jain , A. , and C. Hari . 2010 . A New Efficient Protocol for k-out-of-n Oblivious Transfer , Cryptologia , 34 ( 4 ): 282 – 290 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]]. Their protocol is one of the most efficient k-out-of-n oblivious transfer protocols and is directly built from a 1-out-of-n oblivious transfer protocol. However, their analysis shows that the proposed k-out-of-n oblivious transfer protocol is insecure, though the primitive 1-out-of-n oblivious transfer protocol is secure. The weakness is that with high probability the receiver in their protocol can get all n secret messages encrypted by the sender. Finally, they fix the serious flaw and introduce an improved k-out-of-n oblivious transfer protocol without increasing any cost.
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.
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.