Welcome to the resource topic for 2007/215
Title:
Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free
Authors: 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 2^{-m}, the protocol had to suffer an additional overhead of a factor 1+m. We introduce a new approach to adding robustness. For practical security parameters this approach allows to add robustness while suffering only a small constant overhead over the passive secure protocol. As an example we can generate one million oblivious transfers with security 2^{-42} with an amortized cost of just 9 hash values per oblivious transfer.
ePrint: https://eprint.iacr.org/2007/215
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .