Dana Dachman-Soled. Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. In Rafael Pass, Krzysztof Pietrzak, editors, Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II. Volume 12551 of Lecture Notes in Computer Science, pages 595-620, Springer, 2020. [doi]
@inproceedings{Dachman-Soled20-0,
title = {Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures},
author = {Dana Dachman-Soled},
year = {2020},
doi = {10.1007/978-3-030-64378-2_21},
url = {https://doi.org/10.1007/978-3-030-64378-2_21},
researchr = {https://researchr.org/publication/Dachman-Soled20-0},
cites = {0},
citedby = {0},
pages = {595-620},
booktitle = {Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II},
editor = {Rafael Pass and Krzysztof Pietrzak},
volume = {12551},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-64378-2},
}