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

Robust Secret Sharing Schemes Against Local Adversaries

Allison Bishop, Valerio Pastro

Published Jan 1, 2016• 14 citations
Publisher
DOI
10.1007/978-3-662-49387-8_13

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•11 citations

Nearly Optimal Robust Secret Sharing Against Rushing Adversaries

Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

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

Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary

Serge Fehr, Chen Yuan

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

Adversary Models for Secret Sharing Schemes

Stephan Krenn, Thomas Lorünser

SpringerBriefs in information security and cryptography•Jan 1, 2023•0 citations

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

Serge Fehr, Chen Yuan

•Jan 1, 2019•1 citation

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

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

Lecture notes in computer science•Jan 1, 2018•9 citations