Abstract: Since Shamir’s secret sharing scheme does not have the property of the multiplicative homomorphism, an encoding method is utilized for privacy-preserving data to overcome the drawbacks in secure distributed multiplication calculation when using traditional Shamir’s polynomial to share the product of n secrets. Using this encoding method with multiplicative homomorphism and a commitment scheme supporting additive homomorphism, a new secure distributed secret sharing scheme of n product in one session is implemented and the proposed scheme is secure under the presence of malicious participants. The analysis shows that proposed scheme is not only more simple and feasible but also more efficient than previous schemes.