We introduce the two directional zero knowledge proof is to study secure multi party computation .

提出并研究双向 零知识 证明的目的是希望用双向 零知识的思想，研究多方安全计算问题。

Research on Zero - Knowledge Proof and Digital Signature

零知识 证明与数字签名理论的研究

A new threshold digital signature using the research result about the digital signature with zero knowledge proof was proposed in this paper .

基于目前团体签名的实际需要及数字签名的研究，结合 交互式 零知识 证明的概念，提出了一种新的门限数字签名算法。

In the paper we present a notion about two directional zero knowledge proof and study the relation between two directional zero knowledge proof and traditional one directional zero knowledge proof . We propose several simple two directional zero knowledge problem proof protocols .

提出了双向 零知识 证明的概念，研究了双向零知识证明与传统的零知识证明之间的关系，设计了两个最基本的双向零知识证明协议。

The zero knowledge proof based on bit - commitment channel

基于比特承诺通道的 零知识 证明

The security of the system was improved by adopting the elliptic curve zero knowledge proof in the payment protocol .

在支付协议中采用并行的椭圆曲线 零知识 证明，提高了系统的安全性。

The improved system utilizes good properties of elliptic curve cryptography system and adopts zero knowledge proof .

改进的系统利用了椭圆曲线良好的密码特性，并采用 零知识 证明 方法。

New Development of Zero Knowledge Proof Systems

零知识 证明系统的新进展

This paper deals with the proximate zero order ( R ) of Dirichlet series in the right-half plane weakens the condition of some known results obtains stronger results and simplifies the original proof .

本文研究了右半平面内解析Dilrichlet级数的准确 零（R）级，减弱了已有结果的条件，得到了更强的结论并简化了原 证明。

At the same time same security level as RSA has can be achieved by ellipse curve-based zero knowledge proof with the key much shorter in length than that of RSA .

同时基于椭圆曲线上的 零知识 证明可以用比RSA短得多的密钥，达到与RSA同等级别的安全性。

Application of Elliptic Curves Cryptosystem Methods in Zero Knowledge Proof Protocol

椭圆曲线密码算法在 零知识 证明方案中的应用

A Perfect Zero - Knowledge Proof System for the Discrete Root Problem

一种关于离散根问题的完美 零知识 证明系统

Chapter 2 introduces the common concepts and definitions of SMC including the definition of security and behaviors of participants etc. and oblivious transfer zero knowledge proof systems circuit evaluation protocol .

第2章 给出了安全多方计算较为详细的介绍，其中包括安全定义、参与者行为等基本概念，茫然传送、 零知识系统、电路求值协议等基本理论。

For information protection system based on Harn 's digital signature scheme and zero knowledge proof this paper presents a double way authentication access control scheme .

针对信息保护系统，该文基于Harn数字签名方案和 零知识 证明构造了一种双向认证访问控制方案。

About zero being n-1 multiple characteristic root of n th order uniform positive matrix this paper gives another proof distinguished from those in 1 .

关于 零是n阶一致性正矩阵的n－1重特征根，本文给出了与文献〔1〕不同的另一 证 法。

A digital signature scheme with multiple functions in special environment is proposed which is called forward-secure and confirmer digital signature scheme based on zero knowledge proof .

提出了一种具有多功能特殊用途的数字签名方案&基于 零知识 证明的前向安全可证实签名方案。

A proved secure protocol for watermark verification based on perfect zero knowledge interactive proof system and bit commitments scheme is proposed .

基于完全 零知识交互 证明系统和位委托方案，提出了可证明的安全水印认证协议。

Research on Zero Knowledge Proof Protocol of Watermark Detection

零知识 数字水印检测协议研究

A new efficient normative signature scheme based on discrete logarithm assumption and factoring assumption is proposed . A zero knowledge proof protocol between the nominee and a third party to verify the signature is also constructed .

提出了一种基于离散对数假设与因子分解假设的有效的记名签名方案，构造了一个被签名人与第三方之间的 零知识 证明协议。

XML Digital Signature Scheme Based on Zero Knowledge Proof

基于 零知识 证明的XML数字签名方案

In this paper some watermark verification protocols based on bit commitment and zero knowledge proof are proposed .

对基于比特承诺和 零知识 证明的水印验证协议进行了研究。

Discussion of Three Basic Zero Knowledge Proof Types Solutions

三种基本 零知识 证明类型的实现方案探讨

The proposed double way authentication access control scheme 's computation security based upon Harn 's digital signature scheme and Zero knowledge proof does not lower than the computation complexity of solving Discrete Logarithm Problem .

基于Harn数字签名方案和 零知识 证明给出的这一双向认证访问控制方案的计算安全性不低于求解离散对数问题的计算复杂性。

This paper presents a perfect zero knowledge proof system for a decision problem which is computationally equivalent to the Discrete Root Problem and its zero knowledge property does not rely on any assumptions .

本文提出了一种关于离散根问题的完美 零知识 证明系统，并且其零知识性不依赖于任何前提假设。

Kind of Zero Knowledge Proof Algorithm and Its Use

一种 零知识 证明算法及其应用

Electronic cash based on zero knowledge proof

基于 零知识 证明的电子现金