Chinese remainder theorem: applications in computing, coding, cryptography
Chinese remainder theorem: applications in computing, coding, cryptography
On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Proceedings of the 1982 conference on Cryptography
Chinese remaindering with errors
IEEE Transactions on Information Theory
A modular approach to key safeguarding
IEEE Transactions on Information Theory
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
Information Sciences: an International Journal
| Hi-index | 0.89 |
The study of the asymptotic idealness of the Goldreich-Ron-Sudan (GRS, for short) threshold secret sharing scheme was the subject of several research papers, where sufficient conditions were provided. In this paper a necessary and sufficient condition is established; namely, it is shown that the GRS threshold secret sharing scheme is asymptotically ideal under the uniform distribution on the secret space if and only if it is based on 1-compact sequences of co-primes.