Paper 2007/215
Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free
Jesper Buus Nielsen
Abstract
At Crypto 2003 Ishai et al. gave a protocol which given a
small number of (possibly extremely inefficient) oblivious transfers
implements an essentially unbounded number of oblivious transfers
for an additional overhead, per oblivious transfer, of computing and
sending only two hash values. This highly efficient protocol is
however only passive secure. To get active security, except with
probability
Metadata
- Available format(s)
- PDF PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- oblivious transfer
- Contact author(s)
- buus @ daimi au dk
- History
- 2007-07-11: revised
- 2007-06-08: received
- See all versions
- Short URL
- https://ia.cr/2007/215
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/215, author = {Jesper Buus Nielsen}, title = {Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/215}, year = {2007}, url = {https://eprint.iacr.org/2007/215} }