Distributed multiplication computation is an important part of secure multi-party computation and a basic protocol of threshold cryptography. Based on the verifiable secret sharing techniques, two robust distributed multiple multiplication schemes over integer are presented. One of them, the parallelizable non-interactive scheme is more efficient, and remains the property of non-interaction. The other can achieve the optimal resilience.