On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
From MaRDI portal
Publication:2872050
Recommendations
- Improvements to almost optimum secret sharing with cheating detection
- Almost optimum secret sharing with cheating detection
- Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
- Leakage Resilient Cheating Detectable Secret Sharing Schemes
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Almost optimum secret sharing schemes with cheating detection for random bit strings
- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- Robust secret sharing with almost optimal share size and security against rushing adversaries
Cited in
(12)- Improvements to almost optimum secret sharing with cheating detection
- Lower bounds for robust secret sharing schemes
- Robust secret sharing schemes against local adversaries
- Nearly optimal robust secret sharing
- Lower bounds on the share size of leakage resilient cheating detectable secret sharing
- Efficient robust secret sharing from expander graphs
- scientific article; zbMATH DE number 1588486 (Why is no real title available?)
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Robust password-protected secret sharing
- Unconditionally-secure robust secret sharing with compact shares
- Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure
- Almost optimum secret sharing with cheating detection
This page was built for publication: On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872050)