A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
From MaRDI portal
Publication:5504640
Recommendations
- Sharing DSS by the Chinese remainder theorem
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- Perfect verification of modular scheme
Cites work
- scientific article; zbMATH DE number 2085431 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- Distributed Provers with Applications to Undeniable Signatures
- Efficient generation of shared RSA keys
- Efficient proofs that a committed number lies in an interval
- How to share a secret
- Robust threshold DSS signatures
- Secret sharing schemes with applications in security protocols
- Threshold cryptography based on Asmuth-Bloom secret sharing
Cited in
(7)- Sharing DSS by the Chinese remainder theorem
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems
- Homomorphic extensions of CRT-based secret sharing
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- scientific article; zbMATH DE number 5263446 (Why is no real title available?)
- Perfect verification of modular scheme
This page was built for publication: A Verifiable 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 Q5504640)