Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
Weighted Threshold Secret Image Sharing
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
| Hi-index | 0.00 |
This paper introduces the generalization of Mignotte modular secret sharing over the polynomial rings. Mignotte proposed threshold secret sharing over the ring of integers. We extend his method for the ring of polynomials which is Euclidean as well and therefore allowing to use the Chinese Remainder Theorem. In particular, we prove that any access structure can be realized within this modular approach. Further, we put the bounds on the number of participants of such secret sharing scheme with the moduli of the same degree. And finally we estimate the information rate of the new scheme.