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 Computer and System Sciences

Communication-efficient distributed oblivious transfer

Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang

Published Feb 27, 2012• 7 citations
Publisher
DOI
10.1016/j.jcss.2012.02.002

Related papers

New Communication-Efficient Oblivious Transfer Protocols Based on Pairings

Helger Lipmaa

Lecture notes in computer science•Sep 17, 2008•9 citations

Efficient k-out-of-n oblivious transfer scheme with the ideal communication cost

Jianchang Lai, Yi Mu, Fuchun Guo +2 more

Theoretical Computer Science•Dec 21, 2017•10 citations

Efficient distributed 1 out of n oblivious transfer

Yael Gertner, Tal Malkin

In this paper, we present a new application for , n 1 oblivious transfer, which i s a n i n teractive protocol between two parties Alice and Bob, where Alice has n secrets and Bob has a query i.A t the end of the protocol Bob has the ith secret and no other information about Alice's other secrets, while Alice does not get any information about i.This new application is the Secure Database Access problem.Motivated by this application, we propose an OT scheme which a c hieves low communication complexity and information theoretic security.We use a distributed model for , n 1 oblivious transfer, where Bob interacts with multiple \Alices".In this model, we base our scheme on any PIR scheme, which i s a s c heme where only the privacy of Bob is considered, and use it to construct an OT scheme, private for both parties, without paying too much i n communication complexity.This results in the rst sublinear information theoretic scheme for , n 1 OT.Further motivated by the application of , n 1 OT for polynomial n, w e raise the issue of repetition in , n 1 OT, where both security and eciency are important.We show that previous protocols for , n 1 oblivious transfer fail in this setting.

•Apr 1, 1997•2 citations

Distributed Oblivious Transfer

Moni Naor, Benny Pinkas B

Lecture notes in computer science•Jan 1, 2000•102 citations

Simulatable Oblivious Transfer Protocols Based on Blind Signature

Jing Qin, Jiankun Hu, Huawei Zhao

Oblivious Transfer protocol (OTP) is a paramount important primitive tool in modern cryptography. Essentially, OTP can be used to construct a secure multi-party computation protocol and distributed oblivious transfer protocol (DOTP). DOTP is the general OTP in the distributed setting. Private information retrieval (PIR) and symmetric private information retrieval (SPIR) problems are also analogous to those of the OTP. Due to its importance, the task of constructing efficient and secure OTP has attracted a lot interests. In this paper, a paradigm of OPT protocol and a practical fully-simulatable OTP protocol based on blind GDH (Gap Diffie-Hellman) signature are presented. The proposed schemes can achieve higher efficiency and better security than the popular Malkhi & Sella scheme. The salient property of short signature length of GDH signature scheme enables our proposals applicable to low-bandwidth communication environments.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Jun 1, 2012•0 citations

Strengthening the Security of Distributed Oblivious Transfer

Kai-Yuen Cheong, Takeshi Koshiba, Shohei Nishiyama

Lecture notes in computer science•Jan 1, 2009•7 citations
In this paper, we present a new application for , n 1 oblivious transfer, which i s a n i n teractive protocol between two parties Alice and Bob, where Alice has n secrets and Bob has a query i.A t the end of the protocol Bob has the ith secret and no other information about Alice's other secrets, while Alice does not get any information about i.This new application is the Secure Database Access problem.Motivated by this application, we propose an OT scheme which a c hieves low communication complexity and information theoretic security.We use a distributed model for , n 1 oblivious transfer, where Bob interacts with multiple \Alices".In this model, we base our scheme on any PIR scheme, which i s a s c heme where only the privacy of Bob is considered, and use it to construct an OT scheme, private for both parties, without paying too much i n communication complexity.This results in the rst sublinear information theoretic scheme for , n 1 OT.Further motivated by the application of , n 1 OT for polynomial n, w e raise the issue of repetition in , n 1 OT, where both security and eciency are important.We show that previous protocols for , n 1 oblivious transfer fail in this setting.
Oblivious Transfer protocol (OTP) is a paramount important primitive tool in modern cryptography. Essentially, OTP can be used to construct a secure multi-party computation protocol and distributed oblivious transfer protocol (DOTP). DOTP is the general OTP in the distributed setting. Private information retrieval (PIR) and symmetric private information retrieval (SPIR) problems are also analogous to those of the OTP. Due to its importance, the task of constructing efficient and secure OTP has attracted a lot interests. In this paper, a paradigm of OPT protocol and a practical fully-simulatable OTP protocol based on blind GDH (Gap Diffie-Hellman) signature are presented. The proposed schemes can achieve higher efficiency and better security than the popular Malkhi & Sella scheme. The salient property of short signature length of GDH signature scheme enables our proposals applicable to low-bandwidth communication environments.