Paper 2015/952

Commitment and Oblivious Transfer in the Bounded Storage Model with Errors

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

Abstract

In the bounded storage model the memory of the adversary is restricted, instead of its computational power. With this different restriction it is possible to design protocols with information-theoretical (instead of only computational) security. 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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision.ISIT 2014
DOI
10.1109/ISIT.2014.6875108
Contact author(s)
rafael @ cs au dk
History
2017-10-24: last of 3 revisions
2015-10-01: received
See all versions
Short URL
https://ia.cr/2015/952
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/952,
      author = {Rafael Dowsley and Felipe Lacerda and Anderson C.  A.  Nascimento},
      title = {Commitment and Oblivious Transfer in the Bounded Storage Model with Errors},
      howpublished = {Cryptology ePrint Archive, Paper 2015/952},
      year = {2015},
      doi = {10.1109/ISIT.2014.6875108},
      note = {\url{https://eprint.iacr.org/2015/952}},
      url = {https://eprint.iacr.org/2015/952}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.