A New Verifiable Multi-Secret Sharing Scheme Over the Ring of Gaussian Integers

摘要

T32 paper proposes a ( t, n) threshold multi-secret sharing scheme over the ring of Gaussian integers. The scheme does not need a secure channel and participants select their secret shadows by themselves. Moreover, the difficulty of factoring the modulus is enhanced. The scheme is based on the Shamir threshold scheme, the RSA cryptosystem, the difficulty of factoring elements in the ring of and intractability of the Discrete Logarithm.