Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries

Serge Fehr, Chen Yuan 0003. Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. In Rafael Pass, Krzysztof Pietrzak, editors, Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III. Volume 12552 of Lecture Notes in Computer Science, pages 470-498, Springer, 2020. [doi]

Abstract

Abstract is missing.