IEEE Communications Letters

Robust non-interactive oblivious transfer

Yi Mu, Junqi Zhang, Vijay Varadharajan, Yan‐Xia Lin

Published Apr 1, 2003• 15 citations

Abstract

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.

DOI: 10.1109/lcomm.2003.811213

Related papers

Analysis of oblivious transfer

Yumin Wang

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.

Journal of Xidian UniversityJan 1, 20050 citations

Noninteractive oblivious transfer

Lein Harn, H.-Y. Lin

Two new approaches to implement oblivious transfer and 1–2 oblivious transfer without interaction, based on the wellknown, Diffie–Hellman public-key distribution algorithm are proposed.

Electronics LettersMay 1, 199010 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, 20180 citations

Universally composable issuer‐free adaptive oblivious transfer with access policy

Vandana Guleria, Ratna Dutta

Abstract In today's Internet world, security, privacy and efficiency are three prime concerns in designing any cryptographic protocol. Adaptive oblivious transfer with access policy (AOT‐AP) is widely used in oblivious search of privacy preserving databases in which each message is associated with an access policy and only authorized receivers can access the databases. All the existing AOT‐AP protocols assume a trusted third party called issuer apart from a sender and multiple receivers and are secure under the restriction that the issuer never colludes with a collection of receivers. We propose the first issuer‐freeAOT‐AP in universal composable (UC) framework. Our issuer‐free AOT‐AP is UC secure under standard assumptions assuming malicious adversary in static corruption model. More interestingly, our scheme exhibits significant improvements over the existing schemes. Copyright © 2015 John Wiley & Sons, Ltd.

Security and Communication NetworksJun 1, 20155 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/0401057Jan 11, 20040 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 CryptographyFeb 1, 20070 citations