Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
From MaRDI portal
Recommendations
- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- On cheater identifiable secret sharing schemes secure against rushing adversary
- scientific article; zbMATH DE number 697808
- Almost optimum \(t\)-cheater identifiable secret sharing schemes
- Secret sharing schemes with detection of cheaters for a general access structure
- scientific article; zbMATH DE number 1390062
- A (t, n) threshold secret sharing system with efficient identification of cheaters
- A perfect threshold secret sharing scheme to identify cheaters
- Computational Science and Its Applications – ICCSA 2004
- Cheater identification on a secret sharing scheme using GCD
Cited in
(10)- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Ramp secret sharing with cheater identification in presence of rushing cheaters
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- On cheater identifiable secret sharing schemes secure against rushing adversary
- scientific article; zbMATH DE number 1390062 (Why is no real title available?)
- Cheater identification on a secret sharing scheme using GCD
- Revisiting group oriented secret sharing schemes
- Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
This page was built for publication: Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5253627)