A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
From MaRDI portal
Publication:5504640
DOI10.1007/978-3-540-89754-5_32zbMATH Open1203.94132OpenAlexW206566878MaRDI QIDQ5504640FDOQ5504640
Authors: Kamer Kaya, Ali Aydın Selçuk 
Publication date: 22 January 2009
Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/26802
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
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Title not available (Why is that?)
- Efficient generation of shared RSA keys
- Secret sharing schemes with applications in security protocols
- Title not available (Why is that?)
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Title not available (Why is that?)
- Efficient proofs that a committed number lies in an interval
- Title not available (Why is that?)
- Robust threshold DSS signatures
- Distributed Provers with Applications to Undeniable Signatures
Cited In (6)
- Sharing DSS by the Chinese remainder theorem
- Homomorphic extensions of CRT-based secret sharing
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Title not available (Why is that?)
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)
