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

Efficient Oblivious Transfer in the Bounded-Storage Model

Dowon Hong, Ku-Young Chang, Heuisu Ryu

Published Jan 1, 2002• 11 citations
Publisher
DOI
10.1007/3-540-36178-2_9

Related papers

Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding

Lecture notes in computer science•Jan 1, 2001•50 citations

Constant-Round Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding, Danny Harnik, Alon Rosen +1 more

Journal of Cryptology•Mar 20, 2007•27 citations

Constant-Round Oblivious Transfer in the Bounded Storage Model

Yan Zong Ding, Danny Harnik, Alon Rosen +1 more

Lecture notes in computer science•Jan 1, 2004•82 citations

An experimental implementation of oblivious transfer in the noisy storage model

Chris Erven, N. Ng, Nikolay Gigov +3 more

arXiv:1308.5098•Nature Communications•Mar 12, 2014•71 citations

Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

Rafael Dowsley, Felipe Gomes Lacerda, Anderson C. A. Nascimento

The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible. We present the first protocols for commitment and oblivious transfer in the bounded storage model with errors, i.e., the model where the public random sources available to the two parties are not exactly the same, but instead are only required to have a small Hamming distance between themselves. Commitment and oblivious transfer protocols were known previously only for the error-free variant of the bounded storage model, which is harder to realize.

arXiv:1510.06623•IEEE Transactions on Information Theory•Jan 22, 2018•2 citations

Oblivious transfer in the bounded storage model with errors

Rafael Dowsley, Felipe Gomes Lacerda, Anderson C. A. Nascimento

In the bounded storage model the memory of the adversarial parties is restricted, instead of their computational power. This different restriction allows the construction of protocols with information-theoretical (instead of only computational) security. We present the first protocol for oblivious transfer in the bounded storage model with errors, i.e., where the public random sources available to the two parties are not exactly the same, but instead are only required to have a small Hamming distance between themselves, and the memory of the (adversarial) receiver is limited. Oblivious transfer protocols were known previously only for the error-free variant of the bounded storage model, which is harder to realize.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•7 citations
The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible. We present the first protocols for commitment and oblivious transfer in the bounded storage model with errors, i.e., the model where the public random sources available to the two parties are not exactly the same, but instead are only required to have a small Hamming distance between themselves. Commitment and oblivious transfer protocols were known previously only for the error-free variant of the bounded storage model, which is harder to realize.
In the bounded storage model the memory of the adversarial parties is restricted, instead of their computational power. This different restriction allows the construction of protocols with information-theoretical (instead of only computational) security. We present the first protocol for oblivious transfer in the bounded storage model with errors, i.e., where the public random sources available to the two parties are not exactly the same, but instead are only required to have a small Hamming distance between themselves, and the memory of the (adversarial) receiver is limited. Oblivious transfer protocols were known previously only for the error-free variant of the bounded storage model, which is harder to realize.