在计算机通信网中如何解决权威人士发布各种重要指令的问题是本文研究内容。文中提供了一种（１－ｎ）身份验证方法，即一个证明者向ｎ个验证者作零知识交互式（广播）证明。可实现权威人士的身份证明；而介绍的另一种（ｔ，ｎ）门限签名算法，则解决了重要文件或命令的联合有效签名的问题。 How to solve the issue of various important directives issued by authoritative persons in the computer communication network is the content of this article. A (1-n) authentication method is provided in this paper, that is, a certifier makes zero knowledge interactive (broadcast) proof to n verifiers. The proof of identity of the authoritative person can be achieved. Another introduced (t, n) threshold signature algorithm solves the problem of joint valid signatures of important documents or commands.