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

Lecture notes in computer science

T-out-of-n Distributed Oblivious Transfer Protocols in Non-adaptive and Adaptive Settings

Christian L. F. Corniaux, Hossein Ghodosi

Published Jan 1, 2012• 0 citations
Publisher
DOI
10.1007/978-3-642-29101-2_9

Related papers

Adaptive and Composable Oblivious Transfer Protocols (Short Paper)

Huafei Zhu, Feng Bao

Lecture notes in computer science•Jan 1, 2009•1 citation

Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries

Cheng‐Kang Chu, Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2005•119 citations

Distributed Oblivious Transfer with Adaptive Queries

Shuxian Jiang, Hongda Li, Bao Li

We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.

•Apr 1, 2010•1 citation

Efficient and Universally Composable Security Oblivious Transfer

Fenghua Li

Non-committing encryption achieved only semantic security,in contrast,applications often require security against chosen ciphertext attacks.A main ingredient in the previous adaptive universally composable(UC)oblivious transfer protocols are non-committing encryptions.the previous proposals are not UC secure against adaptive adversaries in the so-called non-erase model.A new UC secure oblivious transfer protocols were proposed and schemes utilize two primitives of the verifiably smooth projective hashing and deniable encryption as constructed by.the double trapdoor decryption mechanism based on trapdoor commitment.Our construction is based on the decisional composite residuosity in common reference string (CRS) model.We constructed a two-message(1-round) string oblivious transfer protocol,which improves computational efficient that supports message spaces of size exponential and save O(n)-1 rounds communications efficient than bit-OT protocols.

Dianzi xuebao•Jan 1, 2008•1 citation

On Distributed Oblivious Transfer

Ventzislav Nikov, Svetla Nikova⋆, Bart Preneel A

This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to n servers, and a Receiver must contact a threshold of the servers in order to compute the secret. We present a non-existence result and a lower bound for the existence of one-round, threshold, distributed oblivious transfer protocols, generalizing the results of Blundo et al. A threshold based construction implementing 1-out-of-ζ distributed oblivious transfer achieving this lower bound is described. A condition for existence of distributed oblivious transfer schemes based on general access structures is proven. We also present a general access structure protocol implementing 1-out-of-ζ distributed oblivious transfer.

Serdica Journal of Computing•Sep 26, 2007•1 citation

Communication-efficient distributed oblivious transfer

Amos Beimel, Yeow Meng Chee, Huaxiong Wang +1 more

Journal of Computer and System Sciences•Feb 27, 2012•7 citations
We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.
Non-committing encryption achieved only semantic security,in contrast,applications often require security against chosen ciphertext attacks.A main ingredient in the previous adaptive universally composable(UC)oblivious transfer protocols are non-committing encryptions.the previous proposals are not UC secure against adaptive adversaries in the so-called non-erase model.A new UC secure oblivious transfer protocols were proposed and schemes utilize two primitives of the verifiably smooth projective hashing and deniable encryption as constructed by.the double trapdoor decryption mechanism based on trapdoor commitment.Our construction is based on the decisional composite residuosity in common reference string (CRS) model.We constructed a two-message(1-round) string oblivious transfer protocol,which improves computational efficient that supports message spaces of size exponential and save O(n)-1 rounds communications efficient than bit-OT protocols.
This paper is about unconditionally secure distributed protocols for oblivious transfer, as proposed by Naor and Pinkas and generalized by Blundo et al. In this setting a Sender has ζ secrets and a Receiver is interested in one of them. The Sender distributes the information about the secrets to n servers, and a Receiver must contact a threshold of the servers in order to compute the secret. We present a non-existence result and a lower bound for the existence of one-round, threshold, distributed oblivious transfer protocols, generalizing the results of Blundo et al. A threshold based construction implementing 1-out-of-ζ distributed oblivious transfer achieving this lower bound is described. A condition for existence of distributed oblivious transfer schemes based on general access structures is proven. We also present a general access structure protocol implementing 1-out-of-ζ distributed oblivious transfer.