机构地区: 广州大学数学与信息科学学院
出 处: 《广州大学学报(自然科学版)》 2009年第5期23-27,共5页
摘 要: ∑-协议是密码学领域中的一种重要工具.论文证明了关系R上的∑-协议具有如下的几个性质:①如果关系R至少存在两个证据,则在关系R上的∑-协议是证据隐藏协议;②在单项置换存在的假设下,任意NP问题具有∑-协议;③存在计算零知识的∑-协议;④∑-协议可转换为零知识证明. ∑-protocol is an important tool in cryptology field.In this paper,we will prove that any ∑-protocol has the following characters: ①it is a witness hiding protocol if there exist at least two witnesses on R;②there exists a ∑-protocol on any NP statement under the assumption of the existence of one-way permutation;③there exist ∑-protocols with computational zero-knowledge;④∑-protocol can be changed into a zero-knowledge proof.