@InProceedings{barenboim_et_al:LIPIcs.OPODIS.2020.32,
  author =	{Barenboim, Leonid and Levin, Harel},
  title =	{{Secured Distributed Algorithms Without Hardness Assumptions}},
  booktitle =	{24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
  pages =	{32:1--32:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-176-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{184},
  editor =	{Bramas, Quentin and Oshman, Rotem and Romano, Paolo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.32},
  URN =		{urn:nbn:de:0030-drops-135171},
  doi =		{10.4230/LIPIcs.OPODIS.2020.32},
  annote =	{Keywords: distributed algorithms, privacy preserving, graph coloring, generic algorithms, multi-party computation}
}