An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
From MaRDI portal
Publication:3174872
Recommendations
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- scientific article; zbMATH DE number 2085431
- scientific article; zbMATH DE number 5263446
- A new threshold changeable secret sharing scheme 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?)
- scientific article; zbMATH DE number 1539356 (Why is no real title available?)
- A modular approach to key safeguarding
- Characterizing Ideal Weighted Threshold Secret Sharing
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Conjunctive hierarchical secret sharing scheme based on MDS codes
- Decentralizing attribute-based encryption
- Hierarchical threshold secret sharing
- How to share a secret
- How to share a secret
- MPFR
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Multipartite secret sharing by bivariate interpolation
- New efficient and practical verifiable multi-secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Perfect secret sharing schemes for graph access structures on six participants
- Sharing DSS by the Chinese remainder theorem
- The complexity of the graph access structures on six participants
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Verifiable multi-secret sharing based on LFSR sequences
Cited in
(14)- Sharing DSS by the Chinese remainder theorem
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- General secret sharing based on the Chinese remainder theorem with applications in e-voting
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- A weight pre-assignment scheme for Chinese remainder theorem
- Secret sharing algorithm based on Chinese remainder theorem
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Ramp scheme based on CRT for polynomial ring over finite field
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- Chinese remainder theorem-based secret image sharing with small-sized shadow images
This page was built for publication: An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174872)
