自A.Shamir和G.R.Blakley于1979年各自独立地提出“秘密共享”的思想及方法以后,现已出现了多种秘密共享方案。这些方案可适应不同的环境要求,然而,这些方案都是在域上建立的,当所面临问题的背景结构不构成域时会遇到麻烦。本文提出了一种新的秘密共享方案,该方案直接在整数环Z上实现,不需要对环Z作任何扩张,因而具有较高的有效性。其安全性基于Hash函数的安全性和大整数分解的难解性。 Since A.Shamir and G.R.Blakley independently proposed the idea and method of “secret sharing” in 1979, a variety of secret sharing schemes have emerged. These scenarios can be adapted to different environmental requirements, however, all of these scenarios are built on the domain and can be troubling when the background structure of the problem being faced does not form a domain. In this paper, a new secret sharing scheme is proposed, which is implemented directly on the integer ring Z. It does not require any expansion of the ring Z, so it has high validity. Its security is based on the security of hash functions and the difficulty of large integer decomposition.