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

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

Partha Sarathi Roy, Sabyasachi Dutta, Kirill Morozov, Avishek Adhikari, Kazuhide Fukushima, Shinsaku Kiyomoto, Kouichi Sakurai

Published Jan 1, 2018• 9 citations
Publisher
DOI
10.1007/978-3-319-99807-7_37

Related papers

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

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

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

Serge Fehr, Chen Yuan

•Jan 1, 2019•1 citation

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure

Sergio Cabello, Carles Padró, Germán Sáez

Designs Codes and Cryptography•Feb 1, 2002•72 citations

Secret sharing schemes with detection of cheaters for a general access structure

Sergio Cabello, Carles Padró, Germán Sáez

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