A collaborative secret sharing scheme based on the Chinese remainder theorem
From MaRDI portal
Publication:2160650
DOI10.3934/MBE.2019062zbMath1497.94139OpenAlexW2915355970WikidataQ92853278 ScholiaQ92853278MaRDI QIDQ2160650
Daxin Nie, Jinzhao Wu, Yixuan Song, Xingxing Jia, Dao-Shun Wang
Publication date: 3 August 2022
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2019062
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Reducing file size and time complexity in secret sharing based document protection ⋮ A perfect secret sharing scheme for general access structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes
- Distributive weighted threshold secret sharing schemes
- Noisy Chinese remaindering in the Lee norm
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- Realizing secret sharing with general access structure
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- A scheme for threshold multi-secret sharing
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- How to share a secret
- An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem
- Chinese remaindering with errors
- How to Share a Secret
- A modular approach to key safeguarding
- Group Authentication
- Authenticated Group Key Transfer Protocol Based on Secret Sharing
This page was built for publication: A collaborative secret sharing scheme based on the Chinese remainder theorem
