Optimum Secret Sharing Scheme Secure against Cheating
From MaRDI portal
Recommendations
- Optimum Secret Sharing Scheme Secure against Cheating
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Almost optimum secret sharing with cheating detection
- Improvements to almost optimum secret sharing with cheating detection
- Optimal Uniform Secret Sharing
- scientific article; zbMATH DE number 1612522
- Nearly optimal robust secret sharing
- Optimal non-perfect uniform secret sharing schemes
- Almost optimum secret sharing schemes with cheating detection for random bit strings
Cited in
(16)- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Improvements to almost optimum secret sharing with cheating detection
- Algebraic manipulation detection codes
- scientific article; zbMATH DE number 1612522 (Why is no real title available?)
- Lower bounds for robust secret sharing schemes
- Robust vector space secret sharing schemes
- Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
- scientific article; zbMATH DE number 1030973 (Why is no real title available?)
- scientific article; zbMATH DE number 1980983 (Why is no real title available?)
- MDS secret-sharing scheme secure against cheaters
- Optimum Secret Sharing Scheme Secure against Cheating
- Brief announcement: Optimal amortized secret sharing with cheater identification
- Circular external difference families, graceful labellings and cyclotomy
- Efficient robust secret sharing from expander graphs
- Symmetric threshold multipath (STM): an online symmetric key management scheme
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
This page was built for publication: Optimum Secret Sharing Scheme Secure against Cheating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876900)
