On Mignotte secret sharing schemes over Gaussian integers
Keywords:
Secret sharing, Mignotte sharing scheme, Gaussian integer, Chinese remainder theorem
Abstract
Secret Sharing Schemes (SSS) are methods for distributing a secret among a set of participants. One of the first Secret Sharing Schemes was proposed by M. Mignotte, based on the Chinese remainder theorem over the ring of integers. In this article we extend the Mignotte's scheme to the ring of Gaussian Integers and study some of its properties. While doing this we aim to solve a gap in a previous construction of such extension. In addition we show that any access structure can be made through a SSS over Z[i].
