Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
From MaRDI portal
Publication:6163696
Recommendations
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- On cheater identifiable secret sharing schemes secure against rushing adversary
- Ramp secret sharing with cheater identification in presence of rushing cheaters
- scientific article; zbMATH DE number 1390062
- Ideal hierarchical secret sharing schemes
Cites work
- Brief announcement: Optimal amortized secret sharing with cheater identification
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- Conjunctive hierarchical secret sharing scheme based on MDS codes
- Dynamic and verifiable hierarchical secret sharing
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- Hierarchical threshold secret sharing
- How to share a secret
- scientific article; zbMATH DE number 3912274 (Why is no real title available?)
- scientific article; zbMATH DE number 1189396 (Why is no real title available?)
- scientific article; zbMATH DE number 1303147 (Why is no real title available?)
- scientific article; zbMATH DE number 1030973 (Why is no real title available?)
- scientific article; zbMATH DE number 1842509 (Why is no real title available?)
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- Unconditionally-secure robust secret sharing with compact shares
- Universal classes of hash functions
Cited in
(3)
This page was built for publication: Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163696)