Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs

Published Jan 1, 2016• 31 citations
Publisher
DOI
10.1007/978-3-662-49890-3_3

Related papers

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

Serge Fehr, Chen Yuan

Lecture notes in computer science•Jan 1, 2020•12 citations

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

Serge Fehr, Chen Yuan

Lecture notes in computer science•Jan 1, 2019•15 citations

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Lecture notes in computer science•Jan 1, 2020•15 citations

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

Serge Fehr, Chen Yuan

•Jan 1, 2019•1 citation

Unconditionally-Secure Robust Secret Sharing with Minimum Share Size

Mahabir Prasad Jhanwar, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 2013•16 citations

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2012•49 citations