Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri. Efficient Scalable Constant-Round MPC via Garbled Circuits. In Tsuyoshi Takagi, Thomas Peyrin, editors, Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II. Volume 10625 of Lecture Notes in Computer Science, pages 471-498, Springer, 2017. [doi]

@inproceedings{Ben-EfraimLO17,
  title = {Efficient Scalable Constant-Round MPC via Garbled Circuits},
  author = {Aner Ben-Efraim and Yehuda Lindell and Eran Omri},
  year = {2017},
  doi = {10.1007/978-3-319-70697-9_17},
  url = {https://doi.org/10.1007/978-3-319-70697-9_17},
  researchr = {https://researchr.org/publication/Ben-EfraimLO17},
  cites = {0},
  citedby = {0},
  pages = {471-498},
  booktitle = {Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II},
  editor = {Tsuyoshi Takagi and Thomas Peyrin},
  volume = {10625},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-70697-9},
}