On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
From MaRDI portal
Publication:2198255
Recommendations
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- scientific article; zbMATH DE number 2085431
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Sharing DSS by the Chinese remainder theorem
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
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
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Chinese remaindering with errors
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
- Distributive weighted threshold secret sharing schemes
- Elements of Information Theory
- How to share a secret
- Threshold cryptography based on Asmuth-Bloom secret sharing
Cited in
(7)- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- Homomorphic extensions of CRT-based secret sharing
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Multi-secret sharing model based on Hermite interpolation polynomial and quantum graph state
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
This page was built for publication: On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198255)