Abstract:
This paper deals with a generalization of the secret sharing using Chinese remainder theorem over the integers to multivariate polynomials over a finite field. We work with the ideals and their Gröbner bases instead of integer moduli. Therefore, the proposed method is called GB secret sharing. It was initially presented in our previous paper. Now we prove that any threshold structure has ideal GB realization. In a generic threshold modular scheme in ring of integers the sizes of the share space and the secret space are not equal. So, the scheme is not ideal and our generalization of modular secret sharing to the multivariate polynomial ring is more secure.