Lecture notes in computer science

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Published Jan 1, 2020• 14 citations

Related papers

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

Serge Fehr, Chen Yuan

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

Serge Fehr, Chen Yuan

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

Serge Fehr, Chen Yuan

Robust Secret Sharing Schemes Against Local Adversaries

Allison Bishop, Valerio Pastro

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

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

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

Allison Bishop, Valerio Pastro, Rajmohan Rajaraman +1 more