论文部分内容阅读
提出了一种从3轮公开掷币的对任何NP语言的诚实验证者零知识证明系统到纯公钥模型下4轮(轮最优)对同一语言的具有并发合理性的并发零知识证明系统.该转化方法有如下优点:1)它只引起O(1)(常数个)额外的模指数运算,相比Di Crescenzo等人在ICALP05上提出的需要Θ(n)个额外的模指数运算的转化方法,该系统在效率上有着本质上的提高,而所需的困难性假设不变;2)在离散对数假设下,该转化方法产生一个完美零知识证明系统.注意到Di Crescenzo等人提出的系统只具有计算零知识性质.该转化方法依赖于一个特殊的对承诺中的离散对数的3轮诚实验证者零知识的证明系统.构造了两个基于不同承诺方案的只需要常数个模指数运算的系统,这种系统可能有着独立价值.
This paper proposes a concurrency-based zero-knowledge proof system with concurrency rationality from three rounds of tossing an honest verifier zero knowledge of any NP language to a pure public key model of four rounds (optimal round) of the same language The conversion method has the following advantages: 1) It only leads to an additional modulus exponentiation of O (1) (constants), which is in excess of Θ (n) extra modulus exponentiations proposed by Di Crescenzo et al. At ICALP05 Conversion method, the system has a substantial increase in efficiency, and the required assumptions of difficulty unchanged; 2) Under the discrete logarithm hypothesis, the conversion method produces a perfect zero-knowledge proof system. Note that Di Crescenzo et al The proposed system only has the property of computing zero knowledge.The transformation method relies on a special zero-knowledge proof system of 3-round honesty verifiers on the discrete logarithm of promises, and constructs two zero-knowledge proofs based on different commitment schemes, System of modular exponentiation, which may have independent value.