General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
From MaRDI portal
Publication:2866729
DOI10.1016/j.entcs.2007.01.065zbMath1277.94058OpenAlexW2032253290MaRDI QIDQ2866729
Publication date: 13 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.01.065
Related Items (10)
Unnamed Item ⋮ Distributive weighted threshold secret sharing schemes ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Verifiable multi-secret sharing based on LFSR sequences ⋮ An ID-based signcryption scheme with compartmented secret sharing for unsigncryption ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ New efficient and practical verifiable multi-secret sharing schemes ⋮ Realizing secret sharing with general access structure ⋮ Threshold changeable secret sharing with secure secret reconstruction ⋮ Multiparty mediated quantum secret sharing protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Receipt-free secret-ballot elections (extended abstract)
- Multi-Authority Secret-Ballot Elections with Linear Work
- How to share a secret
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Chinese remaindering with errors
- On secret sharing systems
- Advanced Topics in Computional Number Theory
- How to Share a Secret
- A modular approach to key safeguarding
- New Proof of the Generalized Chinese Remainder Theorem
- The General Chinese Remainder Theorem
This page was built for publication: General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
