More Efficient Constant-Round Multi-party Computation from BMR and SHE

Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez. More Efficient Constant-Round Multi-party Computation from BMR and SHE. In Martin Hirt, Adam D. Smith, editors, Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I. Volume 9985 of Lecture Notes in Computer Science, pages 554-581, 2016. [doi]

@inproceedings{LindellSS16-0,
  title = {More Efficient Constant-Round Multi-party Computation from BMR and SHE},
  author = {Yehuda Lindell and Nigel P. Smart and Eduardo Soria-Vazquez},
  year = {2016},
  doi = {10.1007/978-3-662-53641-4_21},
  url = {http://dx.doi.org/10.1007/978-3-662-53641-4_21},
  researchr = {https://researchr.org/publication/LindellSS16-0},
  cites = {0},
  citedby = {0},
  pages = {554-581},
  booktitle = {Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I},
  editor = {Martin Hirt and Adam D. Smith},
  volume = {9985},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-662-53640-7},
}