An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem
DOI10.1080/00207160.2016.1274738zbMath1392.94924OpenAlexW2561129690MaRDI QIDQ3174872
Rong-Jaye Chen, Yung-Hsiang Liu
Publication date: 18 July 2018
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1274738
prime number theoremsecret sharingChinese remainder theoremasmuth-Bloom secret sharingweighted threshold secret sharing
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Distribution of primes (11N05) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verifiable multi-secret sharing based on LFSR sequences
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Hierarchical threshold secret sharing
- Multipartite secret sharing by bivariate interpolation
- On the information rate of perfect secret sharing schemes
- The complexity of the graph access structures on six participants
- Sharing DSS by the Chinese remainder theorem
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- New efficient and practical verifiable multi-secret sharing schemes
- Perfect secret sharing schemes for graph access structures on six participants
- Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes
- Decentralizing Attribute-Based Encryption
- How to share a secret
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- MPFR
- Characterizing Ideal Weighted Threshold Secret Sharing
- How to Share a Secret
- A modular approach to key safeguarding
This page was built for publication: An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem
