External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Secured Distributed Algorithms Without Hardness Assumptions

Leonid Barenboim, Harel Levin. Secured Distributed Algorithms Without Hardness Assumptions. In Quentin Bramas, Rotem Oshman, Paolo Romano 0002, editors, 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference). Volume 184 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Authors

Leonid Barenboim

This author has not been identified. Look up 'Leonid Barenboim' in Google

Harel Levin

This author has not been identified. Look up 'Harel Levin' in Google
runs on