Constructing ideal secret sharing schemes based on Chinese remainder theorem
From MaRDI portal
Publication:1710679
DOI10.1007/978-3-030-03332-3_12zbMath1447.94065OpenAlexW2898356255MaRDI QIDQ1710679
Wenchao Huang, Keju Meng, Yu Ning, Fuyou Miao, Yan Xiong, Xing-Fu Wang
Publication date: 23 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_12
Related Items (4)
Randomized component based secure secret reconstruction in insecure networks ⋮ A perfect secret sharing scheme for general access structures ⋮ Ramp scheme based on CRT for polynomial ring over finite field ⋮ Secret sharing schemes for infinite sets of participants: a new design technique
Cites Work
- Generalized oblivious transfer by secret sharing
- Strong \((n, t, n)\) verifiable secret sharing scheme
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Weighted threshold secret sharing schemes
- A \((t,n)\) multi-secret sharing scheme
- Realizing secret sharing with general access structure
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Chinese remaindering with errors
- Generalized Mignotte's Sequences Over Polynomial Rings
- Secret-Sharing Schemes: A Survey
- How to share a secret
- How to Share a Secret
- A modular approach to key safeguarding
- Alternative Protocols for Generalized Oblivious Transfer
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing ideal secret sharing schemes based on Chinese remainder theorem
