More Efficient Oblivious Transfer Extensions

@article{Asharov2016MoreEO,
  title={More Efficient Oblivious Transfer Extensions},
  author={Gilad Asharov and Yehuda Lindell and Thomas Schneider and Michael Zohner},
  journal={Journal of Cryptology},
  year={2016},
  volume={30},
  pages={805-858}
}
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes more practical, the need for practical large-scale OT protocols is becoming more evident. OT extensions are protocols that enable a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-honest setting, Ishai et al. (Advances in cryptology… CONTINUE READING

References

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

Improved OT Extension for Transferring Short Secrets

IACR Cryptology ePrint Archive • 2013
View 9 Excerpts
Highly Influenced

Zohner.GMWvs.Yao?Efficient secure two-party computationwith lowdepth circuits, in Financial Cryptography and Data Security (FC’13)

M. T. Schneider
vol. 7859 of LNCS, (Springer, • 2013
View 6 Excerpts
Highly Influenced

How to generate and exchange secrets

27th Annual Symposium on Foundations of Computer Science (sfcs 1986) • 1986
View 4 Excerpts
Highly Influenced

A Randomized Protocol for Signing Contracts

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…