A Distributed Local Identification Scheme Based on Zero-Knowledge Proofs

在分布式网络系统中，为一组用户建立认证方案是可行的。这使得系统能够实现一种机制，通过认证来区分用户，并允许他们使用计算和/或网络资源。在本研究中，我们提出了一种新的分布式本地身份方案来实现这种机制，即基于零知识证明的方案。为了证明该方案的有效性，我们还讨论了一种基于公钥密码系统的方案，并比较了两种方案的性能。我们首先设计了这两种分布式本地身份识别方案，然后从安全级别、时间复杂度、通信复杂度和空间复杂度等方面分析了这两种方案的性能，并基于零知识证明验证了方案的可用性。通过分析，我们发现对于基于零知识证明的方案，通信复杂度在整体性能中占主导地位，而对于基于公钥密码体制的方案，时间复杂度在整体性能中占主导地位。结果表明，基于零知识证明的方案比基于公钥密码系统的方案更有优势，特别是在宽带网络可访问的情况下。

In distributed network systems, it is practical to establish authentication schemes for a group of users. This enables the system to realize a mechanism by which is discriminates users by authentication, and permits them to use the computing and/or network resources.In this research, we proposed a new distributed local identification scheme that achieves such a mechanism, i.e., scheme that is based on zero-knowledge proofs. To show the availability of the proposed scheme, we also discuss a scheme based on public-key cryptosystems and compare the performance of the two systems. We first design those two distributed local identification schemes and then analyze the performance of these schemes with respect to security level, time complexity, communication complexity, and space complexity, to verify the availability of the scheme based on zero-knowledge proofs. By the analysis, we observe that for the scheme based on zero-knowledge proofs, the communication complexity is dominant of the overall performance but for the scheme based on public-key cryptosystems, the time complexity is dominant of the overall performance. As a result, we show that the scheme based on zero-knowledge proofs is more advantageous than the scheme based on public-key cryptosystems, especially when a broadband network is accessible.