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

Optik

Reductions between private information retrieval and oblivious transfer at the quantum level

Yu‐Guang Yang, Si-Jia Sun, Qing-Xiang Pan, Peng Xu

Published Jul 30, 2015• 9 citations
Publisher
DOI
10.1016/j.ijleo.2015.07.149

Related papers

Quantum Oblivious Transfer Based on a Quantum Symmetrically Private Information Retrieval Protocol

Yu‐Guang Yang, Si-Jia Sun, Yan Wang

International Journal of Theoretical Physics•Aug 8, 2014•19 citations

A Study of Computational Private Information Retrieval Schemes and Oblivious Transfer

Valentina Settimi

•Jan 1, 2007•0 citations

Single Database Private Information Retrieval Implies Oblivious Transfer

Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2000•158 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

The Capacity of Oblivious Transfer with Replicated Databases and Binary Erasure Multiple Access Channel

Tianyou Pei, Wei Kang, Nan Liu

Both the oblivious transfer (OT) problem and the symmetric private information retrieval (SPIR) problem studies the scenario where a client retrieves information privately and securely from databases, i.e., the privacy of the client is protected from the databases, and the undesired information is protected from the client. The OT problem studies the case of one database plus additional noisy resources between the database and the client. The SPIR problem studies the case of multiple replicated and non-colluding databases. In this paper, we combine the two models and propose a new problem of oblivious transfer (OT) with two replicated databases and a binary erasure multiple access channel connecting the databases and the client. We first provide an upper bound on the OT capacity. We then propose a protocol which achieves the upper bound. Therefore, we obtain the capacity of OT for this model. In our achievability and converse proofs, we utilized the techniques from both traditional OT and PIR. Compared to schemes that utilizes only techniques from OT, we see a 100% increase in the achieved OT rate.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•2 citations

Practical Quantum Oblivious Transfer

Charles H. Bennett, Gilles Brassard, Claude Crépeau +1 more

Springer eBooks•Aug 11, 2007•230 citations
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
Both the oblivious transfer (OT) problem and the symmetric private information retrieval (SPIR) problem studies the scenario where a client retrieves information privately and securely from databases, i.e., the privacy of the client is protected from the databases, and the undesired information is protected from the client. The OT problem studies the case of one database plus additional noisy resources between the database and the client. The SPIR problem studies the case of multiple replicated and non-colluding databases. In this paper, we combine the two models and propose a new problem of oblivious transfer (OT) with two replicated databases and a binary erasure multiple access channel connecting the databases and the client. We first provide an upper bound on the OT capacity. We then propose a protocol which achieves the upper bound. Therefore, we obtain the capacity of OT for this model. In our achievability and converse proofs, we utilized the techniques from both traditional OT and PIR. Compared to schemes that utilizes only techniques from OT, we see a 100% increase in the achieved OT rate.