(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

@article{Choi2013EfficientUC,
  title={(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens},
  author={Seung Geol Choi and Jonathan Katz and Dominique Schr{\"o}der and Arkady Yerukhimovich and Hong-Sheng Zhou},
  journal={Journal of Cryptology},
  year={2013},
  pages={1-39}
}
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware tokens for universally composable secure computation. As our main result, we show an oblivious-transfer (OT) protocol in which two parties each create and transfer a single, stateless token and can then run an unbounded number of OTs. We also show a more efficient protocol, based only on standard symmetric-key primitives (block ciphers and collision-resistant hash functions), that can be used if a… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
13 Citations
51 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 51 references

Similar Papers

Loading similar papers…