A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
From MaRDI portal
Publication:2446574
Recommendations
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Remarks on the classical threshold secret sharing schemes
- Optimum general threshold secret sharing
- A scheme for threshold multi-secret sharing
- An efficient \((t,n)\) threshold multi-secret sharing scheme
- Theory of Cryptography
- Characterizing Ideal Weighted Threshold Secret Sharing
- A remark on hierarchical threshold secret sharing
Cites work
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- A modular approach to key safeguarding
- Chinese remaindering with errors
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- How to share a secret
Cited in
(3)
This page was built for publication: A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446574)