Perfectly-Secure MPC with Linear Communication Complexity

Zuzana Beerliová-Trubíniová, Martin Hirt. Perfectly-Secure MPC with Linear Communication Complexity. In Ran Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Volume 4948 of Lecture Notes in Computer Science, pages 213-230, Springer, 2008. [doi]

@inproceedings{Beerliova-TrubiniovaH08,
  title = {Perfectly-Secure MPC with Linear Communication Complexity},
  author = {Zuzana Beerliová-Trubíniová and Martin Hirt},
  year = {2008},
  doi = {10.1007/978-3-540-78524-8_13},
  url = {http://dx.doi.org/10.1007/978-3-540-78524-8_13},
  researchr = {https://researchr.org/publication/Beerliova-TrubiniovaH08},
  cites = {0},
  citedby = {0},
  pages = {213-230},
  booktitle = {Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008},
  editor = {Ran Canetti},
  volume = {4948},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-78523-1},
}