An asymptotically perfect secret sharing scheme based on the Chinese remainder theorem
DOI10.1080/00207160.2016.1274738zbMATH Open1392.94924OpenAlexW2561129690MaRDI QIDQ3174872FDOQ3174872
Authors: Yung-Hsiang Liu, Rong-Jaye Chen 
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
Recommendations
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
- scientific article; zbMATH DE number 2085431
- scientific article; zbMATH DE number 5263446
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
prime number theoremsecret sharingChinese remainder theoremasmuth-Bloom secret sharingweighted threshold secret sharing
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Distribution of primes (11N05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- MPFR
- Title not available (Why is that?)
- On the information rate of perfect secret sharing schemes
- Title not available (Why is that?)
- Threshold cryptography based on Asmuth-Bloom secret sharing
- New efficient and practical verifiable multi-secret sharing schemes
- Multipartite secret sharing by bivariate interpolation
- Characterizing Ideal Weighted Threshold Secret Sharing
- Hierarchical threshold secret sharing
- Verifiable multi-secret sharing based on LFSR sequences
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Decentralizing attribute-based encryption
- Title not available (Why is that?)
- A modular approach to key safeguarding
- The complexity of the graph access structures on six participants
- How to Share a Secret
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Perfect secret sharing schemes for graph access structures on six participants
- Conjunctive Hierarchical Secret Sharing Scheme Based on MDS Codes
- Sharing DSS by the Chinese remainder theorem
Cited In (7)
- A wireless secret key generation method based on Chinese remainder theorem in FDD systems
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- A collaborative secret sharing scheme based on the Chinese remainder theorem
- Title not available (Why is that?)
- Ramp scheme based on CRT for polynomial ring over finite field
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
Uses Software
This page was built for publication: An asymptotically perfect 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 Q3174872)
