International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?

Authors:
Danny Harnik
Yuval Ishai
Eyal Kushilevitz
Download:
DOI: 10.1007/978-3-540-74143-5_16 (login may be required)
URL: https://iacr.org/archive/crypto2007/46220279/46220279.pdf
Search ePrint
Search Google
Conference: CRYPTO 2007
BibTeX
@inproceedings{crypto-2007-1920,
  title={How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?},
  booktitle={Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={4622},
  pages={284-302},
  url={https://iacr.org/archive/crypto2007/46220279/46220279.pdf},
  doi={10.1007/978-3-540-74143-5_16},
  author={Danny Harnik and Yuval Ishai and Eyal Kushilevitz},
  year=2007
}