Lecture notes in computer science

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

Serge Fehr, Chen Yuan

Published Jan 1, 2020• 11 citations

Related papers

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

Serge Fehr, Chen Yuan

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

Serge Fehr, Chen Yuan

Unconditionally-Secure Robust Secret Sharing with Minimum Share Size

Mahabir Prasad Jhanwar, Reihaneh Safavi–Naini

Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness

Partha Sarathi Roy, Sabyasachi Dutta, Kirill Morozov +4 more

Robust Secret Sharing Schemes Against Local Adversaries

Allison Bishop, Valerio Pastro